A Newton-like Validation Method for Chebyshev Approximate Solutions of Linear Ordinary Differential Systems. - Florent Bréhard (ISSAC, 2018)

Validated and Numerically Efficient Chebyshev Spectral Methods for Linear Ordinary Differential Equations. - Florent Bréhard; Nicolas Brisebarre; Mioara Joldes (ACM Trans. Math. Softw., 2018)

Exchange Algorithm for Evaluation and Approximation Error-Optimized Polynomials. - Denis Arzelier; Florent Bréhard; Mioara Joldes (ARITH, 2019)

On Moment Problems with Holonomic Functions. - Florent Bréhard; Mioara Joldes; Jean-Bernard Lasserre (ISSAC, 2019)

A Certificate-Based Approach to Formally Verified Approximations. - Florent Bréhard; Assia Mahboubi; Damien Pous (ITP, 2019)

Calcul numérique certifié dans les espaces fonctionnels : Un trilogue entre approximations polynomiales rigoureuses, calcul symbolique et preuve formelle. (Certified numerics in function spaces : polynomial approximations meet computer algebra and formal proof). - Florent Bréhard (2019)

Polynomial superlevel set approximation of swept-volume for computing collision probability in space encounters. - Denis Arzelier; Florent Bréhard; Mioara Joldes; Jean B. Lasserre; S. Laurens; Aude Rondepierre (CDC, 2021)

A Symbolic-Numeric Validation Algorithm for Linear ODEs with Newton-Picard Method. - Florent Bréhard (Math. Comput. Sci., 2021)

Validated Root Enclosures for Interval Polynomials with Multiplicities. - Florent Bréhard; Adrien Poteaux; Léo Soudant (ISSAC, 2023)

Rounding Error Analysis of an Orbital Collision Probability Evaluation Algorithm. - Denis Arzelier; Florent Bréhard; Mioara Joldes; Marc Mezzarobba (ARITH, 2024)

Efficient and Validated Numerical Evaluation of Abelian Integrals. - Florent Bréhard; Nicolas Brisebarre; Mioara Joldes; Warwick Tucker (ACM Trans. Math. Softw., 2024)