Complexity of finding the pseudoinverse matrix

ignougroup
Problem Detail: 

How many arithmetic operations are required to find a Moore–Penrose pseudoinverse matrix of a arbitrary field?

If the matrix is invertible and complex valued, then it’s just the inverse. Finding the inverse takes $O(n^omega)$ time, where $omega$ is the matrix multiplication constant. It is Theorem 28.2 in Introduction to Algorithms 3rd Edition. If the matrix $A$ has linearly independent rows or columns and complex valued, then the pseudoinverse matrix can be computed with $A^*(A A^*)^{-1}$ or $(A A^*)^{-1}A^*$ respectively, where $A^*$ is the conjugate transpose of $A$. In particular, this implies an $O(n^omega)$ time for finding the pseudoinverse of $A$. For general matrix, the algorithms I have seen uses QR decomposition or SVD, which seems to take $O(n^3)$ arithmetic operations in the worst case. Is there algorithms that uses fewer operations?

Asked By : Chao Xu

Answered By : Yuval Filmus

First of all, people tend to forget that $omega$ is an infimum. Whenever we write $O(n^omega)$, we actually mean for all $gamma > omega$, there is an algorithm running in time $O_gamma(n^gamma)$. Keller-Gehrig showed (among else) how to present a matrix $A$ in rank normal form in time $O(n^omega)$. If $A$ has rank $r$, then a rank normal form of $A$ is $$ S begin{pmatrix} I_r & 0 0 & 0 end{pmatrix} T $$ for some invertible $S,T$ of the appropriate dimensions; see also Algebraic Complexity Theory, Proposition 16.13 on page 435. Rank normal form is similar to the rank decomposition mentioned in the Wikipedia article, $A = XY$ where $X$ has $r$ columns and $Y$ has $r$ rows. Indeed, we can take $X$ to be the first $r$ columns of $S$, and $Y$ to be the first $r$ rows of $T$. Given this decomposition, Wikipedia gives a formula for the pseudoinverse using only Hermitian adjoint, matrix multiplication and matrix inverse. Therefore the pseudoinverse can be computed in time $O(n^omega)$.
Best Answer from StackOverflow

Question Source : http://cs.stackexchange.com/questions/24060