On generalized linear multistep methods with zero-parasitic roots and an adaptive principal root

DOI10.1007/BF01396634zbMath0326.65045MaRDI QIDQ1225917

Jan G. Verwer

Publication date: 1977

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132439

Mathematics Subject Classification ID

Numerical methods for initial value problems involving ordinary differential equations (65L05) Numerical analysis in abstract spaces (65J99)

Related Items (7)

A class of explicit multistep exponential integrators for semilinear problems ⋮ Exponential multistep methods of Adams-type ⋮ S-stability properties for generalized Runge-Kutta methods ⋮ A class of explicit exponential general linear methods ⋮ Unconditionally stable integration of Maxwell's equations ⋮ Convergence of rational multistep methods of Adams-Padé type ⋮ Nonlinear contractivity of a class of semi-implicit multistep methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accurate partial difference methods. II: Non-linear problems
• Explicit Runge-Kutta formulas with increased stability boundaries
• Some general implicit processes for the numerical solution of differential equations
• On the Stability and Accuracy of One-Step Methods for Solving Stiff Systems of Ordinary Differential Equations
• The Numerical Integration of Ordinary Differential Equations
• Efficient Integration Methods for Stiff Systems of Ordinary Differential Equations
• Multistep Methods with Variable Matrix Coefficients

This page was built for publication: On generalized linear multistep methods with zero-parasitic roots and an adaptive principal root