A simple regularization of the polynomial interpolation for the resolution of the Runge phenomenon
DOI10.1007/s10915-010-9397-7zbMath1225.65017OpenAlexW1984104787MaRDI QIDQ639401
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
regularizationnumerical examplessingular value decompositionpreconditioningpseudo-inverseill-posed problemsexponential convergencetruncation methodpolynomial interpolationRunge phenomenonfinite precisionstatistical filter method
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10) Preconditioners for iterative methods (65F08)
Related Items (3)
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
This page was built for publication: A simple regularization of the polynomial interpolation for the resolution of the Runge phenomenon
