Numerical stability of fast cosine transforms (Q4484795)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1454659
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Numerical stability of fast cosine transforms |
scientific article; zbMATH DE number 1454659 |
Statements
Numerical stability of fast cosine transforms (English)
0 references
4 June 2000
0 references
numerical examples
0 references
fast algorithms
0 references
discrete cosine transforms
0 references
numerical stability
0 references
fast Fourier transform
0 references
matrix factorizations
0 references
0.9326077699661256
0 references
0.9154839515686036
0 references
0.8351926803588867
0 references
0.8267375230789185
0 references
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.
0 references
