Abstract: In many relevant large scale computations one has to solve very large linear nonsymmetric systems. Often there is no alternative but to solve these systems by some iterative solution method. In the past few years new methods have emerged that can be seen as combinations of standard Krylov subspace methods, such as Bi-CG and GMRES. One of the first hybrid schemes of this type is CGS, actually the Bi-CG squared method. Other such hybrid schemes include BiCGSTAB (a combination of Bi-CG and GMRES(1)), BiCGSTAB(ℓ) (Bi-CG combined with GMRES(ℓ)), and the nested GMRESR method (GMRES preconditioned by itself or other schemes). These methods have been successful in solving relevant sparse nonsymmetric linear systems. After a presentation of some recent methods we will discuss briefly implementation issues of the Krylov subspace methods, including possibilities for distributed parallel computation.
Publication Year: 1994
Publication Date: 1994-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 8
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot