Fast spherical Fourier algorithms. (Q1412818): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast polynomial multiplication and convolutions related to the discrete cosine transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fast Fourier transform of functions with singularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiresolution Approach to Regularization of Singular Operators and Fast Summation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Fourier transforms and convolutions on the 2-sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Fourier Transforms for Nonequispaced Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonuniform fast fourier transforms using min-max interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4380354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for particle simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: FFTs for the 2-sphere-improvements and variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Polynomials and Hypergroups II--The Symmetric Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2737662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast transform for spherical harmonics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate factorizations of Fourier matrices with nonequispaced knots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4059363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for discrete polynomial transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and stable algorithms for discrete spherical Fourier transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast radix-\(p\) discrete cosine transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast spherical harmonics transform algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for the discrete W transform and for the discrete Fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximate Fourier Transforms for Irregularly Spaced Data / rank
 
Normal rank

Latest revision as of 12:56, 6 June 2024

scientific article
Language Label Description Also known as
English
Fast spherical Fourier algorithms.
scientific article

    Statements

    Fast spherical Fourier algorithms. (English)
    0 references
    0 references
    0 references
    25 November 2003
    0 references
    0 references
    Spherical Fourier transform
    0 references
    Spherical harmonics
    0 references
    Associated Legendre functions
    0 references
    Fast discrete transforms
    0 references
    Fast Fourier transform
    0 references
    nonequispaced knots
    0 references
    computational complexity
    0 references
    fast algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references