Results 1 to 10 of about 622,326 (127)
Intervals of totally nonnegative matrices
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jürgen Garloff, Mohammad Adm
exaly +7 more sources
Totally nonnegative (0,1)-matrices [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Steve Kirkland
exaly +5 more sources
The Hadamard core of the totally nonnegative matrices [PDF]
A subclass of totally nonnegative matrices (TN matrices) whose Hadamard product with any TN matrix is again TN is studied. The properties of such matrices in the Hadamard core are discussed concerning the rank of a TN matrix, the set of column vectors that can be inserted into a given matrix in the Hadamard core, tridiagonal matrices, a description of ...
Shaun Fallat, Alissa S Crans
exaly +6 more sources
On Perron complements of totally nonnegative matrices [PDF]
The Perron complement of a principal submatrix of an irreducible totally nonnegative \(n\times n\) matrix \(A\) is discussed. Conditions are studied for which the Perron complement of a totally nonnegative matrix is also totally nonnegative. It is found that this complement is totally nonnegative if the complementary index set is based on consecutive ...
Shaun Fallat
exaly +4 more sources
Multiplicative principal-minor inequalities for totally nonnegative matrices [PDF]
An \(n\times n\) matrix \(A\) is called totally nonnegative (TN) if every minor of \(A\) is nonnegative. Several inequalities are known among products of principal minors, especially for positive definite and TN matrices. Examples of these inequalities are the Hadamard, Fischer and Koteljanskii inequalities.
Shaun Fallat
exaly +5 more sources
Interlacing inequalities for totally nonnegative matrices [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chi-Kwong Li, Roy Mathias
exaly +3 more sources
Accurate Computations with Totally Nonnegative Matrices [PDF]
We consider the problem of performing accurate computations with rectangular $(m\times n)$ totally nonnegative matrices. The matrices under consideration have the property of having a unique representation as products of nonnegative bidiagonal matrices. Given that representation, one can compute the inverse, LDU decomposition, eigenvalues, and SVD of a
Plamen Koev
exaly +3 more sources
Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices [PDF]
This paper presents new algorithms that compute all eigenvalues and singular values of nonsingular totally nonnegative (TN) matrices, matrices all of whose minors are nonnegative, to high relative accuracy. Any nonsingular TN matrix can be represented uniquely as a product of nonnegative bidiagonal matrices BD(A), using an elementary elimination ...
Plamen Koev
exaly +3 more sources
Inequalities in Products of Minors of Totally Nonnegative Matrices [PDF]
A matrix is called totally nonnegative if each of its minors is nonnegative and totally positive if the minors are positive. A more traditional terminology called these matrices, respectively, totally positive and strictly totally positive, but those denominations are becoming more used.
Mark Skandera
exaly +3 more sources
The g-theorem matrices are totally nonnegative
Let \(M_d\) be the matrix whose \((i,j)\)-entry for \(0 \leq i \leq \lfloor d/2 \rfloor\) and \(0 \leq j \leq d\) is \[ \binom{d+1-i}{d+1-j} - \binom{i}{d+1-j}. \] For a simplicial \(d\)-polytope with \(f\)-vector \((f_{-1},f_0,\ldots,f_{d-1})\), its \(g\)-vector \((g_0,\ldots,g_{\lfloor d/2 \rfloor})\) is such that \(f = gM_d\). \textit{A.
Michael Bjorklund, Alexander Engstrom
exaly +3 more sources

