Exponentially-Convergent Strategies for Defeating the Runge Phenomenon for the Approximation of Non-Periodic Functions, Part I: Single-Interval Schemes
Year: 2009
Communications in Computational Physics, Vol. 5 (2009), Iss. 2-4 : pp. 484–497
Abstract
Approximating a function from its values f(xi) at a set of evenly spaced points xi through (N+1)-point polynomial interpolation often fails because of divergence near the endpoints, the "Runge Phenomenon". Here we briefly describe seven strategies, each employing a single polynomial over the entire interval, to wholly or partially defeat the Runge Phenomenon such that the error decreases exponentially fast with N. Each is successful in obtaining high accuracy for Runge's original example. Unfortunately, each of these single-interval strategies also has liabilities including, depending on the method, various permutations of inefficiency, ill-conditioning and a lack of theory. Even so, the Fourier Extension and Gaussian RBF methods are worthy of further development.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2009-CiCP-7745
Communications in Computational Physics, Vol. 5 (2009), Iss. 2-4 : pp. 484–497
Published online: 2009-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 14