In: Journal of Computational and Applied Mathematics, 2004, vol. 164-165, p. 81
Classical rational interpolation is known to suffer from several drawbacks, such as unattainable points and randomly located poles for a small number of nodes, as well as an erratic behavior of the error as this number grows larger. In a former article, we have suggested to obtain rational interpolants by a procedure that attaches optimally placed poles to the interpolating polynomial, using the...
|
In: Journal of Computational Physics, 2005, vol. 204, p. 292-301
Due to their rapid – often exponential – convergence as the number N of interpolation/collocation points is increased, polynomial pseudospectral methods are very efficient in solving smooth boundary value problems. However, when the solution displays boundary layers and/or interior fronts, this fast convergence will merely occur with very large N. To address this difficulty, we present a...
|
