Add to ORKGFor the solution of linear systems of equations with unsymmetric coefficient matrices, R.W. Freund [J. Sci. Comput. 14 (1993), 470-482] recently proposed an iterative algorithm called Transpose-Free Quasi-Minimal Residual method. This paper presents implementation details and timings of this algorithm on an Intel iPSC/860, a hypercube-based parallel computer with distributed memory
Sparse matrix computations play an important role in iterative methods to solve systems of equations...
This paper describes parallel matrix transpose algorithms on distributed memory concurrent processor...
Abstract. We present a study of the implementational aspects of iterativemethods to solve systems of...
Much of the supercomputer research so far has concentrated on implementations of iterative methods f...
For the solution of systems of linear equations with general non-Hermitian nonsingular coefficient m...
For the solutions of linear systems of equations with unsymmetric coefficient matrices, we has propo...
Introduction One of the fundamental task of numerical computing is the ability to solve linear syst...
A new version of the unsymmetric Lanczos algorithm without look-ahead is described combining element...
A new version of the unsymmetric Lanczos algorithm without look-ahead is described combining element...
A specific problem arising out of electrostatics is taken as an example to demonstrate the process o...
We mainly examine the application of the improved version of the quasi-minimal residual (IQMR) metho...
One approach to solving the nonsymmetric eigenvalue problem in parallel is to parallelize the QR alg...
For the solutions of unsymmetric linear systems of equations, we have proposed an improved version o...
For the solution of linear systems of equations with unsymmetric coefficient matrix, Freund and Nach...
We present the parallel implementation on a transputer network of two preconditioned Lanczos-type sc...
Sparse matrix computations play an important role in iterative methods to solve systems of equations...
This paper describes parallel matrix transpose algorithms on distributed memory concurrent processor...
Abstract. We present a study of the implementational aspects of iterativemethods to solve systems of...
Much of the supercomputer research so far has concentrated on implementations of iterative methods f...
For the solution of systems of linear equations with general non-Hermitian nonsingular coefficient m...
For the solutions of linear systems of equations with unsymmetric coefficient matrices, we has propo...
Introduction One of the fundamental task of numerical computing is the ability to solve linear syst...
A new version of the unsymmetric Lanczos algorithm without look-ahead is described combining element...
A new version of the unsymmetric Lanczos algorithm without look-ahead is described combining element...
A specific problem arising out of electrostatics is taken as an example to demonstrate the process o...
We mainly examine the application of the improved version of the quasi-minimal residual (IQMR) metho...
One approach to solving the nonsymmetric eigenvalue problem in parallel is to parallelize the QR alg...
For the solutions of unsymmetric linear systems of equations, we have proposed an improved version o...
For the solution of linear systems of equations with unsymmetric coefficient matrix, Freund and Nach...
We present the parallel implementation on a transputer network of two preconditioned Lanczos-type sc...
Sparse matrix computations play an important role in iterative methods to solve systems of equations...
This paper describes parallel matrix transpose algorithms on distributed memory concurrent processor...
Abstract. We present a study of the implementational aspects of iterativemethods to solve systems of...