Round-off error analysis of explicit one-step numerical integration methods

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 24th IEEE Symposium on Computer Arithmetic, ARITH 2017
EditorsFlorent de Dinechin, Neil Burgess, Javier Bruguera
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages82-89
Number of pages8
ISBN (Electronic)9781538619643
DOIs
Publication statusPublished - 30 Aug 2017
Externally publishedYes
Event24th IEEE Symposium on Computer Arithmetic, ARITH 2017 - London, United Kingdom
Duration: 24 Jul 201726 Jul 2017

Publication series

NameProceedings - 24th IEEE Symposium on Computer Arithmetic, ARITH 2017

Conference

Conference24th IEEE Symposium on Computer Arithmetic, ARITH 2017
Country/TerritoryUnited Kingdom
CityLondon
Period24/07/1726/07/17

Fingerprint

Dive into the research topics of 'Round-off error analysis of explicit one-step numerical integration methods'. Together they form a unique fingerprint.

Cite this