Fast and numerically stable algorithms for discrete cosine transforms
type: Item
instance of: scholarly article
title: Fast and numerically stable algorithms for discrete cosine transforms
zbMATH Open document ID: 1072.65171
author: Manfred Tasche
author: Gerlind Plonka
published in: Linear Algebra and its Applications
publication date: 2005-02-23T00:00:00Z
review text: The authors deal with fast cosine transform algorithms from the stability point of view. Their algorithm is based on a factorization of cosine matrices into sparse, almost orthogonal matrices. This is the due to achieve a better numerical stability than previous fast cosine transforms without orthogonal factors.
Mathematics Subject Classification ID: 65T50
Mathematics Subject Classification ID: 65G50
Mathematics Subject Classification ID: 15A23
zbMATH DE Number: 2137786
zbMATH Keywords: fast discrete cosine transform
zbMATH Keywords: numerical stability, factorization of DCT matrices into sparse matrices
zbMATH Keywords: algorithm
Wikidata QID: Q55970224
reviewed by: Gabriele Steidl
describes a project that uses: mctoolbox
MaRDI profile type: Publication
full work available at URL: j.laa.2004.07.015
OpenAlex ID: W1996819670
cites work: Discrete Cosine Transform
cites work: Numerical stability of fast cosine transforms
cites work: A unified discrete cosine and discrete sine transform computation
cites work: A Fast Computational Algorithm for the Discrete Cosine Transform
cites work: Factoring wavelet transforms into lifting steps
cites work: Fast algorithms for the discrete cosine transform
cites work: Gauss and the history of the fast Fourier transform
cites work: Q4864704
cites work: A new algorithm to compute the discrete cosine Transform
cites work: The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
cites work: Q3998717
cites work: Fast radix-\(p\) discrete cosine transform
cites work: A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
cites work: The Discrete Cosine Transform
cites work: Roundoff error analysis for fast trigonometric transforms
cites work: Q4003887
cites work: Fast algorithms for the discrete W transform and for the discrete Fourier transform
cites work: On computing the discrete Fourier and cosine transforms
cites work: Q5477699
DOI: 10.1016/J.LAA.2004.07.015
description: scientific article; zbMATH DE number 2137786