Chein-Shan Liu1, Satya N. Atluri2
CMES-Computer Modeling in Engineering & Sciences, Vol.43, No.3, pp. 253-276, 2009, DOI:10.3970/cmes.2009.043.253
Abstract Since the works of Newton and Lagrange, interpolation had been a mature technique in the numerical mathematics. Among the many interpolation methods, global or piecewise, the polynomial interpolation p(x) = a0 + a1x + ... + anxn expanded by the monomials is the simplest one, which is easy to handle mathematically. For higher accuracy, one always attempts to use a higher-order polynomial as an interpolant. But, Runge gave a counterexample, demonstrating that the polynomial interpolation problem may be ill-posed. Very high-order polynomial interpolation is very hard to realize by numerical computations. In this paper we propose a… More >