Round-off Error Analysis of Explicit One-Step Numerical Integration Methods

Ordinary differential equations are ubiquitous in scientific computing. Solving exactly these equations is usually not possible, except for special cases, hence the use of numerical schemes to get a discretized solution. We are interested in such numerical integration methods, for instance Euler's method or the Runge-Kutta methods. As they are implemented using floating-point arithmetic, round-off errors occur. In order to guarantee their accuracy, we aim at providing bounds on the round-off errors of explicit one-step numerical integration methods. Our methodology is to apply a fine-grained analysis to these numerical algorithms. Our originality is that our floating-point analysis takes advantage of the linear stability of the scheme, a mathematical property that vouches the scheme is well-behaved.

[1]  Leo G. Rebholz,et al.  Numerical Analysis , 2019 .

[2]  R. D. Richtmyer,et al.  Difference methods for initial-value problems , 1959 .

[3]  F. Krogh,et al.  Solving Ordinary Differential Equations , 2019, Programming for Computations - Python.

[4]  Jana Fuhrmann,et al.  Reviews In Computational Chemistry , 2016 .

[5]  Ernst Hairer,et al.  Solving Ordinary Differential Equations I: Nonstiff Problems , 2009 .

[6]  Ernst Hairer,et al.  Achieving Brouwer’s law with implicit Runge–Kutta methods , 2008 .

[7]  J. Lambert.  Numerical Methods for Ordinary Differential Systems: The Initial Value Problem , 1991 .

[8]  Christoph Quirin Lauter,et al.  Determining fixed-point formats for a digital filter implementation using the worst-case peak gain measure , 2015, 2015 49th Asilomar Conference on Signals, Systems and Computers.

[9]  Martin Berz,et al.  Verified Integration of ODEs and Flows Using Differential Algebraic Methods on High-Order Taylor Models , 1998, Reliab. Comput..

[10]  P. Bodenheimer.  Numerical methods in astrophysics : an introduction , 2006 .

[11]  Guillaume Melquiond,et al.  Flocq: A Unified Library for Proving Floating-Point Algorithms in Coq , 2011, 2011 IEEE 20th Symposium on Computer Arithmetic.

[12]  Nedialko S. Nedialkov,et al.  On Taylor Model Based Integration of ODEs , 2007, SIAM J. Numer. Anal..

[13]  Florent de Dinechin,et al.  Certifying the Floating-Point Implementation of an Elementary Function Using Gappa , 2011, IEEE Transactions on Computers.

[14]  Julien Alexandre Dit Sandretto,et al.  Validated Explicit and Implicit Runge-Kutta Methods , 2016 .

[15]  J. Vignes,et al.  Validation of results of collocation methods for ODEs with the CADNA library , 1996 .

[16]  O. Bouissou,et al.  GRKLib: a Guaranteed Runge Kutta Library , 2006, 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006).

[17]  Julien Alexandre Dit Sandretto,et al.  Validated Simulation of Differential Algebraic Equations with Runge-Kutta Methods , 2016 .

[18]  Fabian Immler,et al.  Formally Verified Computation of Enclosures of Solutions of Ordinary Differential Equations , 2014, NASA Formal Methods.

[19]  Guillaume Melquiond,et al.  Certification of bounds on expressions involving rounded operators , 2007, TOMS.

[20]  Dirk Brouwer,et al.  Erratum [On the accumulation of errors in numerical integration] , 1937 .