Add to ORKGA lot of technical problems lead to systems of linear equations. The matrices of the systems are often sparse, then a proper reordering of their rows and columns may reduce the time needed for solution and the validity of the result. We focus in Tarjan’s algorithm which permutes the rows and columns of a matrix in order to obtain a block triangular matrix with irreducible diagonal blocks
This paper proposes a set of Level 3 Basic Linear Algebra Subprograms and associated kernels for sp...
AbstractThis paper gives a classification for the triangular factorization of square matrices. These...
An algorithm for computing matrix functionsispresented. It employsaS chur decomposition with reord...
In this thesis we will present an effective method for solving systems of linear equations with larg...
Abstract. This paper generalizes to the nonlinear case a standard way to solve general sparse system...
Matrix L is lower triangular if all entries above its main diagonal are zero, `ij = 0 for i < j M...
In this work an algorithm for solving triangular systems of equations for multiple right hand sides ...
We consider the problem of computing a scaling α such that the solution x of the scaled linear syste...
The triangle algorithm, Kalantari [4], is designed to solve the convex hull membership problem. It c...
Triangular linear systems are fundamental in numerical linear algebra. A triangular linear system ha...
International audienceWe present a novel recursive algorithm for reducing a symmetric matrix to a tr...
An algorithm is developed for generating the system matrices for the Finite Element Method of solvin...
International audienceWe present a new parallel algorithm to compute an exact triangularization of l...
A new partitioning algorithm that permutes sparse matrices to a specific block lower-triangular form...
We consider the problem of permuting the rows and columns of a rectangular or square, unsymmetric sp...
This paper proposes a set of Level 3 Basic Linear Algebra Subprograms and associated kernels for sp...
AbstractThis paper gives a classification for the triangular factorization of square matrices. These...
An algorithm for computing matrix functionsispresented. It employsaS chur decomposition with reord...
In this thesis we will present an effective method for solving systems of linear equations with larg...
Abstract. This paper generalizes to the nonlinear case a standard way to solve general sparse system...
Matrix L is lower triangular if all entries above its main diagonal are zero, `ij = 0 for i < j M...
In this work an algorithm for solving triangular systems of equations for multiple right hand sides ...
We consider the problem of computing a scaling α such that the solution x of the scaled linear syste...
The triangle algorithm, Kalantari [4], is designed to solve the convex hull membership problem. It c...
Triangular linear systems are fundamental in numerical linear algebra. A triangular linear system ha...
International audienceWe present a novel recursive algorithm for reducing a symmetric matrix to a tr...
An algorithm is developed for generating the system matrices for the Finite Element Method of solvin...
International audienceWe present a new parallel algorithm to compute an exact triangularization of l...
A new partitioning algorithm that permutes sparse matrices to a specific block lower-triangular form...
We consider the problem of permuting the rows and columns of a rectangular or square, unsymmetric sp...
This paper proposes a set of Level 3 Basic Linear Algebra Subprograms and associated kernels for sp...
AbstractThis paper gives a classification for the triangular factorization of square matrices. These...
An algorithm for computing matrix functionsispresented. It employsaS chur decomposition with reord...