Timeline for Calculating a generalized inverse (Moore–Penrose pseudoinverse)
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 28, 2014 at 13:07 | vote | accept | MthQ | ||
| Feb 27, 2014 at 19:22 | answer | added | Nathaniel Johnston | timeline score: 5 | |
| Feb 27, 2014 at 13:53 | comment | added | MthQ | That indeed looks promising, Paglia. $V_n$ and $V_n^*$ both seem to have a simple structure. | |
| Feb 27, 2014 at 13:36 | comment | added | Paglia | One possibility for you to compute $L_n^+$ is to find a diagonalization $L_n = V_n D_n V_n^*$ ($L_n$ seems to be diagonalizable in this case, I run some Matlab tests) and then put $L_n^+ = V_n D_n^+ V_n^*$, where the pseudoinverse of the diagonal matrix $D_n$ is easily computable: you just have to take the reciprocal of each non-zero element on the main diagonal, and leave the zeros elements at their own place. | |
| Feb 27, 2014 at 13:18 | comment | added | Carlo Beenakker | the pseudoinverse of $L_n$ has some obvious structure, each row or column adds up to zero. | |
| Feb 27, 2014 at 12:48 | history | edited | MthQ | CC BY-SA 3.0 |
added 2 characters in body
|
| Feb 27, 2014 at 12:25 | history | asked | MthQ | CC BY-SA 3.0 |