A simple regularization of the polynomial interpolation for the resolution of the Runge phenomenon

DOI10.1007/s10915-010-9397-7zbMath1225.65017MaRDI QIDQ639401

Jae-Hun Jung, Wolfgang Stefan

Publication date: 20 September 2011

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-010-9397-7

zbMATH Keywords

regularization; numerical examples; singular value decomposition; preconditioning; pseudo-inverse; ill-posed problems; exponential convergence; truncation method; polynomial interpolation; Runge phenomenon; finite precision; statistical filter method

Mathematics Subject Classification ID

65F20: Numerical solutions to overdetermined systems, pseudoinverses

65D05: Numerical interpolation

41A05: Interpolation in approximation theory

41A10: Approximation by polynomials

65F08: Preconditioners for iterative methods

Related Items

Least Squares Approximation of Polynomial Chaos Expansions With Optimized Grid Points, Reusing Chebyshev points for polynomial interpolation, A Hybrid Method for the Resolution of the Gibbs Phenomenon

Uses Software

• Regularization tools
• UTV

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds for polynomials with a unit discrete norm
• On the numerical convergence with the inverse polynomial reconstruction method for the resolution of the Gibbs phenomenon
• Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation
• Zero distributions for discrete orthogonal polynomials
• Towards the resolution of the Gibbs phenomena.
• 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
• On the Runge Example
• Computational Methods for Inverse Problems
• Polynomials and Potential Theory for Gaussian Radial Basis Function Interpolation