What do multistep methods approximate?

DOI10.1007/BF01397552zbMath0657.65096OpenAlexW1989094764MaRDI QIDQ1110997

Olavi Nevanlinna, Timo Eirola

Publication date: 1988

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

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

zbMATH Keywords

first-order differential equationsinvariant circlesconsistent strictly stable multistep multiderivative methodflow of the vector fieldhyperbolic periodic trajectories

Mathematics Subject Classification ID

Topological structure of integral curves, singular points, limit cycles of ordinary differential equations (34C05) Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Related Items (7)

General linear methods: Connection to one step methods and invariant curves ⋮ On spurious fixed points of Runge-Kutta methods ⋮ A note on multistep methods and attracting sets of dynamical systems ⋮ Underlying one-step methods and nonautonomous stability of general linear methods ⋮ Matrix differential equations: a continuous realization process for linear algebra problems ⋮ Upper Semicontinuity of Attractors for Linear Multistep Methods Approximating Sectorial Evolution Equations ⋮ One- and multistep discretizations of index 2 differential algebraic systems and their use in optimization

Cites Work

• Discretization methods for stable initial value problems
• Multi-step methods are essentially one-step methods
• Invariant curves of one-step methods
• Two concepts for numerical periodic solutions of ODE's
• On invariant closed curves for one-step methods
• Invariant curves for numerical methods
• Periodic solutions of finite difference equations

This page was built for publication: What do multistep methods approximate?