vol13_pp405-418. 153KB Jun 04 2011 12:05:54 AM
Teks penuh
Garis besar
Dokumen terkait
In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m × n matrices and of square matrices with at least one zero row
Linear complementarity problem, Moore-Penrose inverse, Verified solution, Abso- lute value equation. AMS
Because generalized inverse of a matrix is not necessarily unique, the rank of a matrix expression involving generalized inverses of matrices may vary with respect.. to the choice
Schur complement, LU factorization, Bipartite graph, Sign pattern, Zero pattern, Nearly reducible matrix, Minimally strongly connected digraph.. AMS
Also, it is proved that the bipartite graph or, equivalently, the zero pattern of a free matrix uniquely determines that of its Moore-Penrose inverse, and this mapping is
Closed-form formulas are derived for the rank and inertia of submatrices of the Moore–Penrose inverse of a Hermitian matrix.. A variety of consequences on the nonsingularity,
In this paper, we present some results relating different matrix partial orderings and the reverse order law for the Moore-Penrose inverse and group inverse.. Special attention is
In this paper, we study the Moore-Penrose inverse of a symmetric rank-one perturbed matrix from which a finite method is proposed for the minimum-norm least-squares solution to
