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

求解线性方程组的投影算法
引用本文:顾阿伦,孙永广,鲁红.求解线性方程组的投影算法[J].科技导报(北京),2006,24(7):41-44.
作者姓名:顾阿伦  孙永广  鲁红
作者单位:清华大学核能与新能源技术研究院 北京100084(顾阿伦,孙永广),山东日照职业技术学校计算机系 山东日照276826(鲁红)
摘    要:分析了基于残差空间求解线性方程组的一维投影算法、最速下降法和最小剩余法。定义了长轴陷阱及陷阱深度,用它们刻划了2种算法迭代过程中锯齿现象的几何特征。给出了基于残差序列的避开长轴陷阱的扰动技巧,即投影算法。数值试验表明,投影算法要优于现在流行的主要求解线性方程组算法。

关 键 词:线性方程组  投影算法  长轴陷阱  陷阱深度
文章编号:1000-7857(2006)07-0041-04
收稿时间:2006-04-20
修稿时间:2006年4月20日

Method of Solving Linear Equations Based on Residual Space
GU Alun,SUN Yong-guang,LU Hong.Method of Solving Linear Equations Based on Residual Space[J].Science & Technology Review,2006,24(7):41-44.
Authors:GU Alun  SUN Yong-guang  LU Hong
Institution:1. Institute of Nuclear and New Energy Technology ,Tsinghua University, Beijing 100084, China; 2. Shangdong Rizhao Vocation Technology School, Rizhao 276826, Shandong Province, China
Abstract: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.
Keywords:linear equations  project algorithm  long axis trap  trap depth    
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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