An algorithm for starting multistep methods.
type: Item
instance of: scholarly article
title: An algorithm for starting multistep methods.
zbMATH Open document ID: 1035.65077
DOI: 10.1016/S0898-1221(03)80011-1
author: R. Tirani
author: C. Paracelli
publication date: 2003-12-14T00:00:00Z
Mathematics Subject Classification ID: 65L06
Mathematics Subject Classification ID: 65L05
Mathematics Subject Classification ID: 65L20
Mathematics Subject Classification ID: 34A34
zbMATH DE Number: 2017181
zbMATH Keywords: Initial value problems
zbMATH Keywords: predictor-corrector method
zbMATH Keywords: numerical examples
zbMATH Keywords: starting multistep methods
zbMATH Keywords: Adams-Bashforth-Moulton PECE pair
zbMATH Keywords: convergence
describes a project that uses: NSDTST
describes a project that uses: STDTST
MaRDI profile type: Publication
cites work: Q4117285
cites work: ODE solvers and the method of lines
cites work: Differentiable Interpolants for High-Order Runge–Kutta Methods
cites work: On the Numerical Integration of Certain Differential Equations of the Second Order
cites work: Order Barriers for Continuous Explicit Runge-Kutta Methods
cites work: Two FORTRAN packages for assessing initial value methods
cites work: Q3657348
cites work: Q3779682
cites work: Interpolants for Runge-Kutta formulas
cites work: Global Error Estimates for ODE<scp>s</scp> Based on Extrapolation Methods
full work available at URL: s0898-1221(03)80011-1
OpenAlex ID: W1981183876
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 2017181