A multi-level method for the solution of sparse linear systems is introduced. The definition of the method is based on data from the coefficient matrix alone. An upper bound for the condition number is available for certain symmetric positive definite (SPD) problems. Numerical experiments confirm the analysis and illustrate the efficiency of the method for diffusion problems with discontinuous coefficients with discontinuities which are not aligned with the coarse meshes
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on ...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
AbstractA class of new hybrid algebraic multilevel preconditioning methods is presented for solving ...
AbstractAn algorithm is presented for the general solution of a set of linear equations Ax=b. The me...
We present an overview of parallel direct methods for solving sparse systems of linear equations, fo...
Abstract. Numerical linear algebra and combinatorial optimization are vast subjects; as is their int...
AbstractWe consider systems of equations of the form AATx = b, where A is a sparse matrix having a s...
Recent advances in linear programming solution methodology have focused on interior point algorithms...
textabstractIn this paper, we propose some algorithms to solve the system of linear equations arisin...
AbstractA class of parallel decomposition-type accelerated over-relaxation methods, including four a...
. Envelope methods for solving sparse systems of linear equations require the matrix to be reordered...
AbstractA multilevel method for the iterative solution of large sparse linear systems is introduced....
AbstractA Las Vegas randomized algorithm for solving sparse linear systems over principal ideal doma...
International audienceDefinition : The multifrontal method is a direct method for solving systems of...
AbstractIn this paper we consider thearithmetic mean method for solving large sparse systems of line...
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on ...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
AbstractA class of new hybrid algebraic multilevel preconditioning methods is presented for solving ...
AbstractAn algorithm is presented for the general solution of a set of linear equations Ax=b. The me...
We present an overview of parallel direct methods for solving sparse systems of linear equations, fo...
Abstract. Numerical linear algebra and combinatorial optimization are vast subjects; as is their int...
AbstractWe consider systems of equations of the form AATx = b, where A is a sparse matrix having a s...
Recent advances in linear programming solution methodology have focused on interior point algorithms...
textabstractIn this paper, we propose some algorithms to solve the system of linear equations arisin...
AbstractA class of parallel decomposition-type accelerated over-relaxation methods, including four a...
. Envelope methods for solving sparse systems of linear equations require the matrix to be reordered...
AbstractA multilevel method for the iterative solution of large sparse linear systems is introduced....
AbstractA Las Vegas randomized algorithm for solving sparse linear systems over principal ideal doma...
International audienceDefinition : The multifrontal method is a direct method for solving systems of...
AbstractIn this paper we consider thearithmetic mean method for solving large sparse systems of line...
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on ...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
AbstractA class of new hybrid algebraic multilevel preconditioning methods is presented for solving ...