𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A block IDR() method for nonsymmetric linear systems with multiple right-hand sides

✍ Scribed by L. Du; T. Sogabe; B. Yu; Y. Yamamoto; S.-L. Zhang


Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
477 KB
Volume
235
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis


s) Block IDR(s) a b s t r a c t The IDR(s) based on the induced dimension reduction (IDR) theorem, is a new class of efficient algorithms for large nonsymmetric linear systems. IDR(1) is mathematically equivalent to BiCGStab at the even IDR(1) residuals, and IDR(s) with s > 1 is competitive with most Bi-CG based methods. For these reasons, we extend the IDR(s) to solve large nonsymmetric linear systems with multiple right-hand sides. In this paper, a variant of the IDR theorem is given at first, then the block IDR(s), an extension of IDR(s) based on the variant IDR(s) theorem, is proposed. By analysis, the upper bound on the number of matrixvector products of block IDR(s) is the same as that of the IDR(s) for a single right-hand side in generic case, i.e., the total number of matrix-vector products of IDR(s) may be m times that of of block IDR(s), where m is the number of right-hand sides. Numerical experiments are presented to show the effectiveness of our proposed method.


πŸ“œ SIMILAR VOLUMES


Skew-symmetric methods for nonsymmetric
✍ Chuanqing Gu; Hongjun Qian πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 664 KB

By transforming nonsymmetric linear systems to the extended skew-symmetric ones, we present the skew-symmetric methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on the block and global Arnoldi algorithm which is formed by implementing orthogonal

Deflated GMRES for systems with multiple
✍ Dean Darnell; Ronald B. Morgan; Walter Wilcox πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 275 KB

We consider solution of multiply shifted systems of nonsymmetric linear equations, possibly also with multiple right-hand sides. First, for a single right-hand side, the matrix is shifted by several multiples of the identity. Such problems arise in a number of applications, including lattice quantum

Parallel Dichotomy Algorithm for solving
✍ Andrew V. Terekhov πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 594 KB

A parallel algorithm for solving a series of matrix equations with a constant tridiagonal matrix and different right-hand sides is proposed and studied. The process of solving the problem is represented in two steps. The first preliminary step is calculating some rows of the inverse matrix of system

A Generalised Conjugate Residual method
✍ Frederik Jan Lingen πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 305 KB πŸ‘ 2 views

This paper presents an iterative algorithm for solving non-symmetric systems of equations with multiple righthand sides. The algorithm is an extension of the Generalised Conjugate Residual method (GCR) and combines the advantages of a direct solver with those of an iterative solver: it does not have