Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
- 14 August 1989
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 11 (2), 223-239
- https://doi.org/10.1016/0167-8191(89)90030-6
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Analysis of Preconditioners for Domain DecompositionSIAM Journal on Numerical Analysis, 1987
- A Comparison of Domain Decomposition Techniques for Elliptic Partial Differential Equations and their Parallel ImplementationSIAM Journal on Scientific and Statistical Computing, 1987
- Toward Efficient Implementation of Preconditioned Conjugate Gradient Methods On Vector SupercomputersThe International Journal of Supercomputing Applications, 1987
- ILUBCG2: A preconditioned biconjugate gradient routine for the solution of linear asymmetric matrix equations arising from 9-point discretizationsComputer Physics Communications, 1987
- The IBM System/370 vector architectureIBM Systems Journal, 1986
- The use of a preconditioned bi-conjugate gradient method for hybrid plasma stability analysisJournal of Computational Physics, 1985
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problemsJournal of Computational Physics, 1981
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equationsLinear Algebra and its Applications, 1980
- An incomplete factorization technique for positive definite linear systemsMathematics of Computation, 1980
- The incomplete Cholesky—conjugate gradient method for the iterative solution of systems of linear equationsJournal of Computational Physics, 1978