Fast discrete transforms by means of eigenpolynomials (Q1311982): Difference between revisions
From MaRDI portal
Latest revision as of 12:30, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast discrete transforms by means of eigenpolynomials |
scientific article |
Statements
Fast discrete transforms by means of eigenpolynomials (English)
0 references
29 June 1994
0 references
The linear transform \(\mathbb{C}^ N \to \mathbb{C}^ N\), \(u\mapsto Au\) is equivalent with the computation of the coefficients of the polynomial \(\sum^{n-1}_{j=0} u_ ja_ j(z)\), where \(a_ j\) denotes the eigenpolynomial \(a_ j(z):=\sum^{n-1}_{i=0} a_{ij} z^ i\) associated with the \(j\)-th column of \(A\). For the matrices \(A\) defining the discrete Fourier transform, discrete Hartley transform, discrete sine transform, and discrete cosine transform the authors determine the zeros of the eigenpolynomials and use this information for the construction of known and new fast algorithms for the above transforms.
0 references
discrete Fourier transform
0 references
discrete Hartley transform
0 references
discrete sine transform
0 references
discrete cosine transform
0 references
eigenpolynomials
0 references
fast algorithms
0 references