Numerical treatment of O.D.Es.: The theory of A-methods
Almost all commonly used methods for O.D.Es. and their most miscellaneous compositions are A-methods, i.e. they can be reduced to \(z_ 0=\zeta\); \(z_ j=Az_{j-1}+h\phi (x_{j-1},z_{j-1},z_ j;h), z_ j\in {\mathbb{R}}^ s\), \(A\in {\mathbb{R}}(s,s)\), \(j=1,...,m\). This paper presents a general theory for A-methods and discusses its practical consequences. An analysis of local discretization error (l.d.e.) accumulation results in a general order criterium and reveals which part of the l.d.e. effectively influences the global error. This facilitates the comparison of methods and generalizes considerably the concept of error constants. It is shown, as a consequence, that the global error cannot be safely controlled by the size of the l.d.e. and that the conventional error control may fail in important cases. Furthermore, Butcher's effective order methods, the concept of Nordsieck forms, and Gear's interpretation of linear k-step schemes as relaxation methods are generalized. The stability of step changing is shortly discussed.
- A-stable block implicit one-step methods
- Analysis of Fixed-Stepsize Methods
- Cyclic Composite Multistep Predictor-Corrector Methods
- Error Estimates for General Linear Methods for Ordinary Differential Equations
- Explicit, optimal stability functionals and their application to cyclic discretization methods
- scientific article; zbMATH DE number 3786072 (Why is no real title available?)
- scientific article; zbMATH DE number 3541848 (Why is no real title available?)
- scientific article; zbMATH DE number 3434988 (Why is no real title available?)
- scientific article; zbMATH DE number 3182507 (Why is no real title available?)
- Interpolation and Error Estimation in Adams PC-Codes
- Numerical initial value problems in ordinary differential equations.
- On the Convergence of Numerical Solutions to Ordinary Differential Equations
- On the possibility of two-sided error bounds in the numerical solution of initial value problems
- Control theory and the numerical solution of ODEs
- Symbolic derivation of Runge-Kutta-Nyström order conditions
- Applying the JII, JII-SI, and CG methods to two classes of linear problems
- Variable stepsize diagonally implicit multistage integration methods for ordinary differential equations
- Order conditions for two-step Runge-Kutta methods
- On explicit two-derivative two-step Runge-Kutta methods
- Variable stepsize continuous two-step Runge-Kutta methods for ordinary differential equations
- Elements of a general theory of composite integration methods
- Strong stability preserving second derivative general linear methods
- Butcher algebras for Butcher systems
- General linear methods with external stages of different orders
- Order conditions for integrators and mappings with applications
- scientific article; zbMATH DE number 4169086 (Why is no real title available?)
- Sektion Numerische Behandlung Von Differentialgleichungen (Fem) Section Numerical Treatment of Differential Equations (FEM)
- Order conditions for general linear methods
- Implementation of two-step Runge-Kutta methods for ordinary differential equations
- The common basis of the theories of linear cyclic methods and Runge-Kutta methods
- Runge-Kutta methods: Some historical notes
- Strong stability preserving integrating factor general linear methods
- Strong stability preserving general linear methods
- Symbolic derivation of order conditions for hybrid Numerov-type methods solving \(y^{\prime\prime} =f(x,y)\)
This page was built for publication: Numerical treatment of O.D.Es.: The theory of A-methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799350)
