Simplifying assumptions for the order of partitioned multivalue methods

DOI10.1007/BF01933639MaRDI QIDQ3935393zbMATH OpenOpenAlexFDO

Authors Kevin Burrage, Pamela Moss

Publication date 1980

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01933639

zbMATH Keywords

Butcher seriesorderpartitioned multivalue methodsRunge-Kutta method

Mathematics Subject Classification ID

Numerical methods for initial value problems involving ordinary differential equations (65L05)

Cites work

• A special family of Runge-Kutta methods for solving stiff differential equations
• Implicit Runge-Kutta Processes
• Non-linear stability of a general class of differential equation methods
• On the Butcher group and general multi-value methods
• On the Convergence of Numerical Solutions to Ordinary Differential Equations
• On the implementation of implicit Runge-Kutta methods
• Runge-Kutta methods with a multiple real eigenvalue only
• Stability and efficiency properties of implicit Runge-Kutta methods
• The Solution of the order conditions for general linear methods

Cited in

(9)

• Asymptotic expansions of the global error of fixed-stepsize methods
• General linear method: A survey
• Order and stability properties of explicit multivalue methods
• The dichotomy of stiffness: Pragmatism versus theory
• Efficiently implementable multivalue methods for solving stiff ordinary differential equations
• The error behaviour of a general class of predictor-corrector methods
• Construction of two-step Runge-Kutta methods of high order of ordinary differential equations
• Local error estimation for multistep collocation methods
• Superconvergence for Multistep Collocation

This page was built for publication: Simplifying assumptions for the order of partitioned multivalue methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3935393)