Timeline for How to combine linear constraints on a matrix and its inverse?
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 22, 2010 at 12:39 | answer | added | Tsuyoshi Ito | timeline score: 4 | |
| Aug 7, 2010 at 21:26 | answer | added | Aaron Meyerowitz | timeline score: 0 | |
| Aug 7, 2010 at 10:25 | comment | added | Federico Poloni | Do you need this problem in its full generality, or only a special subcase? Could you argument a bit more on the context in which you need it? From what I know, the general problem "here is a bunch of equations in several variables, each of degree 2, on a finite field, tell me if they have a solution" is NP-hard, but some special cases can be solved using special tricks (e.g., reducing it to an eigenvalue problem). | |
| Jul 9, 2010 at 22:49 | answer | added | Mau | timeline score: 0 | |
| Jul 9, 2010 at 22:15 | comment | added | Jack Huizenga | Without having some sort of special structure to your matrix (for instance orthogonality would drastically simplify things), I doubt you can really say anything. As you note, the problem amounts to describing the locus of solutions to some polynomials in n^2 variables. Typically you can do no better than to describe the solution locus in terms of those polynomials. | |
| Jul 9, 2010 at 21:44 | history | asked | Frederick Eberhardt | CC BY-SA 2.5 |