Pseudospectral Fourier reconstruction with the modified inverse polynomial reconstruction method

DOI10.1016/j.jcp.2009.10.026zbMath1184.65123MaRDI QIDQ2655682

Tomasz Hrycak, Karlheinz Gröchening

Publication date: 25 January 2010

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2009.10.026

zbMATH Keywords

numerical examples; condition number; convergence rate; numerical stability; Gibbs phenomenon; Legendre polynomial; inverse polynomial reconstruction method; pseudospectral Fourier reconstruction; rectangular least squares problem

Mathematics Subject Classification ID

65D10: Numerical smoothing, curve fitting

65F20: Numerical solutions to overdetermined systems, pseudoinverses

42C10: Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.)

65T40: Numerical methods for trigonometric approximation and interpolation

Related Items

Stable reconstructions in Hilbert spaces and the resolution of the Gibbs phenomenon, A generalized sampling theorem for stable reconstructions in arbitrary bases, A Hybrid Method for the Resolution of the Gibbs Phenomenon, Algebraic Fourier reconstruction of piecewise smooth functions

Uses Software

• LSQR
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Robust reprojection methods for the resolution of the Gibbs phenomenon
• On the numerical convergence with the inverse polynomial reconstruction method for the resolution of the Gibbs phenomenon
• Towards the resolution of the Gibbs phenomena.
• A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
• Generalization of the inverse polynomial reconstruction method in the resolution of the Gibbs phenomenon
• Reconstruction of a discontinuous function from a few Fourier coefficients using Bayesian estimation
• Inverse polynomial reconstruction of two dimensional Fourier images
• Optimal filter and mollifier for piecewise smooth spectral data
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• On the Gibbs Phenomenon and Its Resolution
• Filters, mollifiers and the computation of the Gibbs phenomenon
• A Padé-based algorithm for overcoming the Gibbs phenomenon
• Rational Chebyshev spectral methods for unbounded solutions on an infinite interval using polynomial-growth special basis functions