Name
Abstract | ||
|---|---|---|
One of the most common and practical ways of representing a real function on machines is by using a polynomial approximation. It is then important to properly handle the error introduced by such an approximation. The purpose of this work is to offer guaranteed error bounds for a specific kind of rigorous polynomial approximation called Taylor model. We carry out this work in the Coq proof assistant, with a special focus on genericity and efficiency for our implementation. We give an abstract interface for rigorous polynomial approximations, parameterized by the type of coefficients and the implementation of polynomials, and we instantiate this interface to the case of Taylor models with interval coefficients, while providing all the machinery for computing them. We compare the performances of our implementation in Coq with those of the Sollya tool, which contains an implementation of Taylor models written in C. This is a milestone in our long-term goal of providing fully formally proved and efficient Taylor models. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-28891-3_9 | NASA Formal Methods |
Keywords | Field | DocType |
taylor model,abstract interface,rigorous polynomial approximation,sollya tool,interval coefficient,error bound,coq proof assistant,long-term goal,polynomial approximation,efficient taylor model | Polynomial approximations,Discrete mathematics,Taylor models,Parameterized complexity,Polynomial,Computer science,Real-valued function,Proof assistant | Conference |
Citations | PageRank | References |
8 | 0.57 | 27 |
Authors | ||
8 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicolas Brisebarre | 1 | 106 | 13.20 |
| Mioara Joldeş | 2 | 110 | 11.53 |
| Érik Martin-Dorel | 3 | 16 | 3.24 |
| Micaela Mayero | 4 | 84 | 10.38 |
| Jean-Michel Muller | 5 | 466 | 66.61 |
| Ioana Pasca | 6 | 140 | 7.99 |
| Laurence Rideau | 7 | 253 | 16.08 |
| Laurent Théry | 8 | 456 | 41.21 |