Rapid computation of general interpolation formulas and mechanical quadrature rules

Authors:
Sven-Åke Gustafson
Affiliations:
Royal Institute of Technology, Stockholm
Venue:
Communications of the ACM
Year:
1971

Citing 3
Cited 3

Algorithm 416: Rapid computation of coefficients of interpolation formulas

Communications of the ACM
Algorithm 417: Rapid computation of weights of interpolatory quadrature rules

Communications of the ACM
Rounding Errors in Algebraic Processes

Rounding Errors in Algebraic Processes

On Multipoint Numerical Interpolation

ACM Transactions on Mathematical Software (TOMS)
Algorithm 416: Rapid computation of coefficients of interpolation formulas

Communications of the ACM
Algorithm 417: Rapid computation of weights of interpolatory quadrature rules

Communications of the ACM

Quantified Score

Hi-index	48.25

Visualization

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.