Timeline for Comparing Algorithmic complexity, ODE Solvers (Big O)

9 events

when toggle format	what		by	license	comment
Jul 19, 2020 at 17:52	history	edited	Chris Rackauckas	CC BY-SA 4.0	deleted 10 characters in body
Jan 16, 2018 at 7:19	history	edited	Chris Rackauckas	CC BY-SA 3.0	added 318 characters in body
Jan 16, 2018 at 1:08	comment	added	Chris Rackauckas		Asymptotically yes, but in practice that's essentially never going to happen. The reason is because the coefficients are orders of magnitude smaller, and are multiplied by higher order derivatives. Higher order derivatives tend to zero unless the solution is exploding, so this means that, yes if you make dt infinitely large that's true, but you never really make it large enough for that to matter. If you want more details, just ask it as another question.
Jan 15, 2018 at 21:39	comment	added	George		Thank you very much, your answer is extremely helpful. Just one quick question... am I correct in saying that for a larger step size, the Euler method would be the most accurate?
Jan 15, 2018 at 19:08	history	edited	Chris Rackauckas	CC BY-SA 3.0	added 356 characters in body
Jan 15, 2018 at 17:12	history	edited	Chris Rackauckas	CC BY-SA 3.0	added 84 characters in body
Jan 15, 2018 at 16:33	history	edited	Chris Rackauckas	CC BY-SA 3.0	added 54 characters in body
Jan 15, 2018 at 15:57	vote	accept	George
Jan 15, 2018 at 15:26	history	answered	Chris Rackauckas	CC BY-SA 3.0