Verifying the Accuracy of Polynomial Approximations in HOL

@inproceedings{Harrison1997VerifyingTA,
  title={Verifying the Accuracy of Polynomial Approximations in HOL},
  author={John Harrison},
  booktitle={TPHOLs},
  year={1997}
}
Many modern algorithms for the transcendental functions rely on a large table of precomputed values together with a low-order polynomial to interpolate between them. In verifying such an algorithm, one is faced with the problem of bounding the error in this polynomial approximation. The most straightforward methods are based on numerical approximations, and are not prima facie reducible to a formal HOL proof. We discuss a technique for proving such results formally in HOL, via the formalization… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

Formalizing a Proof that e is Transcendental

J. Formalized Reasoning • 2011
View 1 Excerpt

References

Publications referenced by this paper.

Sur le calcul e ectif des polynomes d ' approximation deTchebichef

T. J. Rivlin
Comptes Rendus Hebdomadaires des S  eances de l ' Acad  emie desSciences • 1934

Similar Papers

Loading similar papers…