Weak monotonicity of \(A\) versus \(\{1\}\)-inverses nonnegative on the range space of \(A\) (Q2459959): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Generalized inverses. Theory and applications. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Inverses of nonnegative matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Eight types of matrix monotonicity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3431458 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of weak-monotone matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Range and group monotonicity of operators / rank | |||
Normal rank |
Latest revision as of 12:48, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Weak monotonicity of \(A\) versus \(\{1\}\)-inverses nonnegative on the range space of \(A\) |
scientific article |
Statements
Weak monotonicity of \(A\) versus \(\{1\}\)-inverses nonnegative on the range space of \(A\) (English)
0 references
9 November 2007
0 references
A matrix \(X\) is called a \(\{1\}\)-inverse of \(A\in\mathbb{R}^{m\times n}\) if \(AXA=A\). If \(x \in \mathbb{R}^n\) belongs to the nonnegative orthant \(\mathbb{R}^n_+\) of \(\mathbb{R}^n\), then we say \(x \geq 0\). A matrix \(A\in\mathbb{R}^{m\times n}\) is called weak monotone if \(Ax \geq 0\) implies that \(x\in \mathbb{R}_{+}^{n}+N(A)\), where \(N(A)\) denotes the kernel of \(A\). The authors affirmatively solve the problem raised by \textit{J. E. Paris} and \textit{B. Subiza} in [ibid. 166, 167--184 (1992; Zbl 0747.15007)] by showing that if \(A\) has a \(\{1\}\)-inverse \(X\) which is nonnegative on \(R(A)\), then \(A\) is weak monotone; and conversely, if \(A\) is weak monotone and possesses a nonnegative full rank factorization, then there is a \(\{1\}\)-inverse of \(A\) being nonnegative on \(R(A)\). By a full rank decomposition of \(A\) we mean a decomposition of the form \(A=BC\), where \(B\in \mathbb{R}^{m\times r}, C\in \mathbb{R}^{r\times n}\) with \(r= \text{rank}(A)= \text{rank}(B)= \text{rank}(C)\).
0 references
\(\{1\}\)-inverse
0 references
rank
0 references
generalized range monotonicity
0 references
full rank decomposition
0 references