Advanced Search
All Posts : Product Suggestions
I was recently asked what I thought of using Approximate Entropy in financial trading. I was not much familiar with ApEn; so I experimented a little. A natural thing to do is consider long bit strings that are suspected of being able to (but not known to) pass general tests for randomness. Examples include leading bits of Pi, sqrt(2), etc. So I began with the following. PiFive:=evalf[350000](Pi): bits:=convert(PiFive,binary,1000000): (Such things are helpful in various applications, not just studying ApEn.) Maple takes days to compute the answer. Why? I had a look at the code. It turns out that the code can be improved; so I wrote a new version. The new version computes the above in minutes. The code is plug-compatible, and is, here, offered to Maplesoft: View 4119_convert-binary.mw on MapleNet or Download 4119_convert-binary.mw
View file details
convert

Please Wait...