vol17_pp543-576. 274KB Jun 04 2011 12:06:01 AM
Teks penuh
Garis besar
Dokumen terkait
Galois group, Generalized Laguerre Polynomial, Newton Polygon. This work was supported by the National Science Foundation under
‡ Research supported in part by National Security Agency
We then use the basic fact that all totally positive nonsingular square matrices are products of matrices with strictly positive diagonal entries, and all other entries zero aside
The converse is also studied: given an SDD matrix C with the structure of a k -subdirect sum and positive diagonal entries, it is shown that there are two SDD matrices whose
In this section we extend the results of Section 2 for idempotent matrices of the form (2.2) for some Schur complements with zero diagonal entries.. We start with the following
In the context of invertible M-matrices (i.e., when B ≥ 0), condition (ii) of Theorem 4.3 is associated with diagonal dominance of AD because the diagonal entries are positive and
This is a variant on the symmetric minimum rank problem for a simple graph , which asks for a determination of the minimum rank among all real symmetric matrices whose
For example, in [3], it is shown that a positive semigroup whose diagonal entries are binary (equal to 0 or 1), is either decomposable, or similar, via a positive diagonal
