Year: 1986
Author: Ming-Gen Cui, Mian Zhang, Zhong-Xing Deng
Journal of Computational Mathematics, Vol. 4 (1986), Iss. 2 : pp. 177–181
Abstract
One-dimensional polynomial interpolation does not guarantee the convergency and the stability during numerical computation. For two (or multi)-dimensional interpolation, difficulties are much more raising. There are many fundamental problems, which are left open.
In this paper,we begin with the discussion of reproducing kernel in two variables. With its help we deduce a two-dimensional interpolation formula. According to this formula, the process of interpolation will converge uniformly, whenever the knot system is thickened in finitely. We have also proven that the error function will decrease monotonically in the norm when the number of knot points is increased.
In our formula, knot points may be chosen arbitrarily without any request of regularity about their arrangement. We also do not impose any restriction on the number of knot points. For the case of multi-dimensional interpolation, these features may be important and essential.
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/1986-JCM-9579
Journal of Computational Mathematics, Vol. 4 (1986), Iss. 2 : pp. 177–181
Published online: 1986-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 5