Florent Bréhard

Orcid: 0000-0003-3909-2099

According to our database1, Florent Bréhard authored at least 10 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient and Validated Numerical Evaluation of Abelian Integrals.
ACM Trans. Math. Softw., March, 2024

2023
Validated Root Enclosures for Interval Polynomials with Multiplicities.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2021
A Symbolic-Numeric Validation Algorithm for Linear ODEs with Newton-Picard Method.
Math. Comput. Sci., 2021

Polynomial superlevel set approximation of swept-volume for computing collision probability in space encounters.
Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021

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).
PhD thesis, 2019

A Certificate-Based Approach to Formally Verified Approximations.
Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

On Moment Problems with Holonomic Functions.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Exchange Algorithm for Evaluation and Approximation Error-Optimized Polynomials.
Proceedings of the 26th IEEE Symposium on Computer Arithmetic, 2019

2018
Validated and Numerically Efficient Chebyshev Spectral Methods for Linear Ordinary Differential Equations.
ACM Trans. Math. Softw., 2018

A Newton-like Validation Method for Chebyshev Approximate Solutions of Linear Ordinary Differential Systems.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018


  Loading...