Publication date
April 2012
DOI Publisher
Elsevier Inc. ISSN
0024-3795 Citation count (estimate)
1Abstract
AbstractA uniqueness theorem for an LU decomposition of a totally nonnegative matrix is obtained
AbstractA uniqueness theorem for an LU decomposition of a totally nonnegative matrix is obtained
AbstractWe present an algorithm for nonnegative matrices that decides about the primitivity and the ...
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...
AbstractA uniqueness theorem for an LU decomposition of a totally nonnegative matrix is obtained
AbstractLet A be a real n × n matrix. A is TP (totally positive) if all the minors of A are nonnegat...
AbstractLet A be a real n × n matrix. A is TP (totally positive) if all the minors of A are nonnegat...
An m-by-n matrix A is called totally nonnegative (resp. totally positive) if the determinant of ever...
An m-by-n matrix A is called totally nonnegative (resp. totally positive) if the determinant of ever...
AbstractSuppose A is an n×n nonnegative matrix. Necessary and sufficient conditions are given for A ...
An m-by- n matrix A is called totally nonnegative if every minor of A is nonnegative. The Hadamard p...
An m-by- n matrix A is called totally nonnegative if every minor of A is nonnegative. The Hadamard p...
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 positive (strictly totally positive) if every min...
AbstractAn n × n real matrix A is an STP (strictly totally positive) matrix if all its minors are st...
AbstractAn m-by-n matrix A is called totally nonnegative if every minor of A is nonnegative. The Had...
AbstractWe present an algorithm for nonnegative matrices that decides about the primitivity and the ...
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...
AbstractA uniqueness theorem for an LU decomposition of a totally nonnegative matrix is obtained
AbstractLet A be a real n × n matrix. A is TP (totally positive) if all the minors of A are nonnegat...
AbstractLet A be a real n × n matrix. A is TP (totally positive) if all the minors of A are nonnegat...
An m-by-n matrix A is called totally nonnegative (resp. totally positive) if the determinant of ever...
An m-by-n matrix A is called totally nonnegative (resp. totally positive) if the determinant of ever...
AbstractSuppose A is an n×n nonnegative matrix. Necessary and sufficient conditions are given for A ...
An m-by- n matrix A is called totally nonnegative if every minor of A is nonnegative. The Hadamard p...
An m-by- n matrix A is called totally nonnegative if every minor of A is nonnegative. The Hadamard p...
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 positive (strictly totally positive) if every min...
AbstractAn n × n real matrix A is an STP (strictly totally positive) matrix if all its minors are st...
AbstractAn m-by-n matrix A is called totally nonnegative if every minor of A is nonnegative. The Had...
AbstractWe present an algorithm for nonnegative matrices that decides about the primitivity and the ...
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...
Add to ORKG