AbstractRunge showed that polynomial interpolation using an equispaced grid often diverges as the degree N of the interpolating polynomial fX increases, even when f(x) is analytic over the whole interval. We suppress Runge divergence by defining the approximating polynomial as the minimizer of the sum of the interpolation residual plus a constant - times a smoothness norm. The Tikhonov parameter - can be determined easily through the method of the L-shaped curve. The resulting “Tikhonov approximant” is at least as accurate as the truncated, Nth degree Chebyshev series for the same function
AbstractApproximating a function from its values f(xi) at a set of evenly spaced points xi through (...
In this paper we develop an adaptive algorithm for determining the optimal degree of regression in t...
AbstractSeven types of Chebyshev-like grids in one dimension are compared according to four differen...
AbstractRunge showed that polynomial interpolation using an equispaced grid often diverges as the de...
AbstractSome new properties of the Lebesgue function associated with interpolation at the Chebyshev ...
The algebraic polynomial interpolation on uniformly distributed nodes is affected by the Runge pheno...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
AbstractWe present two results that quantify the poor behavior of polynomial interpolation in n equa...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
Polynomial interpolation is an essential subject in numerical analysis. Dealing with a real interval...
AbstractApproximating a function from its values f(xi) at a set of evenly spaced points xi through (...
In this paper we develop an adaptive algorithm for determining the optimal degree of regression in t...
AbstractSeven types of Chebyshev-like grids in one dimension are compared according to four differen...
AbstractRunge showed that polynomial interpolation using an equispaced grid often diverges as the de...
AbstractSome new properties of the Lebesgue function associated with interpolation at the Chebyshev ...
The algebraic polynomial interpolation on uniformly distributed nodes is affected by the Runge pheno...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
AbstractWe present two results that quantify the poor behavior of polynomial interpolation in n equa...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
The algebraic polynomial interpolation on n+1 uniformly distributed nodes can be affected by the Run...
Polynomial interpolation is an essential subject in numerical analysis. Dealing with a real interval...
AbstractApproximating a function from its values f(xi) at a set of evenly spaced points xi through (...
In this paper we develop an adaptive algorithm for determining the optimal degree of regression in t...
AbstractSeven types of Chebyshev-like grids in one dimension are compared according to four differen...