Timeline for Optimization version of the Sylvester equation
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 30, 2012 at 11:48 | vote | accept | Uday | ||
| Dec 27, 2012 at 11:25 | answer | added | Suvrit | timeline score: 6 | |
| Dec 27, 2012 at 5:52 | comment | added | Uday | @Igor Khavkine Yes, my interest is in the case when the matrices have overlapping spectra. I have edited the question to reflect this. | |
| Dec 27, 2012 at 5:50 | history | edited | Uday | CC BY-SA 3.0 |
added 162 characters in body
|
| Dec 27, 2012 at 0:16 | comment | added | Igor Khavkine | Oops, I meant "not disjoint", since that is the non-trivial case. | |
| Dec 26, 2012 at 20:12 | comment | added | Suvrit | the minimization version of the problem is a least-squares problem whose solution can be essentially characterized using the SVD of $I \otimes A - B^T\otimes I$....how helpful that is, I'm not sure. | |
| Dec 26, 2012 at 19:57 | comment | added | Igor Khavkine | Is the question asking to find the minimum of the norm as a function of the matrices $A$, $B$ and $C$ in case the spectra of $A$ and $B$ are disjoint? | |
| Dec 26, 2012 at 15:53 | answer | added | Betrand | timeline score: 3 | |
| Dec 26, 2012 at 15:40 | history | asked | Uday | CC BY-SA 3.0 |