Fast algorithms for discrete polynomial transforms on arbitrary grids (Q1874677): 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: The operational properties of the Chebyshev transform. I: General properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003151 / 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: Fast Fourier transforms for nonequispaced data. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of wavelets on a bounded interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for discrete polynomial transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on fast Fourier transforms for nonequispaced grids / 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: Fast Approximate Fourier Transforms for Irregularly Spaced Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Fast Multipole Algorithm for Potential Fields on the Line / rank
 
Normal rank

Latest revision as of 17:01, 5 June 2024

scientific article
Language Label Description Also known as
English
Fast algorithms for discrete polynomial transforms on arbitrary grids
scientific article

    Statements

    Fast algorithms for discrete polynomial transforms on arbitrary grids (English)
    0 references
    0 references
    25 May 2003
    0 references
    0 references
    discrete polynomial transform
    0 references
    Vandermonde-like matrix
    0 references
    fast cosine
    0 references
    transform
    0 references
    fast Fourier transform
    0 references
    fast polynomial transform
    0 references
    Chebyshev knots
    0 references
    nonequi-spaced
    0 references
    grids
    0 references
    \(B\)-splines
    0 references
    Gaussian bells
    0 references
    numerical examples
    0 references
    matrix-vector product
    0 references
    algorithm
    0 references