Formally Verified Approximations of Definite Integrals - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Automated Reasoning Year : 2019

Formally Verified Approximations of Definite Integrals

Abstract

Finding an elementary form for an antiderivative is often a difficult task, so numerical integration has become a common tool when it comes to making sense of a definite integral. Some of the numerical integration methods can even be made rigorous: not only do they compute an approximation of the integral value but they also bound its inaccuracy. Yet numerical integration is still missing from the toolbox when performing formal proofs in analysis. This paper presents an efficient method for automatically computing and proving bounds on some definite integrals inside the Coq formal system. Our approach is not based on traditional quadrature methods such as Newton-Cotes formulas. Instead, it relies on computing and evaluating antiderivatives of rigorous polynomial approximations, combined with an adaptive domain splitting. Our approach also handles improper integrals, provided that a factor of the integrand belongs to a catalog of identified integrable functions. This work has been integrated to the CoqInterval library.
Fichier principal
Vignette du fichier
main.pdf (363.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01630143 , version 1 (07-11-2017)
hal-01630143 , version 2 (15-03-2018)

Identifiers

Cite

Assia Mahboubi, Guillaume Melquiond, Thomas Sibut-Pinote. Formally Verified Approximations of Definite Integrals. Journal of Automated Reasoning, 2019, 62 (2), pp.281-300. ⟨10.1007/s10817-018-9463-7⟩. ⟨hal-01630143v2⟩
954 View
726 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More