摘要
基于一元三次B样条函数插值,给出了一种求解一维搜索问题的新算法和数值实验结果。结果表明,新算法能很快地求出全局最优解,且剖分数越大,精度越高。
Based on univariate cubic B-spline interpolation, a new algorithm to solve one dimensional search problem and the numerical results are presented in this paper. The results show that the new algorithm presented in the paper can get the optimum solution. The more the number of partition is, the higher the accuracy is.
出处
《浙江科技学院学报》
CAS
2008年第1期1-3,共3页
Journal of Zhejiang University of Science and Technology
基金
广西民族大学研究生教育创新基金资助项目(GXUN-CHX0756)
关键词
一维搜索
三次B样条
插值
one-dimensional search
cubic B-spline
interpolation
