Fast algorithms for discrete polynomial transforms (Q4210958): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Gabriele Drauschke / rank
Normal rank
 
Property / author
 
Property / author: Gabriele Drauschke / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for the Evaluation of Legendre Expansions / rank
 
Normal rank
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 associated orthogonal polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5849046 / 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: The condition of Vandermonde-like matrices involving orthogonal polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation / 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: Q3332204 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1090/s0025-5718-98-00975-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978798278 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:55, 30 July 2024

scientific article; zbMATH DE number 1198385
Language Label Description Also known as
English
Fast algorithms for discrete polynomial transforms
scientific article; zbMATH DE number 1198385

    Statements

    Fast algorithms for discrete polynomial transforms (English)
    0 references
    0 references
    0 references
    0 references
    10 September 1998
    0 references
    discrete polynomial transform
    0 references
    Vandermonde-like matrix
    0 references
    fast cosine transform
    0 references
    fast polynomial transform
    0 references
    Chebyshev knots
    0 references
    cascade summation
    0 references
    numerical examples
    0 references
    algorithm
    0 references
    matrix-vector product
    0 references

    Identifiers