Numerical stability of fast cosine transforms

DOI10.1080/01630560008816938zbMATH Open0953.65102OpenAlexW1994664008MaRDI QIDQ4484795FDOQ4484795

Authors:

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

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

zbMATH Keywords

numerical examplesnumerical stabilityfast Fourier transformmatrix factorizationsfast algorithmsdiscrete cosine transforms

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of function spaces
• Theory of function spaces II
• Title not available (Why is that?)
• Regular Elliptic Boundary Value Problems in Besov‐Triebel‐Lizorkin Spaces
• Entropy Numbers in Weighted Function Spaces and Eigenvalue Distributions of Some Degenerate Pseudodifferential Operators I
• Fractals and Spectra

Cited In (5)

• Roundoff error analysis of fast DCT algorithms in fixed point arithmetic
• Fast and numerically stable algorithms for discrete cosine transforms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)