Fast and stable algorithms for discrete spherical Fourier transforms
type: Item
instance of: scholarly article
title: Fast and stable algorithms for discrete spherical Fourier transforms
zbMATH Open document ID: 0935.65147
DOI: 10.1016/S0024-3795(97)10013-1
author: Daniel Potts
author: Manfred Tasche
author: Gabriele Steidl
published in: Linear Algebra and its Applications
publication date: 2000-05-09T00:00:00Z
Mathematics Subject Classification ID: 65T40
Mathematics Subject Classification ID: 33C55
Mathematics Subject Classification ID: 65T50
Mathematics Subject Classification ID: 42C10
zbMATH DE Number: 1354724
zbMATH Keywords: spherical Fourier transform
zbMATH Keywords: spherical harmonics
zbMATH Keywords: sampling theorem
zbMATH Keywords: fast Legendre function transform
zbMATH Keywords: fast cosine transform
zbMATH Keywords: Chebyshev nodes
zbMATH Keywords: cascade summation
zbMATH Keywords: algorithm
MaRDI profile type: Publication
cites work: Q5451962
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: A Fast Algorithm for the Evaluation of Legendre Expansions
cites work: Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation
cites work: Fast radix-\(p\) discrete cosine transform
cites work: Fast polynomial multiplication and convolutions related to the discrete cosine transform
cites work: A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
cites work: On the associated orthogonal polynomials
cites work: Q5849046
description: scientific article; zbMATH DE number 1354724