三次样条的全程和局部数据归约策略

Global and local data reduction strategy of cubic spline

现已开发出多种全程和局部算法，用于减少在给定的平均偏差内的近似三次样条函数的结点数。全程算法导出一个求最少结点数的好方法，而局部算法既节省运算时间又可获得满意的结果．

In order to reduce nodes of the approximate cubic spline function in the given average deviatton, lot of global and local algorithms have been developed. The global algorithm deduces a good methed for producing the least number of nodes, and the local algorithm can both save caculation time and achieve satisfactory result.