Fast algorithms for discrete polynomial transforms on arbitrary grids
type: Item
instance of: scholarly article
title: Fast algorithms for discrete polynomial transforms on arbitrary grids
zbMATH Open document ID: 1026.65137
DOI: 10.1016/S0024-3795(02)00592-X
author: Daniel Potts
published in: Linear Algebra and its Applications
publication date: 2003-05-25T00:00:00Z
Mathematics Subject Classification ID: 65T50
Mathematics Subject Classification ID: 65F30
zbMATH DE Number: 1915813
zbMATH Keywords: discrete polynomial transform
zbMATH Keywords: Vandermonde-like matrix
zbMATH Keywords: fast cosine
zbMATH Keywords: transform
zbMATH Keywords: fast Fourier transform
zbMATH Keywords: fast polynomial transform
zbMATH Keywords: Chebyshev knots
zbMATH Keywords: nonequi-spaced
zbMATH Keywords: grids
zbMATH Keywords: \(B\)-splines
zbMATH Keywords: Gaussian bells
zbMATH Keywords: numerical examples
zbMATH Keywords: matrix-vector product
zbMATH Keywords: algorithm
MaRDI profile type: Publication
cites work: Fast polynomial multiplication and convolutions related to the discrete cosine transform
cites work: On the fast Fourier transform of functions with singularities
cites work: The operational properties of the Chebyshev transform. I: General properties
cites work: Q4003151
cites work: Computing Fourier transforms and convolutions on the 2-sphere
cites work: Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
cites work: Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
cites work: Fast Fourier Transforms for Nonequispaced Data
cites work: Fast Fourier transforms for nonequispaced data. II
cites work: The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms
cites work: On the construction of wavelets on a bounded interval
cites work: Fast algorithms for discrete polynomial transforms
cites work: A note on fast Fourier transforms for nonequispaced grids
cites work: A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
cites work: Fast Approximate Fourier Transforms for Irregularly Spaced Data
cites work: An Improved Fast Multipole Algorithm for Potential Fields on the Line
description: scientific article; zbMATH DE number 1915813