The Discrete Fourier Transform

Robert M. Corless and Nicolas Fillion
Additional contact information
Robert M. Corless: University of Western Ontario, Applied Mathematics
Nicolas Fillion: University of Western Ontario, Applied Mathematics

Chapter Chapter 9 in A Graduate Introduction to Numerical Methods, 2013, pp 403-418 from Springer

Abstract: Abstract This short chapter introduces the discrete (finite) and fast Fourier transform. The numerical stability and conditioning of the Fourier matrix is mentioned. Applications using convolution and circulant matrices are considered, as is the periodogram or power spectral density. ◃

Keywords: Discrete Fourier Transform; Nyquist Frequency; Convolution Product; Monomial Basis; Circulant Matrix (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-8453-0_9

Ordering information: This item can be ordered from
http://www.springer.com/9781461484530

DOI: 10.1007/978-1-4614-8453-0_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().