【作者】 陈秀艳；

【导师】 韩丹夫；

【作者基本信息】 浙江大学 ， 计算数学， 2007， 硕士

【摘要】 随着多项式插值理论的日趋完善，人们发现多项式插值并不能总是很好的解决问题。对于一类有极点的函数来说，用多项式逼近的效果并不好。而采用有理分式函数来逼近，效果就好得多了。本文第一章从一般的有理插值问题的提法入手，介绍了有理插值的基本概念和一些性质。第二章介绍了一种计算一般的有理函数插值的Neville算法。以往的文章在介绍有理插值算法时，往往更多的提及用连分式来构造有理分式函数，而较少详细介绍有理插值的Neville算法(有的文献也将之称为Stoer方法)，大多只给出大概的思想。本文将具体的介绍这种算法，给出详细的推导过程。它采用一种递推的思想，在只须计算某点的有理逼近值而无需求逼近函数的情况下，这种方法尤其高效。同样，利用这种方法，能根据需要构造出不同的有理分式函数，并且每个形式的有理分式函数都是唯一存在的。本文第三章转入切触有理插值。所谓切触有理插值即要求插值函数是有理分式函数，满足在插值点的函数值及导数值均相等。传统的解决切触有理插值的问题依然是跟连分式相关，这种方法的缺点是计算量较大，而且要求插值点是适定的，因此可行性是有条件的。而本文将介绍的是一种凸组合的方法构造的切触有理插值，它格式简单，对插值条件没有要求，便于在计算机上实现。同时，本文还将这种方法推广到二元的情况，并给出数值例子。本文所做的主要工作是详细给出Neville算法的推导过程，并将凸组合方法构造的切触有理插值从一元推广到二元。更多还原

【Abstract】 So far, the theory for polynomial interpolation is nearly perfect. While we benefit from this algorithm, we still find that in certain circumstances, polynomial interpolation is not such a good choice. Instead, we can use a rational interpolation. For example, for approximation of a kind of function with one or more extremal points, rational interpolation can get better results than ordinary polynomial interpolation.In the first chapter, we give some basic concepts and theorems of the rational interpolation for better understanding of this paper. And then in the second chapter, we introduce a quasi- Neville algorithm for solving ordinary rational interpolation. We know that most articles which introduce algorithms for solving rational interpolation adopt a continued fraction approximation method, but less mention the quasi-Neville method. So in this paper, we will give a very specific deduction for this method, which is an iterated interpolation method. Comparing to the continued fraction approximation method, this quasi-Neville method is much more effective when the expression of the approximating function is unnecessary.In the third chapter of this paper, we introduce a convex combination method for solving osculatory rational interpolation problem. Here the definition for "osculatory rational interpolation" means that the approximating rational function should satisfy both values and derivatives at given points. The usual methods for solving this osculatory rational interpolation are also related to continued fraction approximation method, which needs both suitable points and a large amount of calculation. The advantages for the convex combination method are less calculation, no limits for points and convenience for realization by computer.The main work of this paper is giving a specific deduction for the quasi-Neville method and generalizing a convex combination method for solving two-variable osculatory rational interpolation problem.更多还原