Control and estimation of computational errors in the evaluation of interpolation formulae and quadrature rules
HTML articles powered by AMS MathViewer
- by Sven-Ȧke Gustafson PDF
- Math. Comp. 24 (1970), 847-854 Request permission
Abstract:
Approximate rules for evaluating linear functionals are often obtained by requiring that the rule shall give exact value for a certain linear class of functions. The parameters of the rule appear hence as the solution of a system of equations. This can generally not be solved exactly but only "numerically." Sometimes large errors occur in the parameters defining the rule, but the resultant error in the computed value of the functional is small. In the present paper we shall develop efficient methods of computing a strict bound for this error in the case when the parameters of the rule are determined from a linear system of equations.References
- Philip J. Davis, A construction of nonnegative approximate quadratures, Math. Comp. 21 (1967), 578–582. MR 222534, DOI 10.1090/S0025-5718-1967-0222534-4 -Å. Gustafson, Rapid Computation of Interpolation Formulae and Mechanical Quadrature Rules, Technical Report, Computer Science Department, Stanford University, August 1969. (Submitted to CACM.) S.-Å. Gustafson, Error Propagation by Use of Interpolation Formulae and Quadrature Rules, Which are Computed Numerically, Technical Report, Computer Science Department, Stanford University, August 1969.
- I. P. Natanson, Constructive function theory. Vol. I. Uniform approximation, Frederick Ungar Publishing Co., New York, 1964. Translated from the Russian by Alexis N. Obolensky. MR 0196340
- M. Wayne Wilson, A general algorithm for nonnegative quadrature formulas, Math. Comp. 23 (1969), 253–258. MR 242374, DOI 10.1090/S0025-5718-1969-0242374-1
Additional Information
- © Copyright 1970 American Mathematical Society
- Journal: Math. Comp. 24 (1970), 847-854
- MSC: Primary 65.55
- DOI: https://doi.org/10.1090/S0025-5718-1970-0278518-3
- MathSciNet review: 0278518