Notes on a 3-term Conjugacy Recurrence for the Iterative Solution of Symmetric Linear Systems
We consider a 3-term recurrence, namely CG_2step, for the iterative solution of symmetric linear systems. The new algorithm generates conjugate directions and extends some standard theoretical properties of the Conjugate Gradient (CG) method . We prove the finite convergence of CG_2step, and we provide some error analysis. Then, we introduce preconditioning for CG_2step, and we prove that standard error bounds for the CG also hold for our proposal.
|Date of creation:||Nov 2008|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: ++39 041 2346910-6911
Fax: ++ 39 041 5221756
Web page: http://www.dma.unive.it/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:vnm:wpaper:179. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Marco LiCalzi)
If references are entirely missing, you can add them using this form.