Starting step size for an ODE solver
From MaRDI portal
Publication:1050741
DOI10.1016/0377-0427(83)90040-7zbMath0513.65046OpenAlexW2010667400MaRDI QIDQ1050741
Publication date: 1983
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(83)90040-7
Numerical methods for initial value problems involving ordinary differential equations (65L05) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50)
Related Items (23)
\(L\)-stable explicit nonlinear method with constant and variable step-size formulation for solving initial value problems ⋮ Automatic selection of the initial step size for an ODE solver ⋮ The starting procedure in variable-stepsize variable-order PECE codes ⋮ Efficient fourth order P-stable formulae ⋮ Starting BDF and Adams codes at optimal order ⋮ A simple step size selection algorithm for ODE codes ⋮ A note on variable step-size formulation of a Simpson's-type second derivative block method for solving stiff systems ⋮ Improving the performance of a code for solving stiff systems of ODEs ⋮ An embedded 3(2) pair of nonlinear methods for solving first order initial-value ordinary differential systems ⋮ Unnamed Item ⋮ Design and implementation of DIRK integrators for stiff systems ⋮ Numerical solution of nonlinear singularly perturbed problems by using a non-standard algorithm on variable stepsize implementation (CMMSE-2009) ⋮ An efficient variable step-size rational Falkner-type method for solving the special second-order IVP ⋮ Solving first-order initial-value problems by using an explicit non-standard \(A\)-stable one-step method in variable step-size formulation ⋮ A tenth order \(\mathcal{A} \)-stable two-step hybrid block method for solving initial value problems of ODEs ⋮ Software for the numerical solution of systems of functional differential equations with state-dependent delays ⋮ Adaptive step-size approach for Simpson's-type block methods with time efficiency and order stars ⋮ Efficient adaptive step-size formulation of an optimized two-step hybrid block method for directly solving general second-order initial-value problems ⋮ Starting variable-order Adams and BDF codes ⋮ An efficient optimized adaptive step-size hybrid block method for integrating differential systems ⋮ An efficient optimized adaptive step-size hybrid block method for integrating \(w^{\prime \prime} = F (t, w, w^\prime)\) directly ⋮ Run time estimation of the spectral radius of Jacobians ⋮ The step sizes used by one-step codes for ODEs
Uses Software
Cites Work
- The art of writing a Runge-Kutta code. II
- An algorithm for numerical differentiation of a function of one real variable
- Adaptive Numerical Differentiation
- Runge-Kutta Starters for Multistep Methods
- Comparing numerical methods for stiff systems of O.D.E:s
- Limiting Precision in Differential Equation Solvers. II: Sources of Trouble and Starting a Code
- A Theoretical Criterion for Comparing Runge–Kutta Formulas
- Hybrid Methods for Initial Value Problems in Ordinary Differential Equations
- Comparing Numerical Methods for Ordinary Differential Equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Starting step size for an ODE solver
