[julia-users] Re: How to concatenate matrices by row

Look up vcat (vertical concatenate). On Tuesday, September 6, 2016 at 7:35:49 AM UTC-7, Ahmed Mazari wrote: > > Hello, > l have 10 matrices of 5000 by 700. Each matrix is stored in a file , so l > have 10 files. > l want to create a new file that contains all the matrices (5 by 700) > that

[julia-users] Re: julia error in Atom

That means that there was an error in Juno's automatic install. You have to go into the Juno REPL and type in that command, and tell us what error you actually got. My guess is it's the MbedTLS build error. Do you have cmake installed? On Monday, September 5, 2016 at 2:49:54 AM UTC-7, bineethz

[julia-users] Re: Can someone please update Winston?

l, but if >> for now you must use Winston, you might have luck with the version I forked >> and hacked to make run on 0.5: >> >> Pkg.clone("g...@github.com:MetServiceDev/Tk.jl.git") >> Pkg.clone("g...@github.com:MetServiceDev/Winston.jl.git") >> >&

Re: [julia-users] New to Julia - Need some basic help

eptember 3, 2016 at 10:49:36 AM UTC-7, Pigskin Ablanket wrote: > > Haha - good question. Didnt know what Pkg.Build("Cairo") meant - so I > havent run that yet. Should I do that? > > On Saturday, September 3, 2016 at 12:33:47 PM UTC-4, Chris Rackauckas > wrote: &g

Re: [julia-users] New to Julia - Need some basic help

Did it build correctly after using Pkg.build("Cairo")? On Saturday, September 3, 2016 at 8:33:16 AM UTC-7, Pigskin Ablanket wrote: > > So I tried all of this, but it looks like there was an error loading the > TK package. When I went to use Tk I got the following error message: > > ERROR:

Re: [julia-users] "Namespaces" for accessing fields of composite types

You can build this more generically as well. For example, if you make BigCat<:HouseCat, then put anything which extends HouseCat via composition, then you can use type Tiger <: BigCat hcat::HouseCat #Inheritance by composition end meow(c::BigCat) = println(c.hcat.age)#Define a method to make

Re: [julia-users] "Namespaces" for accessing fields of composite types

In any case where you would do copy-paste programming, you could just use the @def macro from here , and then you just place the code you would want to paste around as @def

Re: [julia-users] Re: Juila vs Mathematica (Wolfram language): high-level features

Someone can make a macro for Mathematica's pattern matching syntax. On Saturday, September 3, 2016 at 7:13:20 AM UTC-7, Andrew Dabrowski wrote: > > But what about nested pattern matching, or destructuring, isn't that much > easier in Mathematica than Julia? For example defining a function of

[julia-users] Re: Rescuing abandoned package

You can fork, update it, and then put a PR in to METADATA which changes the url for the package. Someone like @tkelman will probably try to contact the author to make sure he/she's really disappeared. Open an issue on METADATA and see if the author shows up. On Friday, September 2, 2016 at

[julia-users] Re: Online live help with Julia.

It's free: https://gitter.im/JuliaLang/julia There's usually a few people on there. I try to be on whenever I'm working with Julia (~18-20 hours a day now. Woot woot PhD!). Just ask away, there's not really any judgement there. And another place to go is StackOverflow. Just post your questions

Re: [julia-users] Is the master algorithm on the roadmap?

ur insights. >> >> On Friday, September 2, 2016 at 6:18:15 AM UTC-3, Chris Rackauckas wrote: >>> >>> This entire thread is a trip... a trip which is not really relevant to >>> julia-users. You may want to share these musings in the form of a blog >>&g

Re: [julia-users] Is the master algorithm on the roadmap?

This entire thread is a trip... a trip which is not really relevant to julia-users. You may want to share these musings in the form of a blog instead of posting them here. On Friday, September 2, 2016 at 1:41:03 AM UTC-7, Kevin Liu wrote: > > Princeton's post: >

[julia-users] Re: Juila vs Mathematica (Wolfram language): high-level features

