Timeline for How to compute inverse of sum of a unitary matrix and a full rank diagonal matrix?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2022 at 22:38 | comment | added | Jorge Zuniga | Why not to use Cayley Hamilton Theorem?. You should need matrix powers and sums just up to n terms independent of spectral radious. I think this is one of the fastest way to compute such inverse, | |
| Nov 30, 2018 at 13:37 | comment | added | Federico Poloni | Note that computing two (unstructured) matrix products is already more expensive than one matrix inversion. | |
| Oct 30, 2018 at 17:13 | comment | added | Mark Meckes | Also, this may be more time-consuming than matrix inversion, but potentially more numerically stable. | |
| Oct 30, 2018 at 17:12 | comment | added | Mark Meckes | @RobertIsrael: True. To make this practically useful you would want to truncate the series after a small number of terms. If one of the spectral radii is very small you could justify that. | |
| Oct 30, 2018 at 17:04 | comment | added | Robert Israel | But the matrix multiplications needed to compute a lot of terms of this series may be more time-consuming than matrix inversion. | |
| Oct 30, 2018 at 16:37 | history | answered | Mark Meckes | CC BY-SA 4.0 |