Fast and Reliable Approximation
Our aim is to develop computer-aided proofs of numerical values, with certified and reasonably tight error bounds, without sacrificing efficiency. Applications to zero-finding, numerical quadrature or global optimization can all benefit from using our results as building blocks. We expect our work to initiate a "fast and reliable" trend in the symbolic-numeric community. This will be achieved by developing interactions between our fields, designing and implementing prototype libraries and applying our results to concrete problems originating in optimal control theory.
Research activities
Formalisation and Proof of Numerical Programs
Participants
BOLDO SylvieMELQUIOND Guillaume
Publications : http://fastrelax.gforge.inria.fr/publications.html
More information : http://fastrelax.gforge.inria.fr/
