首页 | 本学科首页   官方微博 | 高级检索  
     检索      

逼近已知函数微商的广义Lanczos算法
引用本文:曹飞龙,潘星,杨汝月.逼近已知函数微商的广义Lanczos算法[J].系统科学与数学,2009,29(12):1593-1604.
作者姓名:曹飞龙  潘星  杨汝月
作者单位:中国计量学院信息与数学科学系,杭州,310018
摘    要:给出逼近已知函数微商的广义Lanczos 算法, 构造了一列逼近算子$D_{h}^{n}$以提高稳定近似解的收敛速率. 当$n=2$时, 逼近精度达到$O(\delta^{6 \over 7})$, 而对一般的自然数$n$逼近精度为$O(\delta^{\frac{2n+2}{2n+3}})$, 这里$\delta$是近似函数的误差界.

关 键 词:微商  收敛速率  误差界.
收稿时间:2008-6-16
修稿时间:2008-12-18

GENERALIZED LANCZOS' ALGORITHM TO APPROXIMATE DIFFERENTIATION OF GIVEN FUNCTIONS
CAO Feilong,PAN Xing,YANG Ruyue.GENERALIZED LANCZOS' ALGORITHM TO APPROXIMATE DIFFERENTIATION OF GIVEN FUNCTIONS[J].Journal of Systems Science and Mathematical Sciences,2009,29(12):1593-1604.
Authors:CAO Feilong  PAN Xing  YANG Ruyue
Institution:Department of Information and Mathematics Sciences, China Jiliang University, ZheJiang 310018
Abstract:In this paper, a new generalized Lanczos' algorithm to approximate the differentiation of given functions is given. A sequence of operators $D^n_h$ is constructed to improve the convergence rate of the stable approximate solution. For $n=2$, the improved estimate can reach to $O(\delta^{\frac{6}{7}})$, and for general natural number $n$, the rate is $O(\delta^{\frac{2n+2}{2n+3}})$, where $\delta$ is the error bounds of the approximate functions.
Keywords:Differentiation  convergence rate  error bounds  
本文献已被 万方数据 等数据库收录!
点击此处可从《系统科学与数学》浏览原始摘要信息
点击此处可从《系统科学与数学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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