On the Petras algorithm for verified integration of piecewise analytic functions

详细信息    查看全文

• 作者：Małgorzata Moczurad ^{malgorzata.moczurad@ii.uj.edu.pl} ; Piotr Zgliczyński ; ^{piotr.zgliczynski@ii.uj.edu.pl}
• 关键词：Verified integration ; Cost of integration algorithm
• 刊名：Journal of Complexity
• 出版年：2017
• 出版时间：April 2017
• 年：2017
• 卷：39
• 期：Complete
• 页码：69-93
• 全文大小：588 K
• 卷排序：39

文摘

We consider the algorithm for verified integration of piecewise analytic functions presented in Petras’ paper (Petras, 2002). The analysis of the algorithm contained in that paper is limited to a narrow class of functions and gives upper bounds only. We present an estimate of the cost (measured by the number of evaluations of the integrand) of the algorithm, both upper and lower bounds, for a wider class of functions. We show examples of functions with cost Θ(∣lnε∣/εp−1)Θ(∣lnε∣/εp−1), for any p>1p>1, where εε is the desired accuracy of the computed integral.