2,099 reputation
714
bio website lauschkeconsulting.net
location Morris Plains, NJ
age
visits member for 2 years, 3 months
seen Oct 19 at 23:43

Mathematica and Scala afficionado. Mooney lover. Steak lover. Linux lover (Fedora). German citizen. Politically: anti-bullshit. Financially: pro-bullshit. Apple hater. Pear lover. Hobby jurist.

Visit my Scala for Java Developers Class on udemy.com: http://www.udemy.com/scala-for-java-developers-transition-up


Oct
4
reviewed Approve suggested edit on Expand a rational function in a one degree partial fraction, but not include a two degree expression?
Sep
29
reviewed Approve suggested edit on ParametricNDSolve KKT Constraint Directly
Sep
28
revised Faster Integer Approximation of pi
added 185 characters in body
Sep
28
answered Faster Integer Approximation of pi
Sep
28
comment Faster Integer Approximation of pi
The best rational approximations to a real number are the continued fractions, a classic result. In fact, you can only get a better approximation than the convergent if you increase the denominator. There are numerous simple proofs/theorems about this, the earliest, to my knowledge, from Lagrange (unless you count Euclid in 300 BC, because the Euclidean algorithm gives you the c. f. approximation). So the comment from ybeltukov above and the answer from ubpqdn below are dead-on (as Rationalize gives you the c. f. approximation).
Sep
24
awarded  Autobiographer
Sep
16
comment Kernel crashes when plotting $z=\sqrt{(x^2 + y^2)^0}$
completely agreed with previous commenters that "don't do that" is the wrong response. The kernel should NEVER crash, and for that it doesn't matter how the crash was produced. The crash itself is the problem. The existence of a work-around is never sufficient to accept a kernel crash. It's like saying "if a certain plane type repeatedly crashes, don't use the plane, drive by car". We can't acquit the faulty system just because we can adapt our behavior (how we cope with the problem). It's still a problem.
Sep
4
reviewed Approve suggested edit on What is the best distribution for my histogram?
Aug
24
reviewed Approve suggested edit on How do I set up conditions at infinity?
Aug
13
comment Is this 30% slowdown in Mathematica 10 due to DownValues lookup time?
There will be a 10.0.1 not too long in the future, there's just too much problematic in M10. From what I hear through the grapevine, there should be a 10.0.1 not too far in the future. M10 has many performance problems of various types, and the cloud technology still has several shortcomings, and they know it.
Aug
7
awarded  Custodian
Aug
7
reviewed Approve suggested edit on Substituting values in 3j symbols
Jul
31
comment BitShiftRight produces incorrect results in Version 10
part 2: If you were to use it recursively, parallel or not, you would only get 52 bits on each precision level. The two things could be related if M is using integers in the same schema as rationals with no modular remainder; it wouldn't be hard to screw up the bit arithmetic if everything was being stored in an array of IEEE 64 bit floating point numbers using Intel's vector system. When you apply Developer`PackedArrayQ[v2] to the example you get True.
Jul
31
comment BitShiftRight produces incorrect results in Version 10
part 1: Here's a guess/suspicion I venture to suggest as a comment, which could be the cause. Try: max = $MaxNumber. After trying to contemplate that magnitude for a moment: max = Log[2, max] is Log[2, max]. So to me it looks as if WRI may have implemented a precision scheme, using the IEEE 64 bit floating point algorithm recursively by using the parallel framework.IEEE 64 bit gets 53 bit precision by always using the same first bit.
Jul
25
comment Using J/Link with Wolfram Programming Cloud
initial testing revealed that OnlineM lets you load JLink with Needs["JLink`"], but then upon ReinstallJava[] the kernel quits. I've also seen that it uses Java 7 update 13, which is quite depressing, given that the current Java is Java 8 update 11 since Jul 15. I'd assume that CloudM uses the same as OnlineM, but haven't been able to test yet.
Jul
21
comment Mathematica policy for correctness of results
a) What you describe is not warranty, it would be liability. b) WRI DOES actually provide warranty, if you read the terms. If the disk is broken, they'll send you a new one, and that is the maximum remedy. c) Liability in software is generally not offered, and if it's contractually agreed, then it's based on a custom contract, and not for standard software. But such contracts are rarely done, and the terms will usually specify things like free from liability, hold harmless, and indemnify. d) you really don't seem familiar with the regular business practices in the software industry.
Jun
28
awarded  Yearling
Mar
11
comment Elliptic curve cryptography in Mathematica
@Tyler: yes, I know Python is popular for crypto work. But you can't easily integrate it with M (at least to my knowledge), whereas with JLink it's right at your fingertips to leverage over from M to the JVM, and you mentioned "practical" in a comment.
Mar
11
comment Elliptic curve cryptography in Mathematica
As you want something practical, consider not writing it yourself, and instead using JLink to use EC algorithms from Java 7's JCA/JCE API: docs.oracle.com/javase/7/docs/technotes/guides/security/…
Jan
21
comment GUI Maker? Is there a perhaps drag and drop GUI maker for Mma?
Yes, create your own, using Java Swing, JavaFX, or WinForms, and then use JLink or NETLink. There are plenty of professional GUI builders out there. Note that JavaFX is the official replacement of Swing, so unless you have a deep background in Swing and have to learn one from scratch, learn JavaFX and ditch Swing.