Ph.D
Group : Verification of Algorithms, Languages and Systems
Formalizations of error analysis in numerical analysis and floating-point arithmetic
Starts on 01/10/2016
Advisor : BOLDO, Sylvie
Funding : Autre financement à préciser
Affiliation : Université Paris-Saclay
Laboratory : LRI -l'amphithéâtre du bâtiment 660 (Claude Shanno
Defended on 13/12/2019, committee :
Rapporteurs :
- Yves Bertot (Inria Sophia Antipolis Méditerranée),
- Paul Zimmermann (Inria Nancy Grand Est),
Examinateurs :
- Stef Graillat (Sorbonne Université),
- Florent Hivert (Université Paris-Sud),
- Assia Mahboubi (Inria, LS2N),
Encadrants :
- Sylvie Boldo (Inria Saclay - Île-de-France),
- Alexandre Chapoutot (ENSTA ParisTech),
Invité :
- David Mentré (Mitsubishi Electric R&D Centre Europe).
Research activities :
Abstract :
This thesis consists of three contributions related to the Coq formalization of error analysis
in numerical analysis and floating-point arithmetic.
First, we have exhibited an algorithm computing the average of two decimal floating-point numbers
and have proved that this algorithm computes the correct rounding. We have formalized the algorithm
and its correctness proof in the Coq proof assistant.
The second contribution of the thesis is the analysis and the formalization of rounding error bounds associated to the implementation of Runge-Kutta methods applied to linear systems. We have proposed a generic methodology to build a bound on the error accumulated over the iterations, taking potential underflow and overflow into account. We have then instantiated this methodology for classic Runge-Kutta methods, e.g. the Euler and RK2 methods. We have proposed a formalization of the results, including the definition of matrix norms, the proof of rounding error bounds for matrix operations and the formalization of the generic results and their instantiations.
Finally, we have proposed a formalization of functional analysis results that serve as foundations for the finite element method. This formalization is based on the Coquelicot library and includes the theory of Hilbert spaces, the formal proof of the Lax-Milgram Theorem and the proof of completeness of finite dimensional subspaces of Hilbert spaces.