Since you opened the file with read-only access (r instead of r+),
attempting to write to the file (through the mmap array) is an error.
On Thu, Apr 9, 2015 at 9:15 AM Maco Anshu maco.an...@gmail.com wrote:
Hi,
I am trying to reproduce an algorithm http://arxiv.org/abs/1312.5542 in
Julia.
Seems to work for me:
julia @doc Open readme of package in browser.-
function Pkgreadme(package)
file = Pkg.dir(package) * / * README.md
isfile(file) `x-www-browser $(file)`
end
Pkgreadme (generic function with 1 method)
julia Pkgreadme(FEM)
`x-www-browser
I thought I would share my success with all of you. By making a userimg.jl
in the julia folder containing the following and building the sysimg with
the command bellow, the load time of of PyPlot's can be reduced by a factor
of 3.
julia -e tic(); using PyPlot; toc()
INFO: Loading help data...
On Thursday, April 9, 2015 at 3:33:29 PM UTC+2, Daan Huybrechs wrote:
Trying to grasp staged functions in Julia 0.4, I found the new
documentation https://github.com/JuliaLang/julia/pull/10673 and this
issue https://github.com/JuliaLang/julia/pull/7474 very helpful. (Note
from the issue
This question is related to Julia and general function minimization
techniques. if I have two function f(x, y) and g(x, y). How would one find
the value of x, and y that minimizes both functions simultaneously? I
understand to the limit this is equal to finding roots if both functions
are
Hello,
I am quite new to Julia and I would like to use the GSL package
https://github.com/jiahao/GSL.jl in order to find the roots of a
multidimensional system of equations.
According to the reference manual
Thanks for the response. I see that they both result in a GC stack frame
on the program's stack and that the GC determines whether the frame holds
the addresses to the variables or pointers to those addresses based on
whether the first entry in the frame is even or odd.
On Friday, March 27,
A basic debugging question:
If I come across an Error with a stack trace like the following, what can I
conclude about where convert was called?
ERROR: `convert` has no method matching
convert(::Type{Array{Complex{Float64},2}}, ::Array{Complex{Float64},1})
in wait at ./task.jl:284
in wait
Le mardi 10 mars 2015 17:56:40 UTC+1, Mauro a écrit :
Have a look at stagedfunction (v0.4).
I tried with the nightly build, but without success (using
stagedfunction
instead of function) - however, it looks like it is the solution, maybe
I
will just have to wait until this is
Related: https://github.com/JuliaLang/julia/issues/10618. You should be
able to do A1[1,vec(A1[1,:].!=0)] to get around this.
On Thu, Apr 9, 2015 at 11:12 AM, Changan Liu lca...@gmail.com wrote:
I meet problems about translating my matrix computation codes from Matlab
to Julia.
Here is the
I now get
*CHOLMOD warning: not positive definiteERROR: `-` has no method matching
-(::(Array{Complex{Float64},1},Array{Complex{Float64},2},Int64,Int64,Int64,Array{Complex{Float64},1}),
::Float64)*
I must probably mention that I generate my sparse matrix using this
constructor:
https://github.com/tanmaykm/ChainedVectors.jl
--Tim
On Wednesday, April 08, 2015 09:24:03 PM Kevin Squire wrote:
AFAIK, there's nothing really like that right now, but what do you plan to
do with the data? Most linear algebra code, for example, calls out to
BLAS, which requires data to be
I am trying to write a simple utility that opens the readme of a package
in my browser:
@doc Open readme of package in browser.-
function Pkgreadme(package)
file = Pkg.dir(package) * / * README.md
isfile(file) `x-www-browser $(file)`
end
but get the error
ERROR: UndefVarError: file not
Could you post a self-sufficient code so that the errors can be reproduced?
-viral
On Thursday, April 9, 2015 at 11:40:00 PM UTC+5:30, Andrei Berceanu wrote:
I now get
*CHOLMOD warning: not positive definiteERROR: `-` has no method matching
Thanks! The primary work is either quick previewing of or format translation of
large numbers of very large files. We want reasonable random access or
sequential access speed to what may be terabytes of data. Cleverness with block
buffering, i/o, compression, etc. are all games for another part
Hello,
I am new to Julia and am trying to get it to use multi-threaded BLAS via
openBLAS on an HPC node. I compiled it on the HPC and in Julia I check
julia versioninfo()
Julia Version 0.3.8-pre+2
Commit af187c5 (2015-03-25 14:33 UTC)
Platform Info:
System: Linux (x86_64-unknown-linux-gnu)
Hi,
I am trying to reproduce an algorithm http://arxiv.org/abs/1312.5542 in
Julia. Since the array for which I want to find the Principle Components
for is huge, I would need to use it as a memory mapped as many discussions
in the mailing list point out.
However when I try to perform any set
Try
eigs(A, nev=1, which=:SM)
You might want to look into the docs to see the other keywords, for example if
you need the eigenvector(s) as well.
Best,
Alex.
On Thursday, 9 April 2015 19:34:40 UTC+2, Andrei Berceanu wrote:
How can I get the minimum eigenvalue of a sparse matrix?
I found
On Thu, 2015-04-09 at 17:57, Benjamin Piwowarski benja...@bpiwowar.net wrote:
Le mardi 10 mars 2015 17:56:40 UTC+1, Mauro a écrit :
Have a look at stagedfunction (v0.4).
I tried with the nightly build, but without success (using
stagedfunction
instead of function) - however, it
Below deprecation warnings seem inconsistent. Is there something I'm
missing?
PS Not sure the right procedure for a possible git-issue that I'm not
sure is actually an issue: should I just file the issue and let it be
closed if its not a bug, or post on julia-users first to double check?
Do you know apriori that the minima of f and g are at the same value of
(x,y)? If so, then you can just minimize h(x,y) = f(x,y) + g(x,y). If the
two minimums are located in different points, the problem does not seem
sufficiently well-posed.
On Thursday, April 9, 2015 at 4:19:31 PM UTC-4,
That's because the default configured maximum is 16 cores.
Look for `NUM_THREADS` in deps/Makefile. The reason we keep this low is
because openblas allocates NUM_THREADS buffers on startup, and it makes
julia consume a lot of memory.
See: https://github.com/xianyi/OpenBLAS/issues/321
You can
How can I get the minimum eigenvalue of a sparse matrix?
I found eigmin(A), but it only seems to work on dense matrices.
ERROR: `eigmin` has no method matching
eigmin(::SparseMatrixCSC{Complex{Float64},Int64})
It's hard to post the code because the function that generates the matrix A
is quite involved.
However, I tracked down the error. In fact the problem was that whereas
before I had
*val = eigmin(full(A))*
I was now trying to do
*val = eigs(A, nev=1, which=:SM) *
Which of course fails because
floor(Integer,x) converts x to some integer type by flooring; round(Int,x)
converts x to the specific type Int by rounding. You can see the round
variation of the former method too:
julia iround(4.5)
WARNING: iround(x) is deprecated, use round(Integer,x) instead.
in int at ./deprecated.jl:29
in
I meet problems about translating my matrix computation codes from Matlab
to Julia.
Here is the example :
In Matlab :
A1=[0 2 3;4 0 6;7 8 0];
B=A1(A1(:,1)~=0,1)
C=A1(1,A1(1,:)~=0)
We can get :
B =
4
7
C =
2 3
In Julia :
A1=[0 2 3;4 0 6;7 8 0]
A1[A1[:,1].!= 0,1]
we
Thanks. It works now.
गुरुवार, 9 अप्रैल 2015 को 7:27:05 अपर UTC+5:30 को, Jameson ने लिखा:
Since you opened the file with read-only access (r instead of r+),
attempting to write to the file (through the mmap array) is an error.
On Thu, Apr 9, 2015 at 9:15 AM Maco Anshu maco@gmail.com
What about CUDA.jl (not updated for a year) and OenCL.jl (updated 3 months
ago)? I have no experience with either, so am just curious whether or not
these are not usable.
On Saturday, April 4, 2015 at 5:49:56 PM UTC+11, Viral Shah wrote:
Do you mean writing ODE solvers in Julia that run on
Trying to grasp staged functions in Julia 0.4, I found the new documentation
https://github.com/JuliaLang/julia/pull/10673 and this issue
https://github.com/JuliaLang/julia/pull/7474 very helpful. (Note from the
issue that the syntax may still change from `stagedfunction` to, perhaps,
Hello All,
The Institute for Computational and Mathematical Engineering at Stanford is
pleased to have Andreas Noack and Jiahoa Chen speaking in our Linear
Algebra and Optimization seminar this Thursday and next. Today's talk will
be livestreamed via YouTube starting at 4:15pm PDT.
30 matches
Mail list logo
