Computational variants of the CGS and BiCGstab methods
نویسنده
چکیده
The CGS and BiCGstab algorithms were derived by their authors from the bi-conjugate gradient iteration. In this paper a derivation from the (unnormalized) Lanczos algorithm is given. Experimental results are given, showing that these methods offer no immediate advantage over their earlier counterparts.
منابع مشابه
A Mixed Product Krylov Subspace Method for Solving Nonsymmetric Linear systems
In this paper, a product Krylov subspace method that we call mixed BiCGSTABCGS is derived. The method is built on the idea of the standard CGS and BiCGSTAB iterations but allows switching between the two at each iteration. This flexibility can be used, for example, to address the difficulty of excessive increase in residual norm in CGS, which may cause instability. In particular, a CGS based im...
متن کاملFurther Improvements in Nonsymmetric Hybrid Iterative Methods
In the past few years new methods have been proposed that can be seen as combinations of standard Krylov subspace methods, such as Bi-CG and GMRES. Such hybrid schemes include CGS, BiCGSTAB, QMRS, TFQMR, and the nested GMRESR method. These methods have been successful in solving relevant sparse nonsymmetric linear systems, but there is still a need for further improvements. In this paper we wil...
متن کاملAn Overview of Approaches for the StableComputation of Hybrid
It is well-known that BiCG can be adapted so that the operations with A T can be avoided, and hybrid methods with computational complexity almost similar to BiCG can be constructed in a further attempt to improve the convergence behavior. Examples of this are CGS, Bi-CGSTAB, and BiCGstab(`). In many applications, the speed of convergence of these methods is very dependent on the incorporated Bi...
متن کاملPreconditioned techniques for solving large sparse linear systems arising from the discretization of the elliptic partial differential equations
In this paper, we use the BiCG, BiCGSTAB methods as preconditioned techniques. Also we compare the preconditioned Krylov subspace methods such as GMRES, GMRES(m), QMR, BiCG, CGS, BiCGSTAB for solving linear systems arising from a class of fourth-order approximations for solving the elliptic partial differential equation Auxx + Buyy = f(x,y,u,ux,uy), where A and B are constants. Numerical result...
متن کاملRecycling Bi-Lanczos Algorithms: BiCG, CGS, and BiCGSTAB
Engineering problems frequently require solving a sequence of dual linear systems. This paper introduces recycling BiCG, that recycles the Krylov subspace from one pair of linear systems to the next pair. Augmented bi-Lanczos algorithm and modified two-term recurrence are developed for using the recycle space. Recycle space is built from the approximate invariant subspace corresponding to eigen...
متن کامل