Timeline for Making calculation of correlation dimension faster
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 28, 2017 at 0:53 | vote | accept | Mark Foster | ||
| Dec 28, 2017 at 0:55 | |||||
| Dec 27, 2017 at 0:18 | history | tweeted | twitter.com/StackMma/status/945811035256127488 | ||
| Dec 26, 2017 at 20:39 | comment | added | corey979 | Related: (125543) | |
| Dec 26, 2017 at 15:03 | comment | added | b3m2a1 | I believe your issue of having slower compiled code comes from the fact that Nearest isn’t compilable. | |
| Dec 26, 2017 at 4:34 | answer | added | kglr | timeline score: 6 | |
| Dec 26, 2017 at 4:06 | comment | added | Michael E2 | Welcome to Mathematica.SE! I suggest the following: 1) As you receive help, try to give it too, by answering questions in your area of expertise. 2) Take the tour! 3) When you see good questions and answers, vote them up by clicking the gray triangles, because the credibility of the system is based on the reputation gained by users sharing their knowledge. Also, please remember to accept the answer, if any, that solves your problem, by clicking the checkmark sign! | |
| Dec 26, 2017 at 3:00 | answer | added | Anton Antonov | timeline score: 10 | |
| Dec 26, 2017 at 0:36 | comment | added | Anton Antonov |
Which definition of "correlation dimension" do you use? The one I found seems to be different than what you programmed. The correlation integral in that article, $C(N,r)$, can be computed with matrix arithmetic. (Much faster than using Nearest.)
|
|
| Dec 26, 2017 at 0:23 | history | edited | m_goldberg | CC BY-SA 3.0 |
Routine clean-up
|
| Dec 26, 2017 at 0:00 | review | First posts | |||
| Dec 26, 2017 at 4:06 | |||||
| Dec 25, 2017 at 23:59 | history | asked | Mark Foster | CC BY-SA 3.0 |
