Let A = (a(ij)) is an element of R-nxm be a totally nonpositive matrix with rank(A) = r <= min{n, m} and a(11) = 0. In this paper we obtain a characterization in terms of the full rank factorization in quasi-LDU form, that is, A = (L) over tilde DU where (L) over tilde is an element of R-nxr is a block lower echelon matrix, U is an element of R-rxm is a unit upper echelon totally positive matrix and D is an element of R-rxr is a diagonal matrix, with rank((L) over tilde) = rank(U) = rank(D) = r. We use this quasi-LDU decomposition to construct the quasi-bidiagonal factorization of A. Moreover, some properties about these matrices are studied. (C) 2013 Elsevier Inc. All rights reserved.This research was supported by the Spanish DGI grant MTM...
AbstractThe nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one ...
AbstractWe say that a rectangular matrix over a ring with identity is totally nonsingular (TNS) if f...
AbstractLet A be a real n × n matrix. A is TP (totally positive) if all the minors of A are nonnegat...
Let A = (a(ij)) is an element of R-nxm be a totally nonpositive matrix with rank(A) = r <= min{n, m}...
Let A = (a(ij)) is an element of R-nxm be a totally nonpositive matrix with rank(A) = r <= min{n, m}...
AbstractAn n×m real matrix A is said to be totally nonpositive (negative) if every minor is nonposit...
AbstractAn n×m real matrix A is said to be totally nonpositive (negative) if every minor is nonposit...
AbstractAn n×m real matrix A is said to be totally positive (strictly totally positive) if every min...
AbstractAn n×m real matrix A is said to be totally positive (strictly totally positive) if every min...
AbstractFor any m×n matrix A we introduce a definition of strong rank revealing LU (RRLU) factorizat...
An algorithm is described for the nonnegative rank factorization (NRF) of some completely posi-tive ...
[EN] Let A be a rank deficient square matrix. We characterize the unique full rank Cholesky factoriz...
AbstractAn algorithm is described for the nonnegative rank factorization (NRF) of some completely po...
In the study of matrices, we are always searching for tools which allow us to simplify our investiga...
Abstract: A method based on elementary column and row operations of the factorization of nonnegative...
AbstractThe nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one ...
AbstractWe say that a rectangular matrix over a ring with identity is totally nonsingular (TNS) if f...
AbstractLet A be a real n × n matrix. A is TP (totally positive) if all the minors of A are nonnegat...
Let A = (a(ij)) is an element of R-nxm be a totally nonpositive matrix with rank(A) = r <= min{n, m}...
Let A = (a(ij)) is an element of R-nxm be a totally nonpositive matrix with rank(A) = r <= min{n, m}...
AbstractAn n×m real matrix A is said to be totally nonpositive (negative) if every minor is nonposit...
AbstractAn n×m real matrix A is said to be totally nonpositive (negative) if every minor is nonposit...
AbstractAn n×m real matrix A is said to be totally positive (strictly totally positive) if every min...
AbstractAn n×m real matrix A is said to be totally positive (strictly totally positive) if every min...
AbstractFor any m×n matrix A we introduce a definition of strong rank revealing LU (RRLU) factorizat...
An algorithm is described for the nonnegative rank factorization (NRF) of some completely posi-tive ...
[EN] Let A be a rank deficient square matrix. We characterize the unique full rank Cholesky factoriz...
AbstractAn algorithm is described for the nonnegative rank factorization (NRF) of some completely po...
In the study of matrices, we are always searching for tools which allow us to simplify our investiga...
Abstract: A method based on elementary column and row operations of the factorization of nonnegative...
AbstractThe nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one ...
AbstractWe say that a rectangular matrix over a ring with identity is totally nonsingular (TNS) if f...
AbstractLet A be a real n × n matrix. A is TP (totally positive) if all the minors of A are nonnegat...