Numerical stability of fast cosine transforms

DOI10.1080/01630560008816938MaRDI QIDQ4484795zbMATH OpenOpenAlexFDO

Authors Günter Baszenski, Ulrich Schreiber, Manfred Tasche

Publication date 4 June 2000

Published in Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01630560008816938

zbMATH Keywords

discrete cosine transformsfast algorithmsfast Fourier transformmatrix factorizationsnumerical examplesnumerical stability

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical methods for discrete and fast Fourier transforms (65T50)

Review text

The authors prove that various fast algorithms for discrete cosine transforms (DCT) of type II and III differ by their numerical stability. In particular, a complex DCT algorithm based on the fast Fourier transform has a better numerical stability than a faster DCT algorithm which uses only real arithmetic. The proofs make use of appropriate matrix factorizations. Numerical test confirm the theoretical expectations.

Recommendations

• Fast and numerically stable algorithms for discrete cosine transforms
• Fast algorithms for computing the discrete cosine transform
• Fast algorithms for the discrete cosine transform
• scientific article; zbMATH DE number 2141510
• Fast algorithms for the discrete cosine transformation

Cites work

• Entropy Numbers in Weighted Function Spaces and Eigenvalue Distributions of Some Degenerate Pseudodifferential Operators I
• Fractals and Spectra
• scientific article; zbMATH DE number 3602126 (Why is no real title available?)
• scientific article; zbMATH DE number 929821 (Why is no real title available?)
• scientific article; zbMATH DE number 962825 (Why is no real title available?)
• Regular Elliptic Boundary Value Problems in Besov‐Triebel‐Lizorkin Spaces
• Theory of function spaces
• Theory of function spaces II

Cited in

(5)

• Fast and numerically stable algorithms for discrete cosine transforms
• Roundoff error analysis of fast DCT algorithms in fixed point arithmetic
• scientific article; zbMATH DE number 2127851 (Why is no real title available?)
• scientific article; zbMATH DE number 770270 (Why is no real title available?)
• scientific article; zbMATH DE number 1421270 (Why is no real title available?)

This page was built for publication: Numerical stability of fast cosine transforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484795)