Add to ORKGIn this paper we consider the arithmetic mean preconditioner for the conjugate gradient method. This preconditioner is designed to be implemented on a multiprocessor system that can execute concurrently different tasks on vector processors.Some spectral bounds for the preconditioner have been obtained. A comparison between this preconditioner and the SSOR preconditioner has been carried out on different test-matrices. Also the m-step preconditioners generated by the arithmetic mean preconditioner and by the SSOR preconditioner have been compared
AbstractLinear systems of the form Ax = b, where the matrix A is symmetric and positive definite, of...
The computational and storage complexity of kernel machines presents the primary barrier to their sc...
The implementation of accelerated conjugated gradients for the solution of large sparse systems of l...
In this paper we consider the arithmetic mean preconditioner for the conjugate gradient method. This...
AbstractThis paper discusses preconditioners for the Conjugate Gradient Method which are based on sp...
A frequently used iterative algorithm for solving large, sparse, symmetric and positiv definite syst...
AbstractIn this paper, an analysis of some of the tradeoffs involved in the design and efficient imp...
Abstract. This paper numerically compares different algebraic multilevel preconditioners to solve sy...
Contains fulltext : mmubn000001_100291317.pdf (publisher's version ) (Open Access)...
Abstract: The conjugate gradient method (CG) is usually used with a preconditioner which i...
This report presents preconditioning techniques for the conjugate gradient method (CG), an iterative...
AbstractPolynomial preconditioning is a useful tool in the effective use of the conjugate gradient a...
The conjugate gradient method is an iterative technique used to solve systems of linear equations. T...
AbstractLinear systems with M-matrices often occur in a wide variety of areas including scientific c...
This report presents preconditioning techniques for the conjugate gradient method (CG), an iterative...
AbstractLinear systems of the form Ax = b, where the matrix A is symmetric and positive definite, of...
The computational and storage complexity of kernel machines presents the primary barrier to their sc...
The implementation of accelerated conjugated gradients for the solution of large sparse systems of l...
In this paper we consider the arithmetic mean preconditioner for the conjugate gradient method. This...
AbstractThis paper discusses preconditioners for the Conjugate Gradient Method which are based on sp...
A frequently used iterative algorithm for solving large, sparse, symmetric and positiv definite syst...
AbstractIn this paper, an analysis of some of the tradeoffs involved in the design and efficient imp...
Abstract. This paper numerically compares different algebraic multilevel preconditioners to solve sy...
Contains fulltext : mmubn000001_100291317.pdf (publisher's version ) (Open Access)...
Abstract: The conjugate gradient method (CG) is usually used with a preconditioner which i...
This report presents preconditioning techniques for the conjugate gradient method (CG), an iterative...
AbstractPolynomial preconditioning is a useful tool in the effective use of the conjugate gradient a...
The conjugate gradient method is an iterative technique used to solve systems of linear equations. T...
AbstractLinear systems with M-matrices often occur in a wide variety of areas including scientific c...
This report presents preconditioning techniques for the conjugate gradient method (CG), an iterative...
AbstractLinear systems of the form Ax = b, where the matrix A is symmetric and positive definite, of...
The computational and storage complexity of kernel machines presents the primary barrier to their sc...
The implementation of accelerated conjugated gradients for the solution of large sparse systems of l...