Fast Algorithms for Polynomial Interpolation, Integration and Differentiation

Abstract

For functions tabulated at Chebyshev nodes on an interval, spectral interpolation, integration and differentiation can be performed stably and efficiently via the fast Fourier transform. In this paper, a group of algorithms is presented for the efficient evaluation of Lagrange polynomial interpolants at multiple points on the line, and for the rapid spectral integration and differentiation of functions tabulated at nodes other than Chebyshev.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1993
Accession Number
ADA267505

Entities

People

  • A. Dutt
  • M. Gu
  • Vladimir Rokhlin

Organizations

  • Yale University

Tags

Communities of Interest

  • Air Platforms
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Arithmetic
  • Chebyshev Approximations
  • Chebyshev Polynomials
  • Complex Numbers
  • Computations
  • Computer Programs
  • Differential Equations
  • Far Field
  • Integrals
  • Military Research
  • Numbers
  • Polynomials
  • Real Numbers
  • Three Dimensional
  • Two Dimensional

Readers

  • Approximation Theory.