The solution of systems with many right-hand sides
β Scribed by V.V. Voevodin; V.M. Volovich
- Publisher
- Elsevier Science
- Year
- 1970
- Weight
- 240 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0041-5553
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Projection techniques are developed for computing approximate solutions to linear systems of the form Ax" =b", for a sequence n = 1, 2, , e.g. arising from time discretization of a partial differential equation. The approximate solutions are based upon previous solutions, and can be used as initial
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
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
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