AbstractLet M be a symmetric matrix with non-zero diagonal entries. A result of Golumbic [3, 5] states that if M has a perfect elimination scheme then it also has a perfect elimination scheme with the additional property that all pivots are chosen along the main diagonal. However, the proof given by Golumbic seems to be incomplete. In the present note, we refine Golumbic's proof, thus obtaining a complete version of it
Partial pivoting strategies for the decomposition of symmetric matrices are discussed for solving sy...
Abstract. Matrices, called ε-BD matrices, that have a bidiagonal decomposition satisfying some sign ...
AbstractThe Neville elimination process, used by the authors in some previous papers in connection w...
AbstractWe extend a result of D. J. Rose [9] on perfect Gaussian elimination for symmetric matrices....
AbstractLet M be a symmetric matrix with non-zero diagonal entries. A result of Golumbic [3, 5] stat...
AbstractIt is proved in the paper that if the transpose of a matrix A is diagonally dominant and non...
In Gaussian elimination it is often desirable to preserve existing zeros (sparsity). This is closely...
In Gaussian elimination it is often desirable to preserve existing zeros (sparsity). This is closely...
The triangular decomposition of a square matrix is the "key interpretation" of Gaussian elimination ...
AbstractUsing the simple vehicle of tridiagonal Toeplitz matrices, the question of whether one must ...
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimina...
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimina...
For the solution of a linear system Ax = b using Gaussian elimination, some new properties of scaled...
Abstract: It is shown that Gauss elimination without pivoting is possible for positive semidefinite ...
AbstractIn the present note it is proved that, given a real n × n matrix An=(aij), such that |aij| ⩽...
Partial pivoting strategies for the decomposition of symmetric matrices are discussed for solving sy...
Abstract. Matrices, called ε-BD matrices, that have a bidiagonal decomposition satisfying some sign ...
AbstractThe Neville elimination process, used by the authors in some previous papers in connection w...
AbstractWe extend a result of D. J. Rose [9] on perfect Gaussian elimination for symmetric matrices....
AbstractLet M be a symmetric matrix with non-zero diagonal entries. A result of Golumbic [3, 5] stat...
AbstractIt is proved in the paper that if the transpose of a matrix A is diagonally dominant and non...
In Gaussian elimination it is often desirable to preserve existing zeros (sparsity). This is closely...
In Gaussian elimination it is often desirable to preserve existing zeros (sparsity). This is closely...
The triangular decomposition of a square matrix is the "key interpretation" of Gaussian elimination ...
AbstractUsing the simple vehicle of tridiagonal Toeplitz matrices, the question of whether one must ...
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimina...
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimina...
For the solution of a linear system Ax = b using Gaussian elimination, some new properties of scaled...
Abstract: It is shown that Gauss elimination without pivoting is possible for positive semidefinite ...
AbstractIn the present note it is proved that, given a real n × n matrix An=(aij), such that |aij| ⩽...
Partial pivoting strategies for the decomposition of symmetric matrices are discussed for solving sy...
Abstract. Matrices, called ε-BD matrices, that have a bidiagonal decomposition satisfying some sign ...
AbstractThe Neville elimination process, used by the authors in some previous papers in connection w...