Nonsymmetric Systems Of Equations Research Articles

Improvement of the minimal residual method for solving nonsymmetric linear systems

In this paper, the minimal residual (MRES) method for solving nonsymmetric equation systems was improved, the recurrence relation was deduced between the approximate solutions of the linear equation system Ax = b, and a more effective method was presented, which can reduce the operational count and the storage.

A projection method for solving nonsymmetric linear systems on multiprocessors

We consider the iterative solution of large sparse linear systems of equations arising from elliptic and parabolic partial differential equations in two or three space dimensions. Specifically, we focus our attention on nonsymmetric systems of equations whose eigenvalues lie on both sides of the imaginary axis, or whose symmetric part is not positive definite. This system of equation is solved using a block Kaczmarz projection method with conjugate gradient acceleration. The algorithm has been designed with special emphasis on its suitability for multiprocessors. In the first part of the paper, we study the numerical properties of the algorithm and compare its performance with other algorithms such as the conjugate gradient method on the normal equations, and conjugate gradient-like schemes such as ORTHOMIN( k), GCR( k) and GMRES( k). We also study the effect of using various preconditioners with these methods. In the second part of the paper, we describe the implementation of our algorithm on the CRAY X-MP/48 multiprocessor, and study its behavior as the number of processors is increased.