摘要
Ideal interpolation is a generalization of the univariate Hermite interpolation. It is well known that every univariate Hermite interpolant is a pointwise limit of some Lagrange interpolants.However, a counterexample provided by Shekhtman Boris shows that, for more than two variables,there exist ideal interpolants that are not the limit of any Lagrange interpolants. So it is natural to consider: Given an ideal interpolant, how to find a sequence of Lagrange interpolants(if any) that converge to it. The authors call this problem the discretization for ideal interpolation. This paper presents an algorithm to solve the discretization problem. If the algorithm returns "True", the authors get a set of pairwise distinct points such that the corresponding Lagrange interpolants converge to the given ideal interpolant.
Ideal interpolation is a generalization of the univariate Hermite interpolation. It is well known that every univariate Hermite interpolant is a pointwise limit of some Lagrange interpolants. However, a counterexample provided by Shekhtman Boris shows that, for more than two variables, there exist ideal interpolants that are not the limit of any Lagrange interpolants. So it is natural to consider： Given an ideal interpolant, how to find a sequence of Lagrange interpolants （if any） that converge to it. The authors call this problem the discretization for ideal interpolation. This paper presents an algorithm to solve the discretization problem. If the algorithm returns ＂True＂, the authors get a set of pairwise distinct points such that the corresponding Lagrange interpolants converge to the given ideal interpolant.
基金
supported by the National Natural Science Foundation of China under Grant Nos.11171133 and 11326209
