-
Notifications
You must be signed in to change notification settings - Fork 35
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Henon's trick for calculating Poincare section? #100
Labels
Comments
In general sounds good, my concern would be mostly about actually implementing this, and the performance defecit; I think the version we have right now is quite performant. |
But of course, this doesn't have to remove the existing |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
I saw an interesting trick for PSOS in the very short (3 pages) note
The current code for PSOS, and it uses a root-finding algorithm to find the precise time needed to step the integration. In Henon's paper, he suggests transforming the ODE to solve for the precise time as a dependent variable, so the accuracy of solving for time would be the same accuracy as one step of the ODE solver.
I wonder if it's worth implementing in terms of increasing accuracy?
Want to back this issue? Post a bounty on it! We accept bounties via Bountysource.
The text was updated successfully, but these errors were encountered: