FFRANK has asked for the wisdom of the Perl Monks concerning the following question:
Dear Monks,
For indexing the best values out of a fractal structure built by adding iteratively +1 to the diagonal 4 of a 4X4 square.
Output indices for $level = $max, $level = $max-1, $level = $max -2 untill some condition has been met. In my environment, this condition will be met at level 0, or 1 or 2 in most cases, so checking the indice for low levels without building too much may be faster.
When it gets to depth 8 and more, it is very long to run (hours).
I have a good feeling for nested loops, I was also thinking about PDL, which is supposed to be better to handle large data sets... I have been working this out line by line because storing those structures as is was taking way too much memory.
Thank you very much for your comments, regards.
Frank
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re: Fractal structure index puzzle
by lin0 (Curate) on Jul 18, 2007 at 18:29 UTC | |
|
Re: Fractal structure index puzzle
by BrowserUk (Patriarch) on Jul 19, 2007 at 03:24 UTC | |
by FFRANK (Beadle) on Jul 19, 2007 at 13:41 UTC |