An algorithm for Gauss-Romberg integration |
| |
Authors: | J. N. Lyness |
| |
Affiliation: | 1. Applied Mathematics Division, Argonne National Laboratory, 60439, Argonne, Illinois 2. Department of Computational and Statistical Science, University of Liverpool, UK
|
| |
Abstract: | WhenR (m) f is anm copy version of a quadrature ruleRf, the error functional satisfies an asymptotic expansion $$R^{(m)} f - If simeq d_2 h^2 + d_4 h^4 + ...,m = 1/h.$$ In the conventional form of Romberg Integration,Rf is the trapezoidal rule and early terms of this expansion are “eliminated.” For this purpose the Neville-Romberg algorithm is used to construct the conventionalT-table. IfRf is taken to be a ruleGf of polynomial degree 2t+1 the firstt terms in this expansion are in any case zero. A generalization of the Neville-Romberg algorithm is derived. This “eliminates” termsd 2s h 2s ,s=t+1,t+2, ... An associatedG-table is defined and some of its properties are noted. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|