Mixed and componentwise condition numbers are useful in understanding stability properties of algorithms for solving structured linear systems. The DFT (discrete Fourier transform) is an essential building block of these algorithms. 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 DFTs the property of having entries with modulus equal to one.
Titolo: | Componentwise conditioning of the DFT |
Autori: | |
Data di pubblicazione: | 2002 |
Rivista: | |
Abstract: | Mixed and componentwise condition numbers are useful in understanding stability properties of algorithms for solving structured linear systems. The DFT (discrete Fourier transform) is an essential building block of these algorithms. 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 DFTs the property of having entries with modulus equal to one. |
Handle: | http://hdl.handle.net/11390/676170 |
Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
bozzomenchi.pdf | Altro materiale allegato | Non pubblico | Accesso ristretto Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.