首页 | 官方网站   微博 | 高级检索  
     

求最平坦的三次样条插值的粒子群优化算法
引用本文:高尚,孙玲芳.求最平坦的三次样条插值的粒子群优化算法[J].微电子学与计算机,2007,24(6):201-203.
作者姓名:高尚  孙玲芳
作者单位:1. 江苏科技大学,电子信息学院,江苏,镇江,212003;苏州大学,江苏省计算机信息处理技术重点实验室,江苏,苏州,215006
2. 江苏科技大学,经济管理学院,江苏,镇江,212003
摘    要:在分析了样条函数插值基础上,提出最平坦的三次样条插值问题,并提出了利用粒子群优化算法解决该问题。最后给出了一个实例。

关 键 词:三次样条函数  优化  粒子群优化算法
文章编号:1000-7180(2007)06-0201-03
修稿时间:2006-08-02

Solving the Most Smooth Cubic Spline Interpolation by Particle Swarm Optimization Algorithm
GAO Shang,SUN Ling-fang.Solving the Most Smooth Cubic Spline Interpolation by Particle Swarm Optimization Algorithm[J].Microelectronics & Computer,2007,24(6):201-203.
Authors:GAO Shang  SUN Ling-fang
Affiliation:1 School of Electronics and Information, Jiangsu University of Science and Technology, Zhenjiang 212003, China; 2 Provincial Key Laboratory of Computer Information Processing Technology, Soochow University, Suzhou 215006, China; 3 School of Economic and management, Jiangsu University of Science and Technology, Zhenjiang 212003, China
Abstract:Based on analysis of cubic spline interpolation, the problem of the most smooth cubic spline interpolation is discussed in this paper. Furthermore, the particle swarm algorithm for this problem is presented. At last, an example is given.
Keywords:cubic spline Function  optimization  particle swarm algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号