Rapid computation of general interpolation formulas and mechanical quadrature rules
- 1 December 1971
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 14 (12) , 797-801
- https://doi.org/10.1145/362919.362941
Abstract
Let ƒ have n continuous derivatives on a closed interval [ a, b ] and let L be a linear functional. The attempt is made to approximate L (ƒ) with L ( Q ) where Q is a polynomial, approximating ƒ. Algorithms are developed for rapid computation of L ( Q ) for a wide class of selections of Q which includes the Lagrangian and Hermitian rules as special cases.Keywords
This publication has 7 references indexed in Scilit:
- Algorithm 417: Rapid computation of weights of interpolatory quadrature rulesCommunications of the ACM, 1971
- Algorithm 416: Rapid computation of coefficients of interpolation formulasCommunications of the ACM, 1971
- Control and estimation of computational errors in the evaluation of interpolation formulae and quadrature rulesMathematics of Computation, 1970
- Applications of Hilbert transform theory to numerical quadratureMathematics of Computation, 1969
- On the construction of discrete approximations to linear differential expressionsMathematics of Computation, 1967
- Van der Monde systems and numerical differentiationNumerische Mathematik, 1966
- Associated Polynomials and Uniform Methods for the Solution of Linear ProblemsSIAM Review, 1966