This shows you the differences between two versions of the page.
Next revision | Previous revision | ||
ode113 [2019/11/18 13:34] 127.0.0.1 external edit |
— (current) | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== ode113 ====== | ||
- | |||
- | ode113 (Adams) | ||
- | |||
- | A variable order Adams-Bashforth-Moulton PECE solver, ode 113 may be more efficient than ode45 at stringent tolerances and when the ODE function is particularly expensive to evaluate. ode113 is a // | ||
- | |||
- | Applicable [[Solver_settings|solver settings]]: | ||
- | |||
- | * Absolute tolerance | ||
- | * Relative tolerance | ||
- | * Initial step size | ||
- | * Max step size | ||
- | * Min step size | ||
- | * Refine | ||
- | * Limit data points to last | ||
- | * Norm Control | ||
- | * Allowed step size violations | ||
- | * Enable saturation | ||
- | |||
- | ===== Reference ===== | ||
- | |||
- | * Shampine, L. F. and M. K. Gordon, //Computer Solution of Ordinary Differential Equations: the Initial Value Problem//, W. H. Freeman, SanFrancisco, | ||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||