Timeline for Simultaneous special orthogonal similarity problem
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 1, 2016 at 10:35 | history | edited | joro | CC BY-SA 3.0 |
added 527 characters in body
|
| Jan 1, 2016 at 10:25 | comment | added | joro | @Arul So far my answer is wrong. I need additional nonlinear constraint $det(O)=\pm$. If the linear system doesn't have solution, it is not needed. | |
| Jan 1, 2016 at 10:01 | comment | added | joro | @Arul I didn't wrote this. Search the web for solutions of linear equations. There might no solution. | |
| Jan 1, 2016 at 9:58 | comment | added | user76479 | it seems to me that you are implying there are always infinite solutions | |
| Jan 1, 2016 at 9:51 | history | edited | joro | CC BY-SA 3.0 |
added 81 characters in body
|
| Jan 1, 2016 at 9:49 | comment | added | joro | @Arul Yes, you have exactly n^2 variables, but the system is linear. If $K$ is a field, just compute basis of the big linear system. It might have infinitely many solutions. Ask about complexity of solving linear equations if you doubt "efficiently". | |
| Jan 1, 2016 at 9:41 | comment | added | user76479 | how do you know 'efficiently solvable'? I have $n^2/2$ variable at a minimum and also are you claiming O is unique? | |
| Jan 1, 2016 at 9:38 | history | answered | joro | CC BY-SA 3.0 |