I think types+dispatch is the right way to go. It's what Julia is founded upon, and it's what leads to really fast computations. A fast type/dispatch based symbolic system for Julia and in pure Julia would be a huge asset. And while the post said not to mention the front end, when talking about

[julia-users] Re: Questions on parallelizing code - or how to deal with objects (and not just gathering data) in parallel.

Hey, There are some things that are changed in v0.5 so I would suggest that you would start this part of the project on v0.5. That said, I think you have to build the tools yourself using the basic parallel macros. You might want to look into ParallelDataTransfer.jl

[julia-users] Re: @threads all vs. @parallel ???

That's pretty much it. Threads are shared memory, which have less overhead (and are thus faster), and can share variables between them. @parallel is multiprocessing, i.e. each worker process has its own set of defined variables which do not overlap, and data has to be transferred between them.

[julia-users] Re: How to publish a package

Some of this might be a little old now, but it'll guide you step-by-step on how to take your functions into a registered module with unit tests: http://www.stochasticlifestyle.com/finalizing-julia-package-documentation-testing-coverage-publishing/ . Hope it helps! On Tuesday, August 30, 2016

Re: [julia-users] Re: Return type of eye()

Even then, creating the 5x5 dense matrix to then copy it into A[1:5,1:5] is not what you'd want to do. Ideally would just have eye(5) return something like I which has a size, and just sets A[i,j]=1 if i=j 0 otherwise, with checks that it's the right size. Actually, the current I would do it if

[julia-users] Re: Warning when starting Julia in Juno: require(Symbol) in module Base at loading.jl:317 overwritten...

Hey, This warning has been around for awhile. Nothing to be concerned about, but also hopefully will be something that goes away soon. On Monday, August 29, 2016 at 10:26:29 PM UTC-7, Dennis Eckmeier wrote: > > Hi, > > Getting started with Julia, I installed Julia, and then Juno on Atom. I >

[julia-users] Re: Adding items into a tuple

Tuples are immutable by design. This is why they are fast, but also why you can't push into them. On Monday, August 29, 2016 at 10:26:29 PM UTC-7, Alexei Serdiuk wrote: > > Hi, > > I need to choose items from a range (1:N) according to some condition and > to push them into a tuple. > > I

Re: [julia-users] Re: Return type of eye()

I just think the moment you start mixing default behaviors, you teaching becomes exponentially harder. I found range objects not that hard to teach, just "it uses an abstract version of an array to not really build the array, but know what the value would be every time you want one. If you

[julia-users] Re: FYI: Second transpiler to Julia(?), from Ruby, and benchmarks

That's a good showing for Julia for the larger matrices? However, for smaller matrices it's a large constant time. Is it including startup/compilation time? Did they not "run it twice"? On Monday, August 29, 2016 at 8:57:32 AM UTC-7, Páll Haraldsson wrote: > > > I have no relation to this.. > >

Re: [julia-users] Re: Return type of eye()

> > Am Montag, 29. August 2016 18:04:15 UTC+2 schrieb Chris Rackauckas: >> >> As Julio asks, why should the default be a dense identity matrix? Who >> actually wants to use that? I agree `I` should be in more visible in the >> docs and in most cases it's the bett

Re: [julia-users] Re: Return type of eye()

y element. Use > Diagonal(ones(n)) if you want a diagonal identity matrix. I see no reason > at all why eye should be changed. > > On Monday, August 29, 2016 at 4:32:34 PM UTC+2, Chris Rackauckas wrote: >> >> But you don't want a sparse matrix. It would not be an efficient

Re: [julia-users] Re: Return type of eye()

that acts like an identity element. Use > Diagonal(ones(n)) if you want a diagonal identity matrix. I see no reason > at all why eye should be changed. > > On Monday, August 29, 2016 at 4:32:34 PM UTC+2, Chris Rackauckas wrote: >> >> But you don't want a sparse matrix.

Re: [julia-users] Re: Return type of eye()

But you don't want a sparse matrix. It would not be an efficient way to actually use it since sparse matrices have a bit of overhead due to their table structure. Even better would be a Diagonal since it's just an array with dispatches to act like a diagonal matrix. But best would be to use the

Re: [julia-users] Re: Return type of eye()

Isn't `I` better here? On Monday, August 29, 2016 at 6:49:41 AM UTC-7, Evan Fields wrote: > > > > On Monday, August 29, 2016 at 9:39:19 AM UTC-4, Júlio Hoffimann wrote: >> >> I'd like to understand the existence of eye() in Julia, it is still not >> clear to me. Is it because one wants type

[julia-users] Re: Can someone please update Winston?

t; can get a fairly different plot if you swap the backend. > > > On Saturday, 27 August 2016 02:19:45 UTC+2, Chris Rackauckas wrote: >> >> You should really check out Plots.jl. It's a plotting metapackage which >> lets you use the same plot commands to use any backend. I

[julia-users] Re: Can someone please update Winston?

private window with sizes under > control. Am I missing anything? > > Pkg.checkout("Winston") doesn't get me anything new. > > > On Saturday, August 27, 2016 at 8:19:45 AM UTC+8, Chris Rackauckas wrote: >> >> You should really check out Plots.jl. It's a pl

[julia-users] Re: @inbounds macro scope, and @simd

Check out Matt B.'s in-depth answer here: http://stackoverflow.com/questions/38901275/inbounds-propagation-rules-in-julia On Friday, August 26, 2016 at 10:43:08 AM UTC-7, Ben Ward wrote: > > Hi, Just wondering, I have the following doube loop: > > for site in 1:nsites > votes[1] =

[julia-users] Re: Function only causes segfaults inside package...?

On Saturday, August 20, 2016 at 9:57:28 AM UTC-7, Chris Rackauckas wrote: > > I was implementing a bunch of Runge-Kutta tableaus and ran into an issue. > Specific tableaus which are defined inside of a function inside of > DifferentialEquations.jl cause segfaults, but th

[julia-users] Re: Can someone please update Winston?

You should really check out Plots.jl. It's a plotting metapackage which lets you use the same plot commands to use any backend. It's nice because if you're using it an one package stops getting updated, you can switch to another plotting backend without changing your plot commands. But I can

[julia-users] Re: Time consuming problem

Hi, welcome to Julia. It would be easier to help you if you shared some code. Could you share a small example which highlights the problems you're having? Also, have you checked out the Performance Tips? One major thing new

Re: [julia-users] Differential Equations Package

rocess. > > On github, with issues, there is a documented and organized trail for > posterity that helps onboard new developers and such. > > -viral > > > > > On Aug 26, 2016, at 7:45 PM, Chris Rackauckas <rack...@gmail.com > > wrote: > > &

Re: [julia-users] Differential Equations Package

; > > On Aug 26, 2016, at 4:41 AM, Chris Rackauckas <rack...@gmail.com > > wrote: > > > > This has already been done. As of last night we have JuliaDiffEq where > we have moved Sundials and ODE. DifferentialEquations will follow soon, and > I am talking with t

Re: [julia-users] Differential Equations Package

This has already been done. As of last night we have JuliaDiffEq where we have moved Sundials and ODE. DifferentialEquations will follow soon, and I am talking with the owner of ODEInterface to see if that should go there as well (and if it should be expanded).

Re: [julia-users] Performant methods for enclosing parameters?

limbo because I don't know what to do about this! On Thursday, August 25, 2016 at 1:43:56 AM UTC-7, Yichao Yu wrote: > > > > On Thu, Aug 25, 2016 at 4:12 PM, Chris Rackauckas <rack...@gmail.com > > wrote: > >> It seems like a closure on a non bitstype still has iss

Re: [julia-users] Performant methods for enclosing parameters?

It seems like a closure on a non bitstype still has issues, or is there something wrong with doing this? immutable Params α::Float64 end function test() h = (t,u,du,p) -> @inbounds begin du[1] = 1.01u[1] du[2] = p.α*u[2] end h2 = (t,u,du) -> @inbounds begin du[1] = 1.01u[1]

[julia-users] Re: applying non zero boundary conditions in FEM

In Julia you use [] for dereference. So changes things to K[udofs,:]=0 . Comments are #. Semicolins aren't necessary in scripts. You might want to check out this page of the manual: http://docs.julialang.org/en/release-0.4/manual/noteworthy-differences/ On Tuesday, August 23, 2016 at 9:29:52

