Abstract
A polynomial interpolation based on a uniform grid yields the well-known Runge phenomenon, where maximum error is unbounded for functions with complex roots in the Runge zone. In this paper, we investigate the Runge phenomenon with the finite precision operation. We first show that the maximum error is bounded because of round-off errors inherent to the finite precision operation. Then we propose a simple truncation method based on the truncated singular value decomposition. The method consists of two stages: In the first stage, a new interpolating matrix is constructed using the assumption that the function is analytic. The new interpolating matrix is preconditioned using the statistical filter method. In the second stage, a truncation procedure is applied such that singular values of the new interpolating matrix are truncated if they are equal to or lower than a certain tolerance level. We generalize the method, by analyzing the singular vectors of both the original and new interpolation matrices based on the assumption in the first stage. We show that the structure of the singular vectors makes the first stage essential for an accurate reconstruction of the original function. Numerical examples show that exponential decay of the error can be achieved if an appropriate truncation is chosen.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boyd, J.P., Ong, J.R.: Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions, Part I: Single-interval schemes. Commun. Comput. Phys. 5, 484–497 (2009)
Boyd, J.P., Xu, F.: Divergence (Runge Phenomenon) for least-squares polynomial approximation on an equispaced grid. Appl. Math. Comput. 210, 158–168 (2009)
Epperson, J.F.: On the Runge example. Am. Math. Mon. 94, 329–341 (1987)
Gelb, A., Platte, R.B., Rosenthal, W.S.: The discrete orthogonal polynomial least squares methods for approximation and solving partial differential equations. Commun. Comput. Phys. 3, 734–758 (2008)
Hansen, P.C.: Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion. SIAM, Philadelphia (1998)
Jung, J.-H., Shizgal, B.D.: Generalization of the inverse polynomial reconstruction method in the resolution of the Gibbs phenomena. J. Comput. Appl. Math. 172, 131–151 (2004)
Jung, J.-H., Shizgal, B.D.: On the numerical convergence with the inverse polynomial reconstruction method for the resolution of the Gibbs phenomenon. J. Comput. Phys. 224, 477–488 (2007)
Kuijlaars, A.B.J., Rakhmanov, E.A.: Zero distributions for discrete orthogonal polynomials. J. Comput. Appl. Math. 99, 255–274 (1998)
Platte, R.B., Driscoll, T.A.: Polynomials and potential theory for Gaussian radial basis function interpolation. SIAM J. Numer. Anal. 43, 750–766 (2005)
Rakhmanov, E.A.: Bounds for polynomials with a unit discrete norm. Ann. Math. 165, 55–88 (2006)
Shizgal, B.D., Jung, J.-H.: Towards the Gibbs phenomena. J. Comput. Appl. Math. 161, 41–65 (2003)
Solomonoff, A.: Reconstruction of a discontinuous function from a few Fourier coefficients using Bayesian estimation. J. Sci. Comput. 10, 29–80 (1995)
Vogel, C.R.: Computational Methods for Inverse Problems. SIAM, Philadelphia (2002)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jung, JH., Stefan, W. A Simple Regularization of the Polynomial Interpolation for the Resolution of the Runge Phenomenon. J Sci Comput 46, 225–242 (2011). https://doi.org/10.1007/s10915-010-9397-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10915-010-9397-7