| bio | website | tpfto.wordpress.com |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 4 months |
| seen | 50 secs ago | |
| stats | profile views | 3,225 |
Avatar made with Mathematica 8:

Blocky depiction of Hilbert curve, styled with Perlin noise.
E-mail (flipped ROT13): zqd˙ʎʌuzʇ@ʇɐʌǝɥʇʌssqɹǝɥɟuɹʎɔ
Any code I've posted here I place under the WTFPL.
|
2d |
revised |
How do I compute sidereal time and JD? deleted 238 characters in body |
|
2d |
revised |
Nontrivial solutions of equation deleted 21 characters in body |
|
2d |
comment |
Nontrivial solutions of equation Then you might be interested in ToRadicals, or the Cubics/Quartics option of the Eigen*[] functions. You might also want to look into NullSpace[]. |
|
2d |
revised |
Scaling of ChartElements deleted 12 characters in body |
|
2d |
revised |
Scaling of ChartElements edited tags |
|
2d |
revised |
Beginner's question: Gap between FrameLabel and BarChart edited tags |
|
2d |
comment |
Different behaviours of Default Argument A look at the output of TracePrint[{f[a], f[a + b]} /. f[x_ + y_.] -> p[x, y]] shows that there is some reordering done; that is, x_ + y_. is automagically reordered as y_. + x_, since Plus[] is orderless, and I'm guessing Optional[] comes before Pattern[] in canonical order. |
|
2d |
comment |
How to assign values to a function at discrete points? For your particular case: Scan[(f[#[[1]]] = #[[2]]) &, Transpose[{x, y}]] |
|
2d |
comment |
Smooth Kernel Distribution As an addition to Andy's notes, you can use "Properties" to list all the possible properties of a DataDistribution[] object. |
|
2d |
revised |
Why do these two different zetas produce the same value? added 247 characters in body |
|
May 19 |
comment |
Smooth Kernel Distribution The documentation gives their particular version of the Silverman rule within the documentation for KernelMixtureDistribution[]. |
|
May 19 |
awarded | Nice Answer |
|
May 18 |
comment |
How to get a solution set of a nonlinear system of equations? Well, he can just copy the code and turn it loose on his equations... ;) |
|
May 18 |
comment |
How to get a solution set of a nonlinear system of equations? ...and FindAllCrossings2D[] is effectively a mechanical implementation of your approach. |
|
May 18 |
comment |
The Orbit and Perigee of the Flamsteed comet (As it turns out, Laskar's formula is built-in, but undocumented: PlanetaryAstronomy`Private`ObliquityLaskar[].) |
|
May 18 |
comment |
Recursion depth exceeded @Gasper, if you're going to gamble with that setting, you'll want to do it in the definition of sol[]; that is, sol[n_Integer] := Block[{$RecursionLimit = Infinity}, (* stuff *)] |
|
May 18 |
comment |
Resampling when using image as Texture @Frank, it is indeed a bit unfortunate that one cannot tweak the interpolation used internally by Texture[]. Maybe in a future version... |
|
May 18 |
comment |
Recursion depth exceeded @Leonid, I had forgotten about tail-call optimization. You are most certainly right. ;) Now, I wonder if OP's function can be reimplemented in that manner... then again, if memory serves, there's a nonrecursive implementation of Crank-Nicolson; I wonder why this isn't the route taken. |
|
May 18 |
comment |
Recursion depth exceeded @Leonid, of course, I usually do that as Block[{$RecursionLimit = Infinity}, (* stuff *)] instead of setting it globally. I did say that OP has to be careful; in particular, he should be sure that the recursion he has is guaranteed to terminate, but usually people are unable or unwilling to do such proofs. |
|
May 18 |
comment |
Recursion depth exceeded Then set $RecursionLimit to a bigger value, or even Infinity. You will have to be careful if you do $RecursionLimit = Infinity, though. |