An extension of the conjugate residual method to nonsymmetric linear systems
โ Scribed by T. Sogabe; M. Sugihara; S.-L. Zhang
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 752 KB
- Volume
- 226
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
โฆ Synopsis
algorithm Coupled two-term recurrences a b s t r a c t
The Conjugate Gradient (CG) method and the Conjugate Residual (CR) method are Krylov subspace methods for solving symmetric (positive definite) linear systems. To solve nonsymmetric linear systems, the Bi-Conjugate Gradient (Bi-CG) method has been proposed as an extension of CG. Bi-CG has attractive short-term recurrences, and it is the basis for the successful variants such as Bi-CGSTAB. In this paper, we extend CR to nonsymmetric linear systems with the aim of finding an alternative basic solver. Numerical experiments show that the resulting algorithm with short-term recurrences often gives smoother convergence behavior than Bi-CG. Hence, it may take the place of Bi-CG for the successful variants.
๐ SIMILAR VOLUMES
The inverse sensitivity method for parametric correction in cases when mechanical structures are described by analytical conservative mechanical models with repeated eigenvalues is investigated. A new procedure is proposed for extending the inverse sensitivity method to these systems. This is based
Consider the linear system Ax = b, where A โ C NรN is a singular matrix. In the present work we propose a general framework within which Krylov subspace methods for Drazininverse solution of this system can be derived in a convenient way. The Krylov subspace methods known to us to date treat only th