6,740 reputation
1044
bio website
location Netherlands
age
visits member for 2 years, 3 months
seen 10 hours ago

I guess I like meta programming


Jan
21
comment Performance on Binomial Deviate is slow
@JEP thanks for the accept. I see the late accept as a good sign, too many Q&As are simply forgotten about.
Jan
14
comment Bug in complicated Limit
Posting here as in addition reporting the bug to support is also a very nice option in my opinion.
Jan
6
comment A problem about CompilationTarget -> “C”
See also C compilation not working with Visual Studio 2013
Jan
6
revised A problem about CompilationTarget -> “C”
Links and input - output consistency
Dec
31
awarded  Good Question
Dec
30
comment How to prevent simplification?
... or check out Inactivate
Dec
26
revised How to rebuild original data from a histogram?
Typo from a comment
Dec
26
revised Find continuous sequences inside a list
C code highlighting
Dec
21
revised Why some built-in functions are slow
Redeeming Total
Dec
21
comment Buying a new computer (specifically for Mathematica)
Here's my 2 cents about closing as duplicate. Note that the OP says: "I use Mathematica almost exclusively for complicated graphics-intensive calculations, ...", which is quite specific. On the other hand, he/she is asking for basic hardware considerations in general, which I suppose could be covered in the other Q&A. It would make sense to only focus on graphics intensive calculations here, but I guess there is too much momentum already towards general benchmarks. I am voting to close.
Dec
20
comment Why some built-in functions are slow
I do not know about the actual implementation of Union of course. Here Leonid says DeleteDuplicates can be $O(n)$ and that Union can use a $O(n\,log(n))$ algorithm. All my statements so far have been about worst case, though I like your distinction between the average and worst case. If we let kk depend on $n$ in such comparisons and then Union may (I think) have better asymptotic behaviour than DeleteDuplicates. If you feel the answer can be made better feel free to edit it, I cannot do so right now.
Dec
20
comment Why some built-in functions are slow
@OleksandrR. thank you for your comment. I am not entirely sure what you mean with your first sentence. The lists here have the same size, which is mm. I suppose it could be nice to add the observation that Union does not get much slower, whereas DeleteDuplicates does, when have fewer duplicates. I think a comparison in terms of big O notation is also useful. I think delete duplicates indeed takes $O(n)$ time. For fixed kk a $O(n\, log(n))$ algorithm for Union exists, as an algorithm would be to first delete duplicates and then sort, an with abuse $O(n)+O(n\,log(n)) = O(n\,log(n)) $
Dec
18
awarded  Enlightened
Dec
18
awarded  Nice Answer
Dec
15
comment Different results with Plot option “Evaluated” in V9 and V10
Evaluate does work: Plot[Evaluate@Table[BesselJ[n, x], {n, 2}], {x, 0, 10}, PlotLegends -> {"n=1", "n=2"}], which is also a workaround.
Dec
2
revised Symbolic integration error
Tag
Dec
2
comment How is pattern specificity decided?
Stuart and @ScottMorrison, perhaps it is better to continue the discussion in chat? Discussion in the form of answers is theoretically ok, but only if a good effort is made to clean everything up afterwards, which does not happen enough in practise.
Dec
2
revised How to define a global variable when giving each notebook its own Context?
Restricted title scope
Dec
2
comment How to define a global variable when giving each notebook its own Context?
Hello and welcome to mma.se! Please note that the question is a bit more specific than the title suggests. The question would probably be too broad otherwise. The information you share is good to know, but I guess it is not really an answer here.
Nov
28
awarded  Popular Question