Fast and numerically stable algorithms for discrete cosine transforms
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.
numerical stability, factorization of DCT matrices into sparse matrices
scientific article; zbMATH DE number 2137786
scientific article