On the Petras algorithm for verified integration of piecewise analytic functions

From MaRDI portal



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|/epsp−1), for any p>1, where eps is the desired accuracy of the computed integral.






Describes a project that uses

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)