CORC  > 清华大学
求解线性方程组的投影算法
顾阿伦 ; 孙永广 ; 鲁红 ; GU A-lun ; SUN Yong-guang ; LU Hong
2010-06-04 ; 2010-06-04
关键词线性方程组 投影算法 长轴陷阱 陷阱深度 linear equations project algorithm long axis trap trap depth. O241.6
其他题名Method of Solving Linear Equations Based on Residual Space
中文摘要分析了基于残差空间求解线性方程组的一维投影算法、最速下降法和最小剩余法。定义了长轴陷阱及陷阱深度,用它们刻划了2种算法迭代过程中锯齿现象的几何特征。给出了基于残差序列的避开长轴陷阱的扰动技巧,即投影算法。数值试验表明,投影算法要优于现在流行的主要求解线性方程组算法。; The one-dimension projection algorithm, which is the steepest descent method, based on residual space for solving linear equations is analyzed in this paper. The definitions of long axis trap and trap depth are given. The geometrical feature of the algorithm is characterized. The method of perturbation based on residual series, which keeps residuals off the long axis trap, is presented in this paper. That is the multi-dimension projection method. The numerical experimentation shows that the method is superior to the present popular dominant algorithms.
语种中文 ; 中文
内容类型期刊论文
源URL[http://hdl.handle.net/123456789/35370]  
专题清华大学
推荐引用方式
GB/T 7714
顾阿伦,孙永广,鲁红,等. 求解线性方程组的投影算法[J],2010, 2010.
APA 顾阿伦,孙永广,鲁红,GU A-lun,SUN Yong-guang,&LU Hong.(2010).求解线性方程组的投影算法..
MLA 顾阿伦,et al."求解线性方程组的投影算法".(2010).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace