Stable computation of the Fourier transform using regularization
discrete Fourier transformFourier transformill-posed Fredholm integral equation of the first kindstabilityTikhonov regularization
Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Fredholm integral equations (45B05) Numerical methods for integral equations (65R20) Numerical methods for ill-posed problems for integral equations (65R30) Numerical methods for discrete and fast Fourier transforms (65T50)
An ill-posed Fredholm integral equation of the first kind is considered. The \(n\)-order Tikhonov regularization method is employed to increase the stability of computing the Fourier transform. The regularization parameter \(\alpha\) is selected by the residual technique. The regularization of direct and inverse, continuous and discrete, and one- and two-dimensional Fourier transforms is discussed.
- A regularization method for discrete Fourier polynomials
- Computation of two-dimensional Fourier transforms for noisy band-limited signals
- scientific article; zbMATH DE number 4133459 (Why is no real title available?)
- Computation of Fourier transforms for noisy bandlimited signals
- scientific article; zbMATH DE number 5688226 (Why is no real title available?)
This page was built for publication: Stable computation of the Fourier transform using regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569358)
