Mixed and componentwise condition numbers are useful in order to understand stability properties of algorithms for solving structured linear systems. The DFT (discrete Fourier transform) is an essential building block of these algoritms. We obtain estimates of mixed and componentwise condition numbers of the DFT. To this end, we explicitly compute certain special vectors that share with their DFT the property of having entries with modulus equal to one.
Componentwise Conditioning of the DFT
MENCHI, ORNELLA
2002-01-01
Abstract
Mixed and componentwise condition numbers are useful in order to understand stability properties of algorithms for solving structured linear systems. The DFT (discrete Fourier transform) is an essential building block of these algoritms. We obtain estimates of mixed and componentwise condition numbers of the DFT. To this end, we explicitly compute certain special vectors that share with their DFT the property of having entries with modulus equal to one.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
