Rate of Convergence of Multistep Codes Started by Variation of Order and Stepsize
stabilityconvergence ratestepsize controlmultistep methodvariable step variable formula codesVSVF algorithms
Nonlinear ordinary differential equations and systems (34A34) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Stability and convergence of numerical methods for ordinary differential equations (65L20) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50) Numerical methods for initial value problems involving ordinary differential equations (65L05)
- Starting BDF and Adams codes at optimal order
- Optimal Order and Stepsize Sequences
- Coefficients for studying one-step rational schemes for IVPs in ODEs. III: Extrapolation methods
- Starting variable-order Adams and BDF codes
- Elementary differentials, their graphs and codes
- Coefficients for studying one-step rational schemes for IVPs in ODEs. I
- Coefficients for studying one-step rational schemes for IVPs in ODEs: II
- scientific article; zbMATH DE number 4102403 (Why is no real title available?)
- Numerical investigations on global error estimation for ordinary differential equations
- scientific article; zbMATH DE number 3905770 (Why is no real title available?)
- Variable order Adams codes.
- The starting procedure in variable-stepsize variable-order PECE codes
- scientific article; zbMATH DE number 4000403 (Why is no real title available?)
- An algorithm for starting multistep methods.
- Efficient rational one-step numerical integrators for initial value problems in ordinary differential equations
- New extrapolation methods for initial value problems in ordinary differential equations
This page was built for publication: Rate of Convergence of Multistep Codes Started by Variation of Order and Stepsize
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3349894)