Generalized sampling and the stable and accurate reconstruction of piecewise analytic functions from their Fourier coefficients

Suppose that the first m Fourier coefficients of a piecewise analytic function are given. Direct expansion in a Fourier series suffers from the Gibbs phenomenon and lacks uniform convergence. Nonetheless, in this paper we show that, under very broad conditions, it is always possible to recover an n-term expansion in a different system of functions using only these coefficients. Such an expansion can be made arbitrarily close to the best possible n-term expansion in the given system. Thus, if a piecewise polynomial basis is employed, for example, exponential convergence can be restored. The resulting method is linear, numerically stable and can be implemented efficiently in only O (nm) operations. A key issue is how the parameter m must scale in comparison to n to ensure such recovery. We derive analytical estimates for this scaling for large classes of polynomial and piecewise polynomial bases. In particular, we show that in many important cases, including the case of piecewise Chebyshev polynomials, this scaling is quadratic: m = O ( n ) . Therefore, with a system of polynomials that the user is essentially free to choose, one can restore exponential accuracy in n and root-exponential accuracy in m. This generalizes a result proved recently for piecewise Legendre polynomials.

[1]  Eitan Tadmor,et al.  Adaptive Mollifiers for High Resolution Recovery of Piecewise Smooth Data from its Spectral Information , 2001, Found. Comput. Math..

[2]  P. Borwein,et al.  Polynomials and Polynomial Inequalities , 1995 .

[3]  Knut S. Eckhoff Accurate reconstructions of functions of finite regularity from truncated Fourier series expansions , 1995 .

[4]  R. A. Hunt,et al.  Weighted norm inequalities for the conjugate function and Hilbert transform , 1973 .

[5]  W. Van Assche,et al.  The Riemann-Hilbert approach to strong asymptotics for orthogonal polynomials on [-1,1] , 2001 .

[6]  Anne Gelb,et al.  The Resolution of the Gibbs Phenomenon for Fourier Spectral Methods , 2006 .

[7]  Jie Shen,et al.  Generalized Jacobi polynomials/functions and their applications , 2009 .

[8]  Ben Adcock,et al.  Generalized Sampling and Infinite-Dimensional Compressed Sensing , 2016, Found. Comput. Math..

[9]  Anders C. Hansen,et al.  On the approximation of spectra of linear operators on Hilbert spaces , 2008 .

[10]  T. A. Zang,et al.  Spectral Methods: Fundamentals in Single Domains , 2010 .

[11]  Rick Archibald,et al.  A method to reduce the Gibbs ringing artifact in MRI scans while keeping tissue boundary integrity , 2002, IEEE Transactions on Medical Imaging.

[12]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[13]  Ben Adcock,et al.  Generalized sampling: extension to frames and inverse and ill-posed problems , 2013 .

[14]  Giovanni Monegato,et al.  Orthogonal polynomials and numerical methods , 1992 .

[15]  Dmitry Batenkov,et al.  Algebraic Fourier reconstruction of piecewise smooth functions , 2010, Math. Comput..

[16]  Shengtai Li,et al.  Application of Gegenbauer polynomial expansions to mitigate Gibbs phenomenon in Fourier–Bessel series solutions of a dynamic sphere problem , 2009 .

[17]  Tobin A. Driscoll,et al.  A Padé-based algorithm for overcoming the Gibbs phenomenon , 2004, Numerical Algorithms.

[18]  John P. Boyd,et al.  Acceleration of algebraically-converging Fourier series when the coefficients have series in powers of 1/n , 2009, J. Comput. Phys..

[19]  Wai-Shing Tang,et al.  Oblique projections, biorthogonal Riesz bases and multiwavelets in Hilbert spaces , 1999 .

[20]  Ivan G. Graham,et al.  Stability and error estimates for Filon–Clenshaw–Curtis rules for highly oscillatory integrals , 2011 .

[21]  Anders C. Hansen,et al.  On the Solvability Complexity Index, the n-pseudospectrum and approximations of spectra of operators , 2011 .

[22]  Chi-Wang Shu,et al.  On the Gibbs phenomenon IV: recovering exponential accuracy in a subinterval from a Gegenbauer partial sum of a piecewise analytic function , 1994 .

[23]  Jae-Hun Jung,et al.  Towards the resolution of the Gibbs phenomena , 2003 .

[24]  Chi-Wang Shu,et al.  On the Gibbs Phenomenon and Its Resolution , 1997, SIAM Rev..