Re: [julia-users] Performant methods for enclosing parameters?

double %5 > } > > define double @"julia_#3_69886"(%"##3#6"*, double, double) #0 { > top: > %3 = getelementptr inbounds %"##3#6", %"##3#6"* %0, i64 0, i32 1 > %4 = load double, double* %3, align 8 > %5 = fmul double %4, %1 > r

Re: [julia-users] Performant methods for enclosing parameters?

e) #0 { > top: > %3 = getelementptr inbounds %"##30#34", %"##30#34"* %0, i64 0, i32 1 > %4 = load double, double* %3, align 8 > %5 = fmul double %4, %1 > ret double %5 > } > > > > > On Tuesday, August 23, 2016 at 6:00:37 PM UTC-4, Chris Rack

Re: [julia-users] Performant methods for enclosing parameters?

, alpha) > f1(x) = f(x, Val{alpha}) > ODE.solve(f, x0, x1) > end > ``` > > This will have a marginally faster evaluation of `f`, at the cost of > compiling a separate function for each value of `alpha`. > > Since these examples use closures, they will be much more efficient

[julia-users] Performant methods for enclosing parameters?

Note: This looks long, but really just has a lot of LLVM IR! I have been digging into the issue recently of the best way to enclose parameters with a function . This is an issue that comes up a lot with scientific codes,

[julia-users] Re: Questions regarding Julia for general purpose programming (strings, modules, dispatch, inheritance)

I don't necessarily have a large project, but there are a few tidbits I think I can share. I'm not familiar with all the things strings, so I'll let someone else take that. 2. You can always do composition instead of inheritance. For many it's a preferred coding practice anyways

[julia-users] Function only causes segfaults inside package...?

I was implementing a bunch of Runge-Kutta tableaus and ran into an issue. Specific tableaus which are defined inside of a function inside of DifferentialEquations.jl cause segfaults, but those exact same functions will not segfault when not inside the package. For example, the code (on

[julia-users] Re: Making a New Repl Mode

Another one to look at may be SJulia. On Saturday, August 13, 2016 at 11:24:18 PM UTC-7, Nathan Smith wrote: > > Hey all, > > I'm looking at making a new repl mode. I can't find much documentation on > this process. Does anyone have any resources or suggestions to get me > started before I dig

Re: [julia-users] Help please: how to expand dictionary into (local ?) variables with the same name as the keys and the corresponding values

Any issues with @materialize? It seems like it does exactly what you're asking for... On Sunday, August 14, 2016 at 3:13:37 AM UTC-7, Adrian Salceanu wrote: > > Variables contained in a module and then parsed Julia code included within > a function using include_string(). > > Any obvious

[julia-users] Re: Help please: how to expand dictionary into (local ?) variables with the same name as the keys and the corresponding values

There's a PR for this on Parameters.jl. See this: https://github.com/mauro3/Parameters.jl/pull/13 On Saturday, August 13, 2016 at 1:04:19 AM UTC-7, Adrian Salceanu wrote: > > Hi, > > This seems to be a recurring question per my googlings, but still I could > not find a satisfactory answer.

[julia-users] Re: Problems with A\b and BigFloat

e usually need a preconditioner to get any convergence with the > non-symmetric ones for interesting ranks. (I've been struggling for months > to find a good preconditioner for an application of GMRES in my work, so > this is a sore point.) > > On Wednesday, August 10, 2016 at

[julia-users] Re: Problems with A\b and BigFloat

Yes textbook answer is, why do you want to use `\`? Iterative techniques are likely better suited for the problem. There's no need to roll you own, the package IterativeSolvers.jl has a good number of techniques implemented which are well-suited for the problem since A is a large sparse matrix.

[julia-users] Re: Problems with A\b and BigFloat

Though I don't know if they have sparse algorithms. But they have a good base something there to help you get started making one... On Wednesday, August 10, 2016 at 2:20:54 PM UTC-7, Chris Rackauckas wrote: > > GenericSVD.jl <https://github.com/simonbyrne/GenericSVD.jl> has line

[julia-users] Re: Problems with A\b and BigFloat

GenericSVD.jl has linear solver routines which work for generic number types (like BigFloat). You can use an SVD to solve the linear system. It's not as fast as other methods, but you may find this useful. On Wednesday, August 10, 2016 at 12:47:10

Re: [julia-users] I cant view Plots in Juno - Atom IDE

> been too many questions like this > > On Monday, August 8, 2016, Chris Rackauckas <rack...@gmail.com > > wrote: > >> Use the command `gui()` >> >> On Sunday, August 7, 2016 at 9:32:29 PM UTC-7, Erick J Zagal wrote: >>> >>> I have this c

[julia-users] Re: I cant view Plots in Juno - Atom IDE

Use the command `gui()` On Sunday, August 7, 2016 at 9:32:29 PM UTC-7, Erick J Zagal wrote: > > I have this code: > > using Plots > > x = linspace(0, 10, 200) > y = sin(x) > plot(x, y, color=:blue, linewidth=2, label="sine") > > when run this in the console , show the plot , but trying in Juno

[julia-users] Re: Pkg update

If you put the command versioninfo() into Julia, it will spit out more information about your system. If you're still on v0.4.0, you may want to upgrade to at least v0.4.6. I don't think any packages test on v0.4.0 anymore, so there may be some changes that are incompatible with v0.4.0. But

[julia-users] Re: Error installing PyPlot in OSX

There have been big changes to PyPlot and PyCall that seem to have introduced these problems (at least, for me as well and for others on this forum). See the other thread about that. You may want to post this as an issue on the PyPlot Github to help them track down what the problem is. On

[julia-users] Re: Pkg update

Can you post versioninfo()? On Saturday, August 6, 2016 at 9:27:31 AM UTC-7, digxx wrote: > > julia> Pkg.update() > INFO: Updating METADATA... > INFO: Updating cache of Plots... > INFO: Updating cache of Nemo... > INFO: Updating cache of Measures... > INFO: Updating cache of Blosc... > INFO:

[julia-users] Re: One month later...

As I noted in the other thread, it's still shaky right now. Remember, v0.5-rc is for package developers to get all of the packages working together. There was a new tagged version of PyCall which seems to have caused issues with at least a few of its dependencies (like PyPlot and IJulia). This

[julia-users] Re: ANN: DifferentialEquations.jl

1 août 2016 16:37:09 UTC+2, Chris Rackauckas a écrit : >> >> I am pleased to announce the first release of DifferentialEquations.jl >> <https://github.com/ChrisRackauckas/DifferentialEquations.jl>. >> >> An accompanying blog post explains the motivation and phil

[julia-users] Re: ANN: DifferentialEquations.jl

y{Int64,1}) at > /home/pi/.julia/v0.5/DifferentialEquations/src/ode/ode_solve.jl:81 > > julia> plot(sol) > ERROR: UndefVarError: sol not defined > > > Le lundi 1 août 2016 16:37:09 UTC+2, Chris Rackauckas a écrit : >> >> I am pleased to announce the first rele

[julia-users] Re: ANN: DifferentialEquations.jl

iled to precompile DifferentialEquations to > /home/pi/.julia/lib/v0.4/DifferentialEquations.ji > while loading In[1], in expression starting on line 1 > > in error at ./error.jl:21 > in compilecache at loading.jl:400 > in require at ./loading.jl:266 > > > > > Le lundi 1 août 2016

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

How has this gone? I'd be interested in wrapping your wrapper in DifferentialEquations.jl On Friday, June 24, 2016 at 1:35:28 PM UTC-7, Dupont wrote: > > Thank you for your suggestion, I will take a look. > > Best regards >

[julia-users] Re: CALL TO ACTION for package devs

Not always. Some repos have a dev branch or a v0.5 compatibility branch, etc. I think that if you're looking to start working on the package, the first thing to do is get in contact with one of the authors (join the Gitter channel if they have one). On Thursday, August 4, 2016 at 4:50:55 PM

[julia-users] Re: IJulia Problems on v0.5

This happened on Atom for a little bit. Yes, I've seen it recently on IJulia. This issue is really just that it messed up printing error messages, so it will always post this instead of the real error messages. In all of my cases, this didn't interfere with working functions, though since

[julia-users] ANN: DifferentialEquations.jl

I am pleased to announce the first release of DifferentialEquations.jl . An accompanying blog post explains the motivation and philosophy of the package in more detail.

[julia-users] Re: [ANN] Nemo 0.5 released

Hey, I am really interested in trying Nemo since I want to use the ArbFloats and ArbReals in DifferentialEquations.jl for "faster BigFloats". However, I am getting the following error when trying to build Nemo: julia> Pkg.build("Nemo") INFO: Building Nemo WARNING: `@windows` is deprecated,

[julia-users] Issues with defining get: how exactly is arr[end] defined?

I thought arr[end] just called endof(arr), but that seems to not be the case. For example: type TestType data::AbstractArray end Base.length(t::TestType) = length(t.data) Base.size(t::TestType) = (length(t.data)) Base.endof(t::TestType) = t.data[2,:,:] Base.getindex(t::TestType,i::Int) =

[julia-users] Re: What packages, features, other strengths would you recommend when showing Julia to molecular neurobiologists?

It seems like most of what they do is biostatistics/bioinformatics. I would show them PyCall and RCall. Knowing that you easily have all of those libraries (and your previous libraries) is great. Also show them the JuliaStats stuff. In fact, ask them what they'd want to add to Julia if they

[julia-users] Re: GR subplots

One way to easily do this would be to use Plots.jl with GR as the backend. This way you get the API of Plots.jl and the speed of GR. This may not be the answer you were looking for, but I'd give it a try. Plots.jl is really well documented and has plenty of examples. On Saturday, July 23, 2016

[julia-users] Re: Which package downgrades other packages?

Another +1. When Optim.jl tagged v0.5, it took me too long find out it was responsible for rolling back a few of my packages, causing some tests to break (especially since I didn't have it master checked out for it, so I wasn't expecting it to really change! I only tracked it down because of

[julia-users] Re: Julia at the SIAM Annual Conference

Wait until next year. I can't present on Julia codes there until they're published (adviser's rules). I think in general that would apply a to a lot of people: started getting involved during v0.3, did a project in v0.4 which is now submitted, but won't be out there to present until next year.

[julia-users] Re: Help Julia win a performance comparison!

, but is a net speedup. I posted an Edit 3 explaining that. On Thursday, July 21, 2016 at 8:38:42 AM UTC-7, Chris Rackauckas wrote: > > I see it now. Sum the elements to resize the array, and then loop through > backwards adding the values (so that way you don't overwrite what > you

[julia-users] Re: I can't believe this spped-up !

I wouldn't expect that much of a change unless you have a whole lot of cores (even then, wouldn't expect this much of a change). Is this wrapped in a function when you're timing it? On Thursday, July 21, 2016 at 9:00:47 AM UTC-7, Ferran Mazzanti wrote: > > Hi, > > mostly showing my

[julia-users] Re: Help Julia win a performance comparison!

I see it now. Sum the elements to resize the array, and then loop through backwards adding the values (so that way you don't overwrite what you haven't used). On Thursday, July 21, 2016 at 8:34:11 AM UTC-7, Kristoffer Carlsson wrote: > > Sum the elements and resize the array to that length?

[julia-users] Re: Performance issues with stochastic simulation

You can change line 70 to be in place with a loop: for i in 1:length(x) x[i] = x[i] + deltax[i] end I don't think you can do x[:] =x .+deltax as fancy syntax here since the x is part of the statement though (you can check). This should cut out an allocation here and bring down the time.

[julia-users] Re: Help Julia win a performance comparison!

if this allocation can be dealt with better (the R code has both of these same issues, which is why we're virtually tied). On Thursday, July 21, 2016 at 5:49:23 AM UTC-7, Steven G. Johnson wrote: > > > > On Thursday, July 21, 2016 at 5:37:12 AM UTC-4, Chris Rackauckas wrote: >> >>

[julia-users] Re: Coveralls and coverage issues

updating? > > Best > Simon > > On Thursday, July 21, 2016 at 9:06:51 AM UTC+1, Chris Rackauckas wrote: >> >> Look at the files it's trying to cover... it's DataFrames.jl :) >> >> I sent you a pull request to fix your travis.yml to be for your package. >>

[julia-users] Re: Help Julia win a performance comparison!

till preallocate and grow as needed? > > On Thursday, 21 July 2016 02:48:58 UTC+1, Chris Rackauckas wrote: >> >> Most of the arrays are changing size each time though, since they >> represent a population which changes each timestep. >> >> On Wednesday, July 2

[julia-users] Re: Coveralls and coverage issues

Look at the files it's trying to cover... it's DataFrames.jl :) I sent you a pull request to fix your travis.yml to be for your package. On Thursday, July 21, 2016 at 12:16:35 AM UTC-7, Simon Frost wrote: > > Dear All, > > I'm trying to get code coverage working, but despite having some tests -

[julia-users] Re: Help Julia win a performance comparison!

Most of the arrays are changing size each time though, since they represent a population which changes each timestep. On Wednesday, July 20, 2016 at 6:47:39 PM UTC-7, Steven G. Johnson wrote: > > It looks like you are allocating lots of arrays in your doStep inner-loop > function, so I'm sure

[julia-users] Help Julia win a performance comparison!

Hey, there's a performance comparison on Code Review . I gave it a go and with help from @TotalVerb via Gitter, I got Julia really close to being

Re: [julia-users] Re: Linear-Equation-System Solver("\") does not work reliably for the "Rational" Type

I wonder if there could be a \! operator for A_ldiv_B!(A,b). On Tuesday, July 19, 2016 at 8:19:58 AM UTC-7, Andreas Noack wrote: > > The UpperTriangular and LinAlg.UnitLowerTriangular parts are not > necessary. Julia will detect that but since we already know that they are > triangular we can

[julia-users] Re: Calling all users of ParallelAccelerator.

Thank you for this work! I am particularly interested in working with it for the Xeon Phi. I haven't actually gotten to do extensive tests of the work from https://github.com/IntelLabs/CompilerTools.jl/issues/1 yet. Will be doing this over the summer. I am trying to incorporate it into

[julia-users] Re: Array of types, how to?

> > D() = new(Array{Float64,2}(),string()) > > (or anything like that). Since your Type is not mutable, you can just > overwrite what you put in there. > I meant because it's not immutable. If it was immutable, this won't exactly work because you won't be able to replace the string (though you

[julia-users] Re: Array of types, how to?

> sábado, 16 de Julho de 2016 às 02:28:30 UTC+1, Chris Rackauckas escreveu: >> >> Well, you just made the type D, so you can make Array{D,n} or anything >> else like that. The Base types are not special in Julia, anywhere you can >> use a type, you can use your own. &g

[julia-users] Re: Linear-Equation-System Solver("\") does not work reliably for the "Rational" Type

You're not going to get good runtimes with this if you're using Rationals. Each time a command is done, it needs to reduce the fraction. If you're working with small examples like you show here, then yes this can be worthwhile. However, even with good programming I don't think would scale to

Re: [julia-users] New Package Looking for Contributors: VectorizedRoutines.jl

t; On Fri, 2016-07-15 at 01:34, Chris Rackauckas <rack...@gmail.com > > wrote: > > Hey, > > After some discussion (and letting the idea hang around for a long > time) > > I decided to create VectorizedRoutines.jl. The idea behind this package > is > >

[julia-users] New Package Looking for Contributors: VectorizedRoutines.jl

Hey, After some discussion (and letting the idea hang around for a long time) I decided to create VectorizedRoutines.jl. The idea behind this package is to include the useful and familiar vectorized routines that one knows and loves from MATLAB/R/Python. An example of such functions include

[julia-users] Package Structure for Conditional Dependencies

Hey, I wanted to look more into using conditional dependencies, and am looking for insight from both developers who have done this successfully and feedback from users on what is more intuitive. Just so we're all on the same page, a conditional dependency is a package which your package

[julia-users] Re: A Very Simple Benchmark for Brutal-force Loops in Several Languages: revised, Julia is fast!

Also: it's "brute force", not "brutal-force". The connotation is quite different :). On Monday, July 11, 2016 at 9:21:34 AM UTC-7, Zhong Pan wrote: > > Thanks to all the helpful comments. Just for the sake of tidiness, I > attached rev 3 of the (now even simpler) benchmark result PDF. > >

[julia-users] Re: A Very Simple Benchmark for Brutal-force Loops in Several Languages: revised, Julia is fast!

You should add @inbounds and try adding @fastmath to the Julia code. Maybe @simd, though the compiler should be doing that automatically. Make sure Julia is compiling with -O3. I wouldn't be surprised if this gets nearly to C++. If you want to put the random number generation back in, you can

[julia-users] Re: Software Carpentry - Julia Lesson

I think we should really think about this again soon. Julia should get a good core of teaching materials and workshops together. On Friday, September 11, 2015 at 9:53:55 AM UTC-7, Chase Coleman wrote: > > This is more of just a suggestion/placeholder that a Julia lesson gets > written for

[julia-users] Re: Symbolic differentiation similar to TensorFlow / Theano

Have you checked out using the wrappers for TensorFlow, https://github.com/benmoran/TensorFlow.jl ? Or directly using PyCall? On Friday, July 8, 2016 at 5:02:55 PM UTC-7, Andrei Zh wrote: > > In Python, libraries like TensorFlow or Theano provide possibility to > perform automatic

Re: [julia-users] Recompile package cloned from github?

Yeah, you need to restart Julia to recompile. If you're in Juno, just co Ctrl+j then Ctrl+k, and then run your script (you can also use Ctrl+j then Ctrl+c to clear the console). I find this easier than restarting the REPL. On Friday, July 8, 2016 at 4:23:44 PM UTC-7, Yichao Yu wrote: > > On

Re: [julia-users] When Julia v1.0 will be released?

This information is hugely beneficial in science/mathematics, especially for a PhD. It means that if you start a project in Julia now, although there will be some bumps for when versions change, the project will likely end after v1.0 is released (say 2 years?) and so your code should be stable

[julia-users] Re: When Julia v1.0 will be released?

This probably will help. On Thursday, July 7, 2016 at 7:07:12 AM UTC-7, Hisham Assi wrote: > > I really like Julia (I am using it for my publications & thesis), but I > noticed that the versions are not really backward compatible. I am

[julia-users] Re: Julia community stewards

I think in general we need some active mods for IRC/Gitter. Some people with the ability to edit something to get rid of accidental mentions (sorry @parallel) and ban spammers. It's not too bad, and most issues are dealt with people being reasonable, but I can see future moderation needed.

Re: [julia-users] Re: A naive benchmark

BLAS will be faster for (non-trivial sized) matrix multiplications, but it doesn't apply to component-wise operations (.*, ./). For component-wise operations, devectorization here shouldn't give much of a speedup. The main speedup will actually come from things like loop fusing which gets rid

Re: [julia-users] ODE.jl - backwards (negative in time) integration

? On Monday, June 27, 2016 at 6:15:45 AM UTC+1, Chris Rackauckas wrote: > > Won't some of the Runge-Kutta solvers be really unstable with a small > negative Delta t? What happens when you use a fixed time step method: does > it run and diverge? >

Re: [julia-users] ODE.jl - backwards (negative in time) integration

Won't some of the Runge-Kutta solvers be really unstable with a small negative Delta t? What happens when you use a fixed time step method: does it run and diverge? On Friday, June 24, 2016 at 8:50:42 PM UTC+1, Mauro wrote: > > This is a bug, could you file an issue? Thanks! Note that some

[julia-users] Re: Applied NLA course in Julia

@Crivelli You can a packaged form of these types of algorithms (like Jacobi iteration) at IterativeSolvers.jl Thanks for these teaching materials in Julia. They look great! On Tuesday, June 21, 2016 at 1:46:58 PM UTC+1, Dawid Crivelli wrote: > > Thanks for the notes, they look interesting. > >

<    1   2   3   >