AbstractVarious types of LU-factorizations for nonsingular matrices, where L is a lower triangular matrix and U is an upper triangular matrix, are defined and characterized. These types of LU-factorizations are extended to the general m×n case. The more general conditions are considered in the light of the structures of [C.R. Johnson, D.D. Olesky, P. Van den Driessche, Inherited matrix entries: LU factorizations, SIAM J. Matrix Anal. Appl. 10 (1989) 99–104]. Applications to graphs and adjacency matrices are investigated. Conditions for the product of a lower and an upper triangular matrix to be the zero matrix are also obtained
AbstractNot all matrices enjoy the existence of an LU factorization. For those that do not, a number...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
AbstractLet A be a real n × n matrix. A is TP (totally positive) if all the minors of A are nonnegat...
Submitted by H. Schneider Various types of LU-factorizations for nonsingular matrices, where L is a ...
AbstractA singular matrix A may have more than one LU factorizations. In this work the set of all LU...
AbstractSuppose A is an n×n nonnegative matrix. Necessary and sufficient conditions are given for A ...
Various algorithm such as Doolittle, Crouts and Cholesky’s have been proposed to factor a square mat...
AbstractLet A be an m-by-n integer matrix and r = rank(A). A necessary and sufficient condition is g...
AbstractNecessary and sufficient conditions are given for an integer matrix A to have an integer LU ...
AbstractCustomizable triangular factorizations of matrices find their applications in computer graph...
This paper is concerned with the following questions. Given a square matrix A, when does there exist...
AbstractAn elementary bidiagonal (EB) matrix has every main diagonal entry equal to 1, and exactly o...
AbstractThis paper is concerned with the following questions. Given a square matrix A, when does the...
AbstractAn n × n real matrix A is an STP (strictly totally positive) matrix if all its minors are st...
AbstractSupposing that M is a singular M-matrix, we show that there exists a permutation matrix P su...
AbstractNot all matrices enjoy the existence of an LU factorization. For those that do not, a number...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
AbstractLet A be a real n × n matrix. A is TP (totally positive) if all the minors of A are nonnegat...
Submitted by H. Schneider Various types of LU-factorizations for nonsingular matrices, where L is a ...
AbstractA singular matrix A may have more than one LU factorizations. In this work the set of all LU...
AbstractSuppose A is an n×n nonnegative matrix. Necessary and sufficient conditions are given for A ...
Various algorithm such as Doolittle, Crouts and Cholesky’s have been proposed to factor a square mat...
AbstractLet A be an m-by-n integer matrix and r = rank(A). A necessary and sufficient condition is g...
AbstractNecessary and sufficient conditions are given for an integer matrix A to have an integer LU ...
AbstractCustomizable triangular factorizations of matrices find their applications in computer graph...
This paper is concerned with the following questions. Given a square matrix A, when does there exist...
AbstractAn elementary bidiagonal (EB) matrix has every main diagonal entry equal to 1, and exactly o...
AbstractThis paper is concerned with the following questions. Given a square matrix A, when does the...
AbstractAn n × n real matrix A is an STP (strictly totally positive) matrix if all its minors are st...
AbstractSupposing that M is a singular M-matrix, we show that there exists a permutation matrix P su...
AbstractNot all matrices enjoy the existence of an LU factorization. For those that do not, a number...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
AbstractLet A be a real n × n matrix. A is TP (totally positive) if all the minors of A are nonnegat...