I removed CoinOptServices and WinRPM and was then able to add
CoinOptServices
Handle or Dll substring "liblapack" returned 0 matching items
Process Explorer does not indicate that lapack is being run when the
problem occurs.
I do have mingw installed elsewhere on my computer.
On Tuesday, October 25, 2016 at 9:01:29 AM UTC-4, Frank Kampas wrote:
>
> Is anybody working on fixing CoinOptServices?
>
the problem occurs when nothing else is open.
I see on the GitHub page for CoinOptServices that the build is failing for
Windows and Linux.
When I run Pkg.build("CoinOptServices") using Julia 5.0 and Windows 10, I
get load errors and a build error message.
On Tuesday, October 25, 2016 at 9:01:29 AM UTC-4, Frank Kampas wrote:
>
> Is anybody working on fixing CoinOptServices?
>
Is anybody working on fixing CoinOptServices?
I had assumed the function would be recompiled only if it had been changed,
but that is not correct. This has been very useful, thanks to everybody to
replied.
On Thursday, September 17, 2015 at 10:39:13 PM UTC-4, Duane Wilson wrote:
>
>
>
> On Thursday, September 17, 2015 at 5:25:40 PM UTC-3,
On julialang.org, it is stated that Julia is about 170 times faster than
Mathematica for the the test "fib". I get about a factor 2.
Julia:
fib(n) = n < 2 ? n : fib(n-1) + fib(n-2)
println(@time(fib(20)))
elapsed time: 0.001868071 seconds (33280 bytes allocated)
6765
Mathematica:
In[1]:=
Also note that the @time macro is doing the printing, so you don't need
> the parentheses or the println() call for this.
>
> On Thu, Sep 17, 2015 at 12:53 PM, Frank Kampas <fka...@gmail.com
> > wrote:
>
>> On julialang.org, it is stated that Julia is about 170 times fast
ll nonzero
> triplets (i,j,value), y[j] += x[i] * value.
>
> On Tuesday, September 15, 2015 at 8:52:46 AM UTC-7, Frank Kampas wrote:
>>
>> Could you post a link to the part of the documentation that describes how
>> to do that?
>>
>> On Tuesday, Septembe
Could you post a link to the part of the documentation that describes how
to do that?
On Tuesday, September 15, 2015 at 3:53:11 AM UTC-4, Tony Kelman wrote:
>
> Instead of constructing a sparse matrix in the inner loop it would be more
> efficient to write an in place stencil kernel function to
he messy transformations.
>
>
> On Saturday, September 12, 2015 at 3:15:34 PM UTC-7, Frank Kampas wrote:
>>
>>
>>
>> On Saturday, September 12, 2015 at 12:09:11 PM UTC-4, Frank Kampas wrote:
>>>
>>> Is it possible to create sparse matrices w
With 4th rank sparse matrices, I could define them outside the loop.
On Saturday, September 12, 2015 at 12:09:11 PM UTC-4, Frank Kampas wrote:
>
> Is it possible to create sparse matrices with a rank other than 2?
>
On Saturday, September 12, 2015 at 12:09:11 PM UTC-4, Frank Kampas wrote:
>
> Is it possible to create sparse matrices with a rank other than 2?
>
I've been using 4th rank sparse matrices in Mathematica for circle packing.
The constraints
can be expressed using 2nd rank
Is it possible to create sparse matrices with a rank other than 2?
The optimization video is private
On Thursday, August 13, 2015 at 1:22:09 PM UTC-4, Viral Shah wrote:
Folks,
I am happy to announce that the videos are almost all ready, and I will
start posting them in batches. I am starting with Jeff’s talk on our
Youtube channel:
I've used LibraryLink to call Ipopt from Mathematica but haven't succeeded
in calling
Julia from C under Windows, which would be required to use LibraryLink.
On Thursday, April 2, 2015 at 9:25:04 AM UTC-4, Frank Kampas wrote:
Has anyone been able to call Julia from Mathematica?
Has anyone been able to call Julia from Mathematica?
factorial(BigInt(21)) works
On Monday, January 12, 2015 at 10:10:06 PM UTC-5, Carlos Baptista wrote:
I understand that factorial(21) is quite a large number and therefore an
OverflowError is perfectly understandable. However, with Octave I can go up
to factorial(170) (if I go higher I
Microsoft C code is not very fast these days. You might want to compare
with MinGW.
On Monday, January 5, 2015 9:56:07 AM UTC-5, lapeyre@gmail.com wrote:
Hi, here is a comparison of Julia and C++ for simulating a random walk
https://github.com/jlapeyre/ranwalk-Julia-vs-Cxx.
It is the
20 matches
Mail list logo
