Explicit and implicit error inhibiting schemes with post-processing
From MaRDI portal
Publication:2664037
Abstract: Efficient high order numerical methods for evolving the solution of an ordinary differential equation are widely used. The popular Runge--Kutta methods, linear multi-step methods, and more broadly general linear methods, all have a global error that is completely determined by analysis of the local truncation error. In prior work in we investigated the interplay between the local truncation error and the global error to construct {em error inhibiting schemes} that control the accumulation of the local truncation error over time, resulting in a global error that is one order higher than expected from the local truncation error. In this work we extend our error inhibiting framework to include a broader class of time-discretization methods that allows an exact computation of the leading error term, which can then be post-processed to obtain a solution that is two orders higher than expected from truncation error analysis. We define sufficient conditions that result in a desired form of the error and describe the construction of the post-processor. A number of new explicit and implicit methods that have this property are given and tested on a variety of ordinary and partial differential equation. We show that these methods provide a solution that is two orders higher than expected from truncation error analysis alone.
Recommendations
- Two-derivative error inhibiting schemes and enhanced error inhibiting schemes
- Error inhibiting block one-step schemes for ordinary differential equations
- An adaptive error inhibiting block one-step method for ordinary differential equations
- Error propagation for implicit-explicit general linear methods
- On error estimation in general linear methods for stiff ODEs
Cites work
- A class of implicit peer methods for stiff systems
- An Introduction to Numerical Analysis
- Analysis of Fixed-Stepsize Methods
- Diagonally-implicit multi-stage integration methods
- Doubly quasi-consistent fixed-stepsize numerical integration of stiff ordinary differential equations with implicit two-step peer methods
- Error inhibiting block one-step schemes for ordinary differential equations
- Explicit strong stability preserving multistep Runge-Kutta methods
- High Order Finite Difference Schemes for the Heat Equation Whose Convergence Rates are Higher Than Their Truncation Errors
- scientific article; zbMATH DE number 5713618 (Why is no real title available?)
- scientific article; zbMATH DE number 1131492 (Why is no real title available?)
- scientific article; zbMATH DE number 872523 (Why is no real title available?)
- scientific article; zbMATH DE number 3269388 (Why is no real title available?)
- Numerical Methods for Ordinary Differential Equations
- On quasi-consistent integration by Nordsieck methods
- Solving Ordinary Differential Equations I
- Superconvergent explicit two-step peer methods
- The numerical solution of ordinary and partial differential equations.
- Variable-stepsize doubly quasi-consistent parallel explicit peer methods with global error control
- Variable-stepsize interpolating explicit parallel peer methods with inherent global error control
Cited in
(6)- An adaptive error inhibiting block one-step method for ordinary differential equations
- Parallel implicit-explicit general linear methods
- A general linear method approach to the design and optimization of efficient, accurate, and easily implemented time-stepping methods in CFD
- Two-derivative error inhibiting schemes and enhanced error inhibiting schemes
- A holistic algorithmic approach to improving accuracy, robustness, and computational efficiency for atmospheric dynamics
- A high order block finite difference, error inhibiting scheme for the transport equation
This page was built for publication: Explicit and implicit error inhibiting schemes with post-processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664037)
