After a profiling of the code for the sparse version of the AttractorsViaRecurrences I found that 50% of the computing time was dedicated to @boundcheck in the SparseArray.jl file (no joking!). I removed this boundcheck assuming that the user will never use the version included in ChaosTools.jl.
However this is a strong performance vs safety case.
The other change is minor: change from error to @warn when the safety counter hits the ceiling. The initial condition is labeled -1 and the program goes on. It is frustrating when the continuation program throws an error after two hours of computing.
After a profiling of the code for the sparse version of the
AttractorsViaRecurrencesI found that 50% of the computing time was dedicated to@boundcheckin theSparseArray.jlfile (no joking!). I removed this boundcheck assuming that the user will never use the version included inChaosTools.jl.However this is a strong performance vs safety case.
The other change is minor: change from
errorto@warnwhen the safety counter hits the ceiling. The initial condition is labeled -1 and the program goes on. It is frustrating when the continuation program throws an error after two hours of computing.