Fast algorithms for discrete polynomial transforms on arbitrary grids

DOI10.1016/S0024-3795(02)00592-XMaRDI QIDQ1874677zbMATH OpenFDO

Authors Daniel Potts

Publication date 25 May 2003

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0024-3795(02)00592-X

zbMATH Keywords

\(B\)-splinesalgorithmChebyshev knotsdiscrete polynomial transformfast cosinefast Fourier transformfast polynomial transformGaussian bellsgridsmatrix-vector productnonequi-spacednumerical examplestransformVandermonde-like matrix

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Fast algorithms for discrete polynomial transforms
• A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
• Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications
• Fast polynomial multiplication and convolutions related to the discrete cosine transform
• scientific article; zbMATH DE number 4100583

Cites work

• A note on fast Fourier transforms for nonequispaced grids
• A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
• An Improved Fast Multipole Algorithm for Potential Fields on the Line
• Computing Fourier transforms and convolutions on the 2-sphere
• Fast algorithms for discrete polynomial transforms
• Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
• Fast Approximate Fourier Transforms for Irregularly Spaced Data
• Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
• Fast Fourier Transforms for Nonequispaced Data
• Fast Fourier transforms for nonequispaced data. II
• Fast polynomial multiplication and convolutions related to the discrete cosine transform
• scientific article; zbMATH DE number 52869 (Why is no real title available?)
• On the construction of wavelets on a bounded interval
• On the fast Fourier transform of functions with singularities
• The operational properties of the Chebyshev transform. I: General properties
• The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms

Cited in

(17)

• Fast conversion algorithms for orthogonal polynomials
• Fast discrete transforms by means of eigenpolynomials
• Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications
• Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation
• A numerical study of the Legendre-Galerkin method for the evaluation of the prolate spheroidal wave functions
• Rapid ``algebraic Fourier transforms on uniformly distributed meshes
• Fast algorithms for the multi-dimensional Jacobi polynomial transform
• Fast associated classical orthogonal polynomial transforms
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
• Sparse Legendre expansions via _1-minimization
• Fast algorithms for discrete polynomial transforms
• scientific article; zbMATH DE number 1263411 (Why is no real title available?)
• Orthogonal polynomial expansions on sparse grids
• Jacobi Spectral Collocation Method for the Time Variable-Order Fractional Mobile-Immobile Advection-Dispersion Solute Transport Model
• A generalized diffusion frame for parsimonious representation of functions on data defined manifolds
• On the reconstruction of functions from values at subsampled quadrature points
• ANOVA approximation with mixed tensor product basis on scattered points

This page was built for publication: Fast algorithms for discrete polynomial transforms on arbitrary grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874677)