Haven't looked yet. Is there an example that works with @manipulate?
On Sat, Feb 27, 2016 at 5:05 AM, Sisyphuss wrote:
> It's just fantastic! I wonder if it will be the Matplotlib of Julia
>
>
> On Friday, February 26, 2016 at 11:11:02 PM UTC+1, Simon Danisch wrote:
>>
>> Hi
>>
>> this is the f
My children have been watching me "play" with julia for years now.
They are now 12 and 14. No question that "manipulate" is the way to start.
(and by the way that's true for adults too)
You can use "manipulate" with anything, just a matter of imagination, I'd
think.
On Thursday, May 7, 2015 a
If all you wanted was one derivative, i'd consider just an arccos and sines
formula
i gathered it was multiple derivatives desired
On Mon, Apr 6, 2015 at 8:04 AM, Paulo Jabardo wrote:
> There is a recurrence relation for the derivatives but it involves the
> Chebyshev polynomials of second k
there could be so many ways to do this
that it might be worth asking about the "use case"
the derivatives, of course, satisfy the same three term recurrence
but with different initial conditions
so it might be worth knowing if
0. whether this is worth optimizing a great deal or just a little b
fun and/or digits (wherever your fun lies!)
buffon needle could be one
On Mon, Mar 9, 2015 at 9:02 AM, Steven G. Johnson
wrote:
> If we're doing a 31 ways to to compute pi, I would suggest that most of
> them should be more aimed at fun than trying to compute a huge number of
> digits. Like
Is this the one that can be parcelled out to all of us so we can
distribute the work?
I realize later digits take longer, so early folks can get more digits
and later digit folks might only do fewer digits
On Sun, Mar 8, 2015 at 11:43 AM, Hans W Borchers
wrote:
> I can provide an implementati
314 ways?
On Sun, Mar 8, 2015 at 10:10 AM, Simon Byrne wrote:
> How about an ijulia notebook of 101 ways to compute pi in Julia, ideally
> with accompanying graphics?
>
>
> On Sunday, 8 March 2015 13:16:26 UTC, Johan Sigfrids wrote:
>>
>> Because calling out to mpfr is cheating here is a implem
with the last two digits being roundoff error
On Sat, Mar 7, 2015 at 1:55 PM, Ivar Nesje wrote:
> *julia> **big(pi)*
>
> *3.141592653589793238462643383279502884197169399375105820974944592307816406286198e+00
> with 256 bits of precision*
>
> lørdag 7. mars 2015 18.59.47 UTC
With about a week left, I'd love to find out how many digits of π we can
get only from Julia.
Perhaps we can coordinate a worldwide distributed computation this week.
I usually type, for example,
[1 2 3]'
On Wednesday, March 4, 2015 at 5:54:27 AM UTC-5, Tamas Papp wrote:
>
> Surely I am missing something, but how would this relate to
> concatenation?
>
> Even if the concatenation syntax can be applied with some hack (eg
> [1:3;]'' in current v0.4), I th
Who would have thought what a long story this would be?:
https://github.com/JuliaLang/julia/issues/4774
Turns out the linear algebra world and the multilinear algebra world don't
play nicely together, and the dictates of performance can really splist
the needs of the human and the computer.
some
I would have gone
A = zeros(Int64,5)
Alan
On Monday, November 24, 2014 3:28:50 AM UTC-5, Ronald L. Rivest wrote:
>
> I am just learning Julia...
>
> I was quite shocked today to learn that Julia does *not*
> initialize allocated storage (e.g. to 0 or some default value).
> E.g. the code
>
realm and imagem might be the wrong name
as realm should be a matrix with the same eigenvectors
of A but the real part of the eigenvalues etc
On Friday, November 14, 2014 2:10:43 PM UTC-5, Andreas Noack wrote:
>
> Relative to the construction of a Symmetric matrix (which is almost a
> noop) i
Related topic:
I'd like to propose that roots and polyval be part of base.
I can promise firsthand that they are among the first things a 12 year old
user
of Julia would just want to be there.
On Tuesday, June 17, 2014 11:30:04 AM UTC-4, Stefan Karpinski wrote:
>
> On Tue, Jun 17, 2014 at 1
Would be good to sort out the implications, but I'm hoping that atomic
measures
are not as problematic as JMW fears.
On Tuesday, September 16, 2014 8:14:58 AM UTC-4, Simon Byrne wrote:
>
> As this situation arises in other cases, I've opened an issue here:
> https://github.com/JuliaStats/Distri
>
>
Mike LaCroix put together a nice latex package that produces In's and Out's
nicely and beautifully but this is unfinished with too much
manual labor required. Just throwing it out there
figuring someone will improve on it.
Perhaps one should also consider minted -- https://code.google.com/p/
If you read dot as "point"
Then pointwise ops make a kind of sense
I just tried roots in the Polynomial package
here's what happened
@time roots(Poly([randn(100)]));
LAPACKException(99)
while loading In[10], in expression starting on line 44
in geevx! at linalg/lapack.jl:1225
in eigfact! at linalg/factorization.jl:531
in eigfact at linalg/factorization.jl:55
This is great to hear! More to do ..
On Monday, May 26, 2014 7:36:30 PM UTC-4, Jason Riedy wrote:
>
> First, the caveats:
>
>- on large matrices,
> - with few threads, and
> - punching a hole directly to the BLAS library.
>
> Sivan Toledo's recursive LU factorization (
> http
It splices the arguments
Turns out to be really handy
On Wednesday, April 2, 2014 10:41:45 AM UTC-4, Paweł Biernat wrote:
>
> W dniu środa, 2 kwietnia 2014 15:30:58 UTC+2 użytkownik Andreas Noack
> Jensen napisał:
>>
>> Maybe this is what you want
>>
>> [y[:,1:2] hcat([y[:,j] for j=2:3]...)]
>>
>
8490.0248676 -0.345193
-0.223607 -0.1738490.0248676 -0.345193
-0.223607 -0.1738490.0248676 -0.345193
-0.223607 -0.1738490.0248676 -0.345193
-0.223607 -0.1738490.0248676 -0.345193
On Thursday, April 3, 2014 9:23:14 AM UTC-4, Alan Edelman wrote:
>
> I would us
I would use the svd with a threshold based on the norm
and optionally adjustable
on wrote:
>
>
> On Wednesday, March 5, 2014 8:00:32 AM UTC-5, Alan Edelman wrote:
>
>> >> (It's a perfectly good norm to treat an MxN matrix as a length MN
>> vector and apply one of the vector norms to it.)
>> I sort of disagree with that culturally. I don&#
deal , but I like normfro
On Wed, Mar 5, 2014 at 8:31 AM, Toivo Henningsson wrote:
> On Wednesday, 5 March 2014 14:00:32 UTC+1, Alan Edelman wrote:
>>
>> I'd like normfro to stay
>>
>> >> (It's a perfectly good norm to treat an MxN matrix as a length
I'd like normfro to stay
>> (It's a perfectly good norm to treat an MxN matrix as a length MN vector
and apply one of the vector norms to it.)
I sort of disagree with that culturally. I don't think one should be able
to type vecnorm of a matrix
rather one should do norm(A[:])
in any event, I r
That's very cool Andreas! Nothing like already having our own GE in
addition to LAPACK's.
On Thursday, February 20, 2014 5:45:28 PM UTC-5, andrew cooke wrote:
>
>
> A broad and a narrow question...
>
> If Julia supports the definition of new integer types can I define a new
> type for a finite
It would take no effort to write a GE for GF2 and even a GE that
is mathematically correct for all fields, stability aside.
A few thoughts to mull over:
1) for GF2 one would pivot on non-zero
as there is no stability issue. For reals, we pivot to largest to avoid
round-off.
2) For GF2,
*sqrt(2/2
return exp(-r*T)*Cmean* γ
end
On Wednesday, February 19, 2014 10:11:02 AM UTC-5, Alan Edelman wrote:
>
> Just tried this quickly and it ran in half the time on my machine:
>
> function callprice2(S0, K, r, T, σ, paths)
> Csum = 0.0
>
>
Just tried this quickly and it ran in half the time on my machine:
function callprice2(S0, K, r, T, σ, paths)
Csum = 0.0
β= T.^0.5*σ
γ= S0*exp(T*(r-σ^2/2))
for j = 1:paths
Zj = β*randn()
STj = exp(Zj)* γ
Csum += max(S
sometimes it's called implicit QR
On Fri, Jan 3, 2014 at 1:34 PM, Andreas Noack Jensen <
andreasnoackjen...@gmail.com> wrote:
> I got the point after reading the double shift QR section of
>
> http://people.inf.ethz.ch/arbenz/ewp/lnotes.html
>
>
> 2014/1/3 Jiahao Chen
>
>> Have you tried Golub
You say Householder, but I would say you could be "chasing the
subdiagonal" with Givens Rotations
You are using a full array but you only need three diagonals of R, and if
you save Q as n-1 angles you don't even need a dense Q
This begs the question of why you are doing QR on a symmetric tridia
31 matches
Mail list logo
