7 Avenue du Colonel Roche
31077 Toulouse, Cedex 4, France
email: florent DOT brehard AT ens DASH lyon DOT fr
email: florent DOT brehard AT laas DOT fr
I am Ph.D. student in computer science under the supervision of Mioara Joldes (LAAS-CNRS in Toulouse, MAC team), Nicolas Brisebarre (ENS de Lyon, AriC team) and Damien Pous (ENS de Lyon, PLUME team). My main topic of interest is the conception of certified tools for numerical analysis, towards the objective of developing a general-purpose library for rigorous numerics with a formal proof layer guaranteeing the correctness of both the methods and the implementation.
Florent Bréhard, Nicolas Brisebarre, Mioara Joldes. Validated and numerically efficient Chebyshev spectral methods for linear ordinary differential equations. ACM Trans. Math. Software, 2018. Open access version.
Paulo Ricardo Arantes Gilz, Florent Bréhard, Clément Gazzino. Validated Semi-Analytical Transition Matrix for Linearized Relative Spacecraft Dynamics via Chebyshev Polynomials. AIAA SciTech Forum, 2018. Open access version
Florent Bréhard. A Newton-like Validation Method for Chebyshev Approximate Solutions of Linear Ordinary Differential Systems. ISSAC, 2018. Open access version
TchebyApprox: a C library to compute certified approximations to solutions of Linear Ordinary Differential Equations, using truncated Chebyshev series.
The project's Git repository can be checked out through anonymous access with the following command:
git clone https://scm.gforge.inria.fr/anonscm/git/tchebyapprox/tchebyapprox.git
Tutorials of the course Théorie de la programmation (Fall 2017) by Philippe Audebaud, together with Adrien Durier and Marc De Visme
Tutorials of the course Optimization and Approximation (Fall 2017) by Nicolas Bousquet, together with Luc Pellissier
Tutorials of the course Théorie de la programmation (Fall 2016) by Philippe Audebaud, together with Adrien Durier and Pierre Pradic
Tutorials of the course Optimization and Approximation (Fall 2016) by Alantha Newman, together with Khang Le Ngoc