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.
Rapid computation of general interpolation formulas and mechanical quadrature rules
The Latest from CACM
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More
Join the Discussion (0)
Become a Member or Sign In to Post a Comment