Abstract
In this paper we provide a reconstruction algorithm for piecewise-smooth functions with a priori known smoothness and a number of discontinuities, from their Fourier coefficients, possessing the maximal possible asymptotic rate of convergence-including the positions of the discontinuities and the pointwise values of the function. This algorithm is a modification of our earlier method, which is in turn based on the algebraic method of K. Eckhoff proposed in the 1990s. The key ingredient of the new algorithm is to use a different set of Eckhoff's equations for reconstructing the location of each discontinuity. Instead of consecutive Fourier samples, we propose to use a "decimated" set which is evenly spread throughout the spectrum.
Original language | English |
---|---|
Article number | PII S 0025-5718(2015)02948-2 |
Pages (from-to) | 2329-2350 |
Number of pages | 22 |
Journal | Mathematics of Computation |
Volume | 84 |
Issue number | 295 |
DOIs | |
State | Published - Sep 2015 |
Keywords
- Eckhoff's conjecture
- Eckhoff's method
- Fourier inversion
- Gibbs phenomenon
- Nonlinear approximation
- Piecewise-smooth functions
All Science Journal Classification (ASJC) codes
- Algebra and Number Theory
- Computational Mathematics
- Applied Mathematics