Numerical stability of fast cosine transforms

DOI10.1080/01630560008816938zbMath0953.65102OpenAlexW1994664008MaRDI QIDQ4484795

No author found.

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

numerical examplesfast algorithmsfast Fourier transformnumerical stabilitymatrix factorizationsdiscrete cosine transforms

Mathematics Subject Classification ID

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

Related Items (1)

Fast and numerically stable algorithms for discrete cosine transforms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of function spaces
• Theory of function spaces II
• Fractals and Spectra
• Entropy Numbers in Weighted Function Spaces and Eigenvalue Distributions of Some Degenerate Pseudodifferential Operators I
• Regular Elliptic Boundary Value Problems in Besov‐Triebel‐Lizorkin Spaces

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