We are interested in computing certified approximations using computer algebra and formal proof systems, in analyzing the fundamental algorithms of semi-numerical computation, in finding best or nearly best approximations under special constraints, and in designing efficient algorithms for exact linear algebra. Also, we are working on the development and standardization of interval arithmetic.

Members of the team participating in this activity are:

• Paola Boito
• Florent Bréhard
• Nicolas Brisebarre
• Guillaume Hanrot
• Claude-Pierre Jeannerod
• Vincent Lefèvre
• Nicolas Louvet
• Stephen Melczer
• Jean-Michel Muller
• Antoine Plet
• Valentina Popescu
• Nathalie Revol
• Bruno Salvy
• Damien Stehlé
• Laurent Thévenoux
• Serge Torres
• Gilles Villard