The moore-penrose inverse of a free matrix

被引:0
|
作者
Britz, Thomas [1 ]
机构
[1] Univ New S Wales, Sch Math & Stat, Sydney, NSW 2052, Australia
来源
关键词
free matrix; moore-penrose inverse; bipartite graph; directed graph;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A matrix is free, or generic, if its nonzero entries are algebraically independent. Necessary and sufficient combinatorial conditions are presented for a complex free matrix to have a free Moore-Penrose inverse. These conditions extend previously known results for square, nonsingular free matrices. The result used to prove this characterization relates the combinatorial structure of a free matrix to that of its Moore-Penrose inverse. 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 described explicitly. Finally, it is proved that a free matrix contains at most as many nonzero entries as does its Moore-Penrose inverse.
引用
收藏
页码:208 / 215
页数:8
相关论文
共 50 条