Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation

DOI10.1137/0733082zbMath0862.65005OpenAlexW2005998530MaRDI QIDQ4714737

Ming Gu, Vladimir Rokhlin, Alok Dutt

Publication date: 25 May 1997

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0733082

zbMATH Keywords

interpolation fast algorithms condition number numerical stability integration differentiation numerical performance FORTRAN implementations tabulated functions

Mathematics Subject Classification ID

Numerical interpolation (65D05) Numerical quadrature and cubature formulas (65D32) Numerical differentiation (65D25) Complexity and performance of numerical algorithms (65Y20)

Related Items (41)

Barycentric prolate interpolation and pseudospectral differentiation ⋮ Superconvergence and fast implementation of the barycentric prolate differentiation ⋮ Fast algorithms for discrete polynomial transforms on arbitrary grids ⋮ On the operator splitting and integral equation preconditioned deferred correction methods for the ``good Boussinesq equation ⋮ A new method for Chebyshev polynomial interpolation based on cosine transforms ⋮ Explicit barycentric weights for polynomial interpolation in the roots or extrema of classical orthogonal polynomials ⋮ Interpolation on arbitrary regions in the complex plane ⋮ Geodesic Walks in Polytopes ⋮ An interpolation-based fast-multipole accelerated boundary integral equation method for the three-dimensional wave equation ⋮ A parallel fast multipole method for elliptic difference equations ⋮ Far-field compression for fast kernel summation methods in high dimensions ⋮ Arbitrary order Krylov deferred correction methods for differential algebraic equations ⋮ Another preprocessing algorithm for generalized one-dimensional fast multipole method ⋮ An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem ⋮ Fast multipole methods for approximating a function from sampling values ⋮ Fast and scalable evaluation of pairwise potentials ⋮ Fast Expansion into Harmonics on the Disk: A Steerable Basis with Fast Radial Convolutions ⋮ A fast simple algorithm for computing the potential of charges on a line ⋮ Fast computation of the spectral differentiation by the fast multipole method ⋮ Fast spherical Fourier algorithms. ⋮ A new class of highly accurate differentiation schemes based on the prolate spheroidal wave functions ⋮ A fast algorithm for radiative transport in isotropic media ⋮ Transformations of matrix structures work again ⋮ On constructing new interpolation formulas using linear operators and an operator type of quadrature rules ⋮ The fast multipole method: Numerical implementation ⋮ On fast multipole methods for Volterra integral equations with highly oscillatory kernels ⋮ On the evaluation of layer potentials close to their sources ⋮ The EPS method: A new method for constructing pseudospectral derivative operators ⋮ A fast spherical harmonics transform algorithm ⋮ Fast multipole preconditioners for sparse matrices arising from elliptic equations ⋮ Conformal mapping in linear time ⋮ A parallel implementation of the fast multipole method for Maxwell's equations ⋮ A stable matrix version of the fast multipole method: stabilization strategies and examples ⋮ A generalized one-dimensional fast multipole method with application to filtering of spherical harmonics ⋮ The black-box fast multipole method ⋮ Semi-implicit Krylov deferred correction methods for differential algebraic equations ⋮ Fast algorithms for discrete polynomial transforms ⋮ Computational strategies for the Riemann zeta function ⋮ A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters ⋮ Fast approximate computations with Cauchy matrices and polynomials ⋮ On fast multipole methods for Fredholm integral equations of the second kind with singular and highly oscillatory kernels

This page was built for publication: Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation