z-logo
open-access-imgOpen Access
A Note on the Block and Seed BiCGSTAB Algorithms for Nonsymmetric Multiple Linear Systems
Author(s) -
K. Jbilou
Publication year - 2016
Publication title -
american journal of algorithms and computing
Language(s) - English
Resource type - Journals
eISSN - 2162-9900
pISSN - 2162-9897
DOI - 10.7726/ajac.2016.1001
Subject(s) - biconjugate gradient stabilized method , block (permutation group theory) , algorithm , mathematics , computer science , linear system , combinatorics , iterative method , mathematical analysis
In this paper we ϐirst give a new derivation of the Bl-BiCGSTAB algorithm for solving block linear systems. This derivation is based only on linear algebra and didn't needs matrix orthogonal polynomials. We also propose a new method for solving linear systems with the same coefϐicient matrix and different right-hand sides. The proposed method is based on the BiCGSTAB algorithm and is especially efϐicient when the right-hand sides vector-columns are closely related. Some numerical examples are reported to illustrate the effectiveness of the proposed methods.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom