Related papers: Compact Schemes for $A^+B$, $A^+AB$ and $AA^+B$
We give a constructive characterization of matrices satisfying the reverse-order law for the Moore--Penrose pseudoinverse. In particular, for a given matrix $A$ we construct another matrix $B$, of arbitrary compatible size and chosen rank,…
This paper gives three formulas for the pseudoinverse of a matrix product $A = CR$. The first is sometimes correct, the second is always correct, and the third is almost never correct. But that third randomized pseudoinverse $A^+_r$ may be…
This paper studies the set of $n\times n$ matrices for which all row and column sums equal zero. By representing these matrices in a lower dimensional space, it is shown that this set is closed under addition and multiplication, and…
In this article we provide a fast computational method in order to calculate the Moore-Penrose inverse of singular square matrices and of rectangular matrices. The proposed method proves to be much faster and has significantly better…
We investigate the Moore-Penrose pseudoinverse and generalized inverse of a matrix product $A=CR$ to establish a unifying framework for generalized and randomized matrix inverses. This analysis is rooted in first principles, focusing on the…
Let $X\in\mathbb{C}^{m\times m}$ and $Y\in\mathbb{C}^{n\times n}$ be nonsingular matrices, and let $N\in\mathbb{C}^{m\times n}$. Explicit expressions for the Moore-Penrose inverses of $M=XNY$ and a two-by-two block matrix, under appropriate…
A Moore--Penrose inverse of an arbitrary complex matrix A is defined as a unique matrix A' such that AA'A=A, A'AA'=A', and AA', A'A are Hermite matrices. We show that this definition has a natural generalization in the context of shortly…
In this paper we analyzed solutions of some complex matrix equations related to pseudoinverses using the concept of reproductivity. Especially for matrix equation AXB=C it is shown that Penrose's general solution is actually the case of the…
We consider the problem of finding nonzero eigenvalues and the corresponding eigenvectors of a matrix $AA^{\top}$, where $A$ is a special incidence matrix; This matrix can equivalently be defined based on a match relation between some…
We develop the first stochastic incremental method for calculating the Moore-Penrose pseudoinverse of a real matrix. By leveraging three alternative characterizations of pseudoinverse matrices, we design three methods for calculating the…
Let $\mathbb{C}^{n\times n}$ be the set of all $n \times n$ complex matrices. For any Hermitian positive semi-definite matrices $A$ and $B$ in $\mathbb{C}^{n\times n}$, their new common upper bound less than $A+B-A:B$ is constructed, where…
An algorithm for computing {2, 3}, {2, 4}, {1, 2, 3}, {1, 2, 4} -inverses and the Moore-Penrose inverse of a given rational matrix A is established. Classes A(2, 3)s and A(2, 4)s are characterized in terms of matrix products (R*A)+R* and…
One of the fundamental research problems in the theory of generalized inverses of matrices is to establish reverse order laws for generalized inverses of matrix products. Under the assumption that $A$, $B$, and $C$ are three nonsingular…
An expression for the Moore-Penrose inverse of a matrix of the form M = XNY , where X and Y are nonsingular, has been recently established by Castro-Gonz\'alez et al. [1, Theorem 2.2]. The expression plays an essential role in developing…
This paper deals with necessary and sufficient condition for consistency of the matrix equation $AXB = C$. We will be concerned with the minimal number of free parameters in Penrose's formula $X = A^(1)CB^(1) + Y - A^(1)AYBB^(1)$ for…
We present explicit formulas for Moore-Penrose inverses of some families of set inclusion matrices arising from sets, vector spaces, and designs.
Pseudoinverses are ubiquitous tools for handling over- and under-determined systems of equations. For computational efficiency, sparse pseudoinverses are desirable. Recently, sparse left and right pseudoinverses were introduced, using…
The aim of this work is to characterize linear maps of inner pro\-duct infinite-dimensional vector spaces where the Moore-Penrose inverse exists. This MP inverse generalizes the well-known Moore-Penrose inverse of a matrix $A\in…
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some of the output variables are also input variables, linked by a linear dependency. Fundamental examples…
We address the question as to when it is true that $(A+B)^{\dagger}=A^{\dagger}+B^{\dagger},$ where $\dagger$ denotes the Moore-Penrose inverse. A similar question is addressed for the group inverse.