龙格现象难题破解之系数与阶次双确定方法  

Solving the problem of Runge phenomenon by coefficients-and-order-determination method

作　　者：张雨浓[1] 李名鸣[1] 陈锦浩[1] 劳稳超[1] 吴华荣[1] 

机构地区：[1]中山大学信息科学与技术学院,广州510006

出　　处：《计算机工程与应用》2013年第3期44-49,共6页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61075121;No.60935001)

摘　　要：龙格现象指出,使用基于等距节点的高阶插值多项式逼近龙格函数时,插值多项式在逼近区间两端会产生明显的振荡现象。因此,传统认为,不适宜用基于等距节点的高阶多项式逼近龙格函数。针对龙格现象,展示一种新型的多项式系数与阶次双确定方法。该方法可快速构造出基于等距节点的不会振荡且有较高逼近精度的高阶多项式,良好地逼近龙格函数。计算机数值实验表明该方法是有效的,即运用基于等距节点的高阶多项式可以很好地消解龙格现象。The Runge phenomenon demonstrates that it is not suitable to use high-order interpolation polynomials with equidistant nodes to approximate the Runge function, as oscillation occurs near the ends of the interpolation interval. Nevertheless, this paper presents an innovative method called Coefficients-And-Order-Determination（CAOD）method to solve the problem of the Runge phenomenon. This method can efficiently determine the coefficients and the order of the optimal polynomial that approximates the target function. By such a CAOD method, high-order optimal polynomials are constructed for different numbers of equidistant nodes, which all approximate the Runge function without causing oscillation. Thus, such constructed optimal polynomials can achieve high approximation accuracy（i.e., eliminate the Runge phenomenon）. Numerical experiment results further substantiate the efficacy and accuracy of the CAOD method.

关 键 词：龙格现象 函数逼近 等距节点 高阶多项式 系数与阶次双确定方法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]