求解具有多个右端项线性方程组的总体CGS算法  

GLOBAL CGS ALGORITHM FOR LINEAR SYSTEMS WITH MULTIPLE RIGHT-HAND SIDES

作　　者：张建华[1] 戴华[2] 

机构地区：[1]安徽科技大学理学院,凤阳233100 [2]南京航空航天大学理学院,南京210016

出　　处：《高等学校计算数学学报》2008年第4期390-399,共10页Numerical Mathematics A Journal of Chinese Universities

基　　金：安徽科技学院引进人才项目(ZRC2008172)

摘　　要：1 引言在电磁场散射[1]等一些应用问题中。In this paper, we present the global conjugate gradient squared symmetric linear systems of equations is based on global oblique projections a new transpose-free global method （called algorithm （G1-CGS）） for solving large nonwith multiple right-hand sides. The method of the initial residual onto a matrix Krylov subspace. Although related to the global biconjugate gradient （G1-BCG） algorithm, the G1-CGS algorithm does not need multiplication by the transpose of a matrix. To avoid the irregular convergence behavior of the residual norm in the G1-CGS algorithm, we develop a global smoothing technique. Applying the technique to the G1-CGS algorithm, we obtain the smoothed G1-CGS algorithm. Finally, some numerical examples are given to illustrate the effectiveness of the proposed method.

关 键 词：非对称线性方程组 GS算法 求解 电磁场 

分 类 号：O241.6[理学—计算数学] TN958.92[理学—数学]