[julia-users] Wrap fortran 90 interface code for DDE

Dear users, I would like to wrap the code to solve delay differential equations. I have been wrapping C code in the past, but I don't know much about fortran. In the file *dde_solver_m.f90*, it is said that one must call the fortran

Re: [julia-users] Wrap fortran 90 interface code for DDE

Thank you, that is a nice suggestion. I will try to wrap RETARD and RADAR. However, the structure of these fortran code seems much simpler than the one I linked above which has kinda of a classe structure. Any idea in this case?

[julia-users] Re: Wrap fortran 90 interface code for DDE

I am trying something simpler. I added a function in the f90 file that call the relevant function in order to remove the issue of having optional arguments. Hence, I wrote: FUNCTION DKL_4_SIMPLE(NVAR,DDES,DELAYS,HISTORY,TSPAN) RESULT (SOL) ! Both BETA and HISTORY are user supplied

[julia-users] Re: Wrap fortran 90 interface code for DDE

Thank you for your suggestion, I will take a look. Best regards

[julia-users] Re: Euler Maruyama for neural networks, slower than python

No gain was noticed. >

[julia-users] Re: Euler Maruyama for neural networks, slower than python

HI, here it is: _ _ _(_)_ | A fresh approach to technical computing (_) | (_) (_)| Documentation: http://docs.julialang.org _ _ _| |_ __ _ | Type "?help" for help. | | | | | | |/ _` | | | | |_| | | | (_| | | Version 0.4.2 (2015-12-06 21:47 UTC) _/

[julia-users] Euler - Maruyama slower than python

Hi, I am trying to implement Euler-Maruyama method in Julia for a neural network and it is 4x slower than python. Can someone give me a hint to fill that gap? Thank you for your help, Best regards, ### Python code import numpy as np import time def sig(x): return 1.0/ (1. + np.exp(-x))

[julia-users] Euler Maruyama for neural networks, slower than python

Hi, I want to implement Euler-Maruyama for a neural network. My implementation in numpy seems 4x faster than my Julia code 100ms vs 430ms Can anyone give me a hint about how I can speed things up please? Thank you for your help, Best regards. ## Python code import numpy as np import time

[julia-users] Re: Euler Maruyama for neural networks, slower than python

Hi, Thank you for your answer. It is a bit faster for me too but still 3x slower than numpy (note that you have to uncomment #sv = sig(V) in your code. Best regards,

Re: [julia-users] Re: Euler Maruyama for neural networks, slower than python

@Mauro, I am using the dmg located at https://s3.amazonaws.com/julialang/bin/osx/x64/0.4/julia-0.4.3-osx10.7+.dmg My timings using your code is .330s vs .1s for numpy. I would be happy if one told me that Julia has not caught yet, but the fact that you have a speedup is troubling. I have a

Re: [julia-users] numpy vs julia benchmarking for random matrix-vector multiplication

Silly me... I was using python anaconda and it seems to be user more than one process... I apologize for this, Thanks everybody for your help, Best

Re: [julia-users] Re: Euler Maruyama for neural networks, slower than python

Hi, I was using anaconda with more than one thread... That may explain the differences in timing. I aopologize for this and thank everybody for your help, Best regards.

[julia-users] eigenvalues for Matrix-Free problem

Dear Users, I would like to know if it is possible to find the first eigenvalues of a linear operator defined by a function like: A=x->FFT(x) This is achieved by eigs in Matlab but my attempts in Julia fail. Can someone give me a hint please? Thank you, Best regards,

Re: [julia-users] Re: Status of Plots.jl?

Hi, I tried your dev branch as suggested, julia> Pkg.status("Plots") - Plots 0.5.3+ dev but when typing in Atom: using Plots Plots.gr() Plots.plot(rand(100)) nothing appeared. Do I have to do something else?

[julia-users] Re: Cluster manager, change ssh

Sorry for not being precise. What I meant is that the scheduler is OAR.

[julia-users] Cluster manager, change ssh

Dear User, I would like to use Julia on a cluster, but the managing is based on OAR. For this manager, SSH is changed to oarsh. So my questions would be: - is it possible to set up julia on a cluster with OAR as clustermanager? Thank you for your help, Best regards.

[julia-users] Re: parallel for loop for list of vectors

Yes ! res = [zeros(i) for i in 1:10] would do for me. Also, if it simplifies things, the order does not matter.

[julia-users] parallel for loop for list of vectors

Dear Users, I need a small hint to perform the following parallel for loop. I know that this work: res = @parallel (hcat) for i=1:10 zeros(2) endEnter code here... but what I need is res = @parallel (hcat) for i=1:10 zeros(i) end Thank you for your help Best regards,

[julia-users] Advice for parallel computing

Hi, I have an array of composite type A = Array{MyType}(N) that have been initialized somewhere else. Currently, I am doing this operation for i=1:N doit!(A[i]) end I would like to perform this operation in parallel (threads if possible on a single computer) but SharedArray does not

[julia-users] slow for loops because of comparisons

Dear users, I would like to speed up the following code. function essai(n,s1,s2) a = zeros(Int64,n) ss1::Float64 = 0. ss2::Float64 = 0. @inbounds begin for k=1:n for i=1:length(s1) ss1 = s1[i] for j=1:length(s2) ss2 = s2[j] if ss1>ss2

Re: [julia-users] slow for loops because of comparisons

Thank you, That is much better. What I meant is to just leave a[k] += 1.

Re: [julia-users] slow for loops because of comparisons

What is strange to me is that this is much slower function essai(n, s1, s2) a = Vector{Int64}(n) @inbounds for k = 1:n ak = 0 for ss1 in s1, ss2 in s2 if ss1 > ss2 ak += 1 end end a[k] = ak end end

[julia-users] Trick to use plotlyjs in Atom

Hi, I woul dlike to share the following trick to use plotlyjs in Atom: using Plots plotlyjs() plot(rand(10)) gui() Cheers