Fast and stable algorithms for discrete spherical Fourier transforms
- 1 May 1998
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 275-276, 433-450
- https://doi.org/10.1016/s0024-3795(97)10013-1
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Efficient stabilization methods for fast polynomial transformsPublished by Dartmouth College Library Press ,2016
- Fast polynomial multiplication and convolutions related to the discrete cosine transformLinear Algebra and its Applications, 1997
- Computing Fourier Transforms and Convolutions on the 2-SphereAdvances in Applied Mathematics, 1994
- The Vector Harmonic Transform Method for Solving Partial Differential Equations in Spherical GeometryMonthly Weather Review, 1993
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluationLinear Algebra and its Applications, 1993
- Fast radix-p discrete cosine transformApplicable Algebra in Engineering, Communication and Computing, 1992
- A Fast Algorithm for the Evaluation of Legendre ExpansionsSIAM Journal on Scientific and Statistical Computing, 1991
- A polynomial approach to fast algorithms for discrete Fourier-cosine and Fourier-sine transformsMathematics of Computation, 1991
- On the associated orthogonal polynomialsJournal of Computational and Applied Mathematics, 1990
- A Comparison of Three Numerical Methods for Solving Differential Equations on the SphereMonthly Weather Review, 1989