In this report we consider a new version of the arithmetic mean method for solving large block tridiagonal linear systems. The iterative method converges for systems with symmetric positive definite or positive real matrices or irreducible L-matrices with a strong diagonal dominance. When the coefficient matrix is symmetric positive definite, an additive preconditioner for the conjugate gradient method is derived.The Fortran 77 code carried out on multivector computer Cray Y-MP implementing the algorithm above, are reported in appendix
AbstractWe present the recurrence formulas for computing the approximate inverse factors of tridiago...
The solution of large, banded diagonally dominant or symmetric positive definite linear systems cons...
AbstractSolving special tridiagonal systems often arise in the fields of engineering and science. Th...
In this report we consider a new version of the arithmetic mean method for solving large block tridi...
In this paper, we consider a new form of the arithmetic mean method for solving large block tridiago...
AbstractIn this paper, we consider a new form of the arithmetic mean method for solving large block ...
In this paper, we consider a new form of the arithmetic mean method for solving large block tridiago...
This report deals with the detailed analysis of the Fortran routines implementing the iterative meth...
In this report we consider two parallel additive preconditioners for solving block tridiagonal linea...
This paper is concerned with the solution of block tridiagonal linear systems by the preconditioned ...
This paper is concerned with the solution of block tridiagonal linear algebraic systems by two diffe...
In several recent works, the Arithmetic Mean Method for solving large sparse linear systems has been...
In this paper we consider the arithmetic mean method for solving large sparse systems of linear equa...
AbstractThis paper is focused on different methods and algorithms for solving tridiagonal block Toep...
In this study, we propose a tridiagonal iterative method to solve linear systems based on dominant t...
AbstractWe present the recurrence formulas for computing the approximate inverse factors of tridiago...
The solution of large, banded diagonally dominant or symmetric positive definite linear systems cons...
AbstractSolving special tridiagonal systems often arise in the fields of engineering and science. Th...
In this report we consider a new version of the arithmetic mean method for solving large block tridi...
In this paper, we consider a new form of the arithmetic mean method for solving large block tridiago...
AbstractIn this paper, we consider a new form of the arithmetic mean method for solving large block ...
In this paper, we consider a new form of the arithmetic mean method for solving large block tridiago...
This report deals with the detailed analysis of the Fortran routines implementing the iterative meth...
In this report we consider two parallel additive preconditioners for solving block tridiagonal linea...
This paper is concerned with the solution of block tridiagonal linear systems by the preconditioned ...
This paper is concerned with the solution of block tridiagonal linear algebraic systems by two diffe...
In several recent works, the Arithmetic Mean Method for solving large sparse linear systems has been...
In this paper we consider the arithmetic mean method for solving large sparse systems of linear equa...
AbstractThis paper is focused on different methods and algorithms for solving tridiagonal block Toep...
In this study, we propose a tridiagonal iterative method to solve linear systems based on dominant t...
AbstractWe present the recurrence formulas for computing the approximate inverse factors of tridiago...
The solution of large, banded diagonally dominant or symmetric positive definite linear systems cons...
AbstractSolving special tridiagonal systems often arise in the fields of engineering and science. Th...