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


On Meinardus' examples for the conjugate gradient method
Authors:Ren-Cang Li.
Affiliation:Department of Mathematics, University of Texas at Arlington, P.O. Box 19408, Arlington, Texas 76019-0408
Abstract:The conjugate gradient (CG) method is widely used to solve a positive definite linear system $ Ax=b$ of order $ N$. It is well known that the relative residual of the $ k$th approximate solution by CG (with the initial approximation $ x_0=0$) is bounded above by

$displaystyle 2left[Delta_{kappa}^k+Delta_{kappa}^{-k}right]^{-1}$   with$displaystyle quad Delta_{kappa}=frac {sqrt{kappa}+1}{sqrt{kappa}-1}, $

where $ kappaequivkappa(A)=Vert AVert _2Vert A^{-1}Vert _2$ is $ A$'s spectral condition number. In 1963, Meinardus (Numer. Math., 5 (1963), pp. 14-23) gave an example to achieve this bound for $ k=N-1$ but without saying anything about all other $ 1le k<N-1$. This very example can be used to show that the bound is sharp for any given $ k$ by constructing examples to attain the bound, but such examples depend on $ k$ and for them the $ (k+1)$th residual is exactly zero. Therefore it would be interesting to know if there is any example on which the CG relative residuals are comparable to the bound for all $ 1le kle N-1$. There are two contributions in this paper:
  1. A closed formula for the CG residuals for all $ 1le kle N-1$ on Meinardus' example is obtained, and in particular it implies that the bound is always within a factor of $ sqrt 2$ of the actual residuals;
  2. A complete characterization of extreme positive linear systems for which the $ k$th CG residual achieves the bound is also presented.

Keywords:Conjugate gradient method   Krylov subspace   rate of convergence   Vandermonde matrix   condition number
点击此处可从《Mathematics of Computation》浏览原始摘要信息
点击此处可从《Mathematics of Computation》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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