科研之友
微信
新浪微博
Facebook
分享链接
摘要
Multivariate Hermite interpolation is widely applied in many fields, such as finite element construction, inverse engineering, CAD etc.. For arbitrarily given Hermite interpolation conditions, the typical method is to compute the vanishing ideal I (the set of polynomials satisfying all the homogeneous interpolation conditions are zero) and then use a complete residue system modulo I as the interpolation basis. Thus the interpolation problem can be converted into solving a linear equation system. A generic algorithm was presented in [18], which is a generalization of BM algorithm [22] and the complexity is O(r (3)) where r represents the number of the interpolation conditions. In this paper we derive a method to obtain the residue system directly from the relative position of the points and the corresponding derivative conditions (presented by lower sets) and then use fast GEPP to solve the linear system with O((tau + 3)r (2)) operations, where tau is the displacement-rank of the coefficient matrix. In the best case tau = 1 and in the worst case tau = r/n, where n is the number of variables.
- 出版日期2014-12
- 单位吉林大学
