GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
Parallel subspace method for non-Hermitian eigenproblems on the Connection Machine (CM2)
Selected papers from the symposia on CWI-IMACS symposia on parallel scientific computing
Sparse matrix computations on parallel processor arrays
SIAM Journal on Scientific Computing
Runtime coupling of data-parallel programs
ICS '96 Proceedings of the 10th international conference on Supercomputing
Parallel QR Algorithm for Iterative Subspace Methods on the Connection Machine (CM2)
Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing
| Hi-index | 0.09 |
We present a parallel hybrid asynchronous method to solve large sparse linear systems by the use of a large parallel machine. This method combines a parallel GMRES(m) algorithm with the least squares method that needs some eigenvalues obtained from a parallel Arnoldi algorithm. All of the algorithms run on different processors of an IBM SP3 or IBM SP4 computer simultaneously. This implementation of this hybrid method allows us to take advantage of the parallelism available and to accelerate the convergence by decreasing considerably the number of iterations.