On the Petras algorithm for verified integration of piecewise analytic functions

From MaRDI portal
Publication:511115

DOI10.1016/J.JCO.2016.10.004zbMATH Open1359.65036arXiv1603.03945OpenAlexW2963947048MaRDI QIDQ511115FDOQ511115

Piotr Zgliczyński, Małgorzata Moczurad

Publication date: 14 February 2017

Published in: Journal of Complexity (Search for Journal in Brave)

Abstract: We consider the algorithm for verified integration of piecewise analytic functions given by Petras. The analysis of the algorithm contained in Patras' paper is limited to a narrow class of functions and gives upper bounds only. We present an estimation of the complexity (measured by a number of evaluations of an integrand) of the algorithm, both upper and lower bounds, for a wider class of functions. We show examples with complexity Theta(|lneps|/epsp1), for any p>1, where eps is the desired accuracy of the computed integral.


Full work available at URL: https://arxiv.org/abs/1603.03945




Recommendations




Cites Work


Cited In (1)

Uses Software





This page was built for publication: On the Petras algorithm for verified integration of piecewise analytic functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511115)