[25]  Alex Solomonoff,et al.  On the Gibbs phenomenon I: recovering exponential accuracy from the Fourier partial sum of a nonperiodic analytic function , 1992 .

[26]  Karlheinz Gröchenig,et al.  Pseudospectral Fourier reconstruction with the modified Inverse Polynomial Reconstruction Method , 2010, J. Comput. Phys..

[27]  Ben Adcock,et al.  Stable reconstructions in Hilbert spaces and the resolution of the Gibbs phenomenon , 2010, 1011.6625.

[28]  Claude Brezinski,et al.  Extrapolation Algorithms for Filtering Series of Functions, and Treating the Gibbs Phenomenon , 2004, Numerical Algorithms.

[29]  John P. Boyd,et al.  Trouble with Gegenbauer reconstruction for defeating Gibbs' phenomenon: Runge phenomenon in the diagonal limit of Gegenbauer polynomial approximations , 2005 .

[30]  Knut S. Eckhoff Accurate and efficient reconstruction of discontinuous functions from truncated series expansions , 1993 .

[31]  Chi-Wang Shu,et al.  On the Gibbs phenomenon III: recovering exponential accuracy in a sub-interval from a spectral partial sum of a piecewise analytic function , 1996 .

[32]  D. Gottlieb,et al.  Spectral methods for hyperbolic problems , 2001 .

[33]  J. Preston Ξ-filters , 1983 .

[34]  B. Adcock Gibbs phenomenon and its removal for a class of orthogonal expansions , 2011 .

[35]  Kewei Chen,et al.  Improving tissue segmentation of human brain MRI through preprocessing by the Gegenbauer reconstruction method , 2003, NeuroImage.

[36]  Dmitry Batenkov,et al.  Complete algebraic reconstruction of piecewise-smooth functions from Fourier data , 2012, Math. Comput..

[37]  Ben Adcock,et al.  A Generalized Sampling Theorem for Stable Reconstructions in Arbitrary Bases , 2010, 1007.1852.

[38]  O. Christensen An introduction to frames and Riesz bases , 2002 .

[39]  Daniel B. Szyld,et al.  The many proofs of an identity on the norm of oblique projections , 2006, Numerical Algorithms.

[40]  Anne Gelb,et al.  Robust reprojection methods for the resolution of the Gibbs phenomenon , 2006 .

[41]  Gabor Szegö,et al.  A problem in prediction theory , 1960 .

[42]  J. Steinberg Oblique projections in Hilbert spaces , 2000 .

[43]  J. N. Lyness Computational Techniques Based on the Lanczos Representation , 1974 .

[44]  Ben Adcock,et al.  A Stability Barrier for Reconstructions from Fourier Samples , 2012, SIAM J. Numer. Anal..

[45]  Ben Adcock,et al.  Beyond Consistent Reconstructions: Optimality and Sharp Bounds for Generalized Sampling, and Application to the Uniform Resampling Problem , 2013, SIAM J. Math. Anal..

[46]  Eitan Tadmor,et al.  Filters, mollifiers and the computation of the Gibbs phenomenon , 2007, Acta Numerica.

[47]  Anne Gelb,et al.  Detection of Edges in Spectral Data , 1999 .

[48]  J. Garnett,et al.  Bounded Analytic Functions , 2006 .

[49]  Jan S. Hesthaven,et al.  Spectral Methods for Time-Dependent Problems: Contents , 2007 .

[50]  Ben Adcock,et al.  Convergence acceleration of modified Fourier series in one or more dimensions , 2010, Math. Comput..

[51]  Jie Shen,et al.  Optimal Spectral-Galerkin Methods Using Generalized Jacobi Polynomials , 2006, J. Sci. Comput..

[52]  Anne Gelb,et al.  The resolution of the Gibbs phenomenon for spherical harmonics , 1997, Math. Comput..

[53]  Ana C. Matos,et al.  How well does the Hermite-Padé approximation smooth the Gibbs phenomenon? , 2011, Math. Comput..

[54]  Irene A. Stegun,et al.  Handbook of Mathematical Functions. , 1966 .

[55]  Lloyd N. Trefethen,et al.  Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples , 2011, SIAM Rev..

[56]  M. N. Spijker,et al.  Bounding partial sums of Fourier series in weighted L 2 -norms, with applications to matrix analysis , 2002 .

[57]  Knut S. Eckhoff On a high order numerical method for functions with singularities , 1998, Math. Comput..

[58]  Jae-Hun Jung,et al.  Generalization of the inverse polynomial reconstruction method in the resolution of the Gibbs phenomenon , 2004 .