Error Estimates and Adaptive Time-Step Control for a Class of One-Step Methods for Stiff Ordinary Differential Equations
Claes Johnson
Abstract
Claes Johnson
Abstract
We prove new optimal a priori error estimates for a class of implicit one-step methods for stiff ordinary differential equations obtained by using the discontinuous Galerkin method with piecewise polynomials of degree zero and one. Starting from these estimates we propose a new algorithm for automatic time-step control and we discuss the relation between this algorithm and earlier algorithms implemented in packages for the numerical solution of stiff ordinary differential equations.
OpenAlex reports 146 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We prove new optimal a priori error estimates for a class of implicit one-step methods for stiff ordinary differential equations obtained by using the discontinuous Galerkin method with piecewise polynomials of degree zero and one. Starting from these estimates we propose a new algorithm for automatic time-step control and we discuss the relation between this algorithm and earlier algorithms implemented in packages for the numerical solution of stiff ordinary differential equations.
Key concepts: Mathematics, Piecewise, Ordinary differential equation, A priori and a posteriori, Galerkin method, Applied mathematics, Explicit and implicit methods, Backward differentiation formula