论文信息 - Interval Integration Revisited

Interval Integration Revisited

We present an overview of approaches to selfvalidating one-dimensional integration quadrature formulas and a verified numerical integration algorithm with an adaptive strategy. The new interval integration adaptive algorithm delivers a desired integral enclosure with an error bounded by a specified error bound. The adaptive technique is usually much more efficient than Simpson’s rule and narrow interval results can be reached.

Sérgio Galdino

[1] T. Sunaga. Theory of an interval algebra and its application to numerical analysis , 2009 .

[2] Rainer Kelch. Ein adaptives Verfahren zur Numerischen Quadratur mit automatischer Ergebnisverifikation , 1989 .

[3] J. C. Burkill. Functions of Intervals , 1924 .

[4] Richard A. Conger. Certification of Algorithm 58: Matrix inversion , 1962, CACM.

[5] James N. Lyness,et al. Notes on the Adaptive Simpson Quadrature Routine , 1969, J. ACM.

[6] R. Young. The algebra of many-valued quantities , 1931 .

[7] L. B. Rall,et al. Adaptive, self-validating numerical quadrature , 1987 .

[8] Ramon E. Moore. Interval arithmetic and automatic error analysis in digital computing , 1963 .

[9] Ulrike Storck,et al. Numerical Integration in Two Dimensions with Automatic Result Verification , 1993 .

[10] Siegfried M. Rump,et al. INTLAB - INTerval LABoratory , 1998, SCAN.