Timeline for Finding the smallest max eigenvalues for related matrices?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 28, 2014 at 20:29 | answer | added | Chris Godsil | timeline score: 1 | |
| Aug 28, 2014 at 19:02 | comment | added | Bryce C. | Good question, sorry if that wasn't clear. I mean that I want to simultaneously minimize the largest eigenvalue for both matrices, and since they are dependent on each other, that would imply that the difference between $\lambda_{1a}$ and $\lambda_{1b}$ is as close to zero as possible. | |
| Aug 28, 2014 at 18:56 | history | edited | Bryce C. | CC BY-SA 3.0 | hopefully made the tex more understandable |
| Aug 28, 2014 at 1:48 | comment | added | Chris Godsil | For a start it depends what you mean by "the smallest possible $\lambda_{1a}$ and $\lambda_{1b}$". Could you meand their sum? Their product? | |
| Aug 19, 2014 at 4:31 | history | edited | Bryce C. | CC BY-SA 3.0 | Improved matrix readability (hopefully) |
| Aug 18, 2014 at 4:38 | history | edited | Bryce C. | CC BY-SA 3.0 | added 1 character in body |
| Aug 18, 2014 at 4:26 | history | asked | Bryce C. | CC BY-SA 3.0 |