
THE NATURAL RIGHT AND THE NATURAL LEFT INVERSES OF RECTANGULAR MATRICES
Author(s) -
Alexander Abian,
Paula Kemp
Publication year - 1990
Publication title -
tamkang journal of mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 18
eISSN - 0049-2930
pISSN - 2073-9826
DOI - 10.5556/j.tkjm.21.1990.4690
Subject(s) - inverse , mathematics , transpose , combinatorics , rank (graph theory) , matrix (chemical analysis) , natural number , discrete mathematics , geometry , eigenvalues and eigenvectors , physics , chemistry , chromatography , quantum mechanics
If an $m$ by $n$ with $m < n$ matrix $A$ has a right inverse then it has infinitely many right inverses. In fact, $K (AK )^{-1}$ is a right inverse of $A$ for many $n$ by $m$ matrices $K$ of rank $m$. The natural choice for $K$ is the transpose $A'$ of $A$. Thus, we call $A'(AA')^{-1}$ the natural right inverse of $A$. It can be used (not so obviously) to solve $AX = C$ yielding the solution $X = A'(AA')^{-1}C$ which minimizes the length $||X||$. Similarly, if an $n$ by $m$ with $m < n$ matrix $B$ has a left inverse, we call $(B'B)^{-1}B'$ the natural left inverse of $B$. It can be used (in an obvious way) in an attempt "to solve" $BX =C$ yielding the best approximate solution $X =(B'B)^{-1}B'C$ which minimizes the error $|| BX||$.