AbstractAn algorithm is presented for the general solution of a set of linear equations Ax=b. The method works exceptionally well for the solution of large sparse systems of linear equations, the co-efficient matrix A of which need not be symmetric but should have workable splits. The method can be applied to problems which arise in convection-diffusion, flow of fluids and oil reservoir modeling. The difference of the upper secondary diagonals (super diagonals) and the lower secondary diagonals (sub diagonals) of the matrix A leads to a decomposition of A into a difference of a symmetric matrix, having the same lower structure as that of A, and a strictly upper triangular matrix. The symmetric matrix is made diagonally dominant and the syst...
Iterative methods are considered for the numerical solution of large, sparse, nonsingular, and nonsy...
AbstractWe consider large sparse linear systems Ax = b with complex symmetric coefficient matrices A...
Abstract. We consider a class of iterative algorithms for solving systems of linear equations where ...
AbstractAn algorithm is presented for the general solution of a set of linear equations Ax=b. The me...
Among the iterative methods for solving large linear systems with a sparse (or, possibly, structured...
AbstractWe consider projection-minimization methods for solving systems of linear equations. We tran...
AbstractWe consider systems of equations of the form AATx = b, where A is a sparse matrix having a s...
AbstractA new sparse approximate triangular factorization technique for solving large sparse linear ...
summary:Nonlinear iterative methods are investigated and a generalization of a direct method for lin...
In this thesis we consider the problems that arise in computational linear algebra when ...
AbstractIn this paper we consider thearithmetic mean method for solving large sparse systems of line...
The envelope data structure and the Choleski based (bordering) method for the solution of symmetric ...
In this chapter we will present an overview of a number of related iterative methods for the solutio...
In this thesis we are concerned with iterative parallel algorithms for solving finite difference eq...
AbstractA new iterative method for the solution of linear systems, based upon a new splitting of the...
Iterative methods are considered for the numerical solution of large, sparse, nonsingular, and nonsy...
AbstractWe consider large sparse linear systems Ax = b with complex symmetric coefficient matrices A...
Abstract. We consider a class of iterative algorithms for solving systems of linear equations where ...
AbstractAn algorithm is presented for the general solution of a set of linear equations Ax=b. The me...
Among the iterative methods for solving large linear systems with a sparse (or, possibly, structured...
AbstractWe consider projection-minimization methods for solving systems of linear equations. We tran...
AbstractWe consider systems of equations of the form AATx = b, where A is a sparse matrix having a s...
AbstractA new sparse approximate triangular factorization technique for solving large sparse linear ...
summary:Nonlinear iterative methods are investigated and a generalization of a direct method for lin...
In this thesis we consider the problems that arise in computational linear algebra when ...
AbstractIn this paper we consider thearithmetic mean method for solving large sparse systems of line...
The envelope data structure and the Choleski based (bordering) method for the solution of symmetric ...
In this chapter we will present an overview of a number of related iterative methods for the solutio...
In this thesis we are concerned with iterative parallel algorithms for solving finite difference eq...
AbstractA new iterative method for the solution of linear systems, based upon a new splitting of the...
Iterative methods are considered for the numerical solution of large, sparse, nonsingular, and nonsy...
AbstractWe consider large sparse linear systems Ax = b with complex symmetric coefficient matrices A...
Abstract. We consider a class of iterative algorithms for solving systems of linear equations where ...