On the quality of algorithms based on spline interpolation

被引:1
|
作者
Brass, H [1 ]
机构
[1] TECH UNIV CAROLO WILHELMINA BRAUNSCHWEIG,INST ANGEW MATH,D-38106 BRAUNSCHWEIG,GERMANY
关键词
spline interpolation; optimal algorithm; information based complexity; Euler-Frobenius polynomials;
D O I
10.1007/BF02207693
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The quality q of a numerical algorithm using some specified information is the ratio of its error to the smallest possible error of an algorithm based on the same information. We use as information function values al equidistant points, periodicity and a Sound for the rth derivative. We show that q is rather small, ii the algorithm is based on spline interpolation.
引用
收藏
页码:159 / 177
页数:19
相关论文
共 50 条