Timeline for Find optimal value for a regularization parameter in generalized eigenvalue problem
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 13, 2016 at 8:21 | comment | added | Federico Poloni | Yes, QZ uses no inverses, it is backward stable, and it is implemented in most scientific computing software (Matlab, R, scipy...). The only problem with it is that it is not backward stable in a way that preserves symmetry, so the computed eigenvalues may have a small imaginary part instead of being real (but I think that if you have formed the product $\Sigma_{XX}$ you have already lost hope of preserving realness). Maybe you can fix this, too, with a generalized SVD, if I understand your notation correctly. Check Section 8.7 of Golub-Van Loan, Matrix computations, 4th ed. | |
| Feb 12, 2016 at 23:11 | comment | added | user41037 | The issue is also that both matrices $\Sigma_{XX}$ and $\Sigma_{XY}\Sigma_{YX}$ are ill-conditioned. | |
| Feb 12, 2016 at 21:55 | comment | added | user41037 | It is a problem with large matrices but they are not sparse. And thank you for QZ, i did not know this method. You mean that with QZ method, one can solved this generalized eigenvalue problem whithout adding the regularization parameter ? | |
| Feb 12, 2016 at 21:13 | comment | added | Federico Poloni | Is this a problem with large and sparse matrices? Because otherwise you shouldn't be doing inverses to compute eigenvalues, but rather use a backward stable method such as QZ, which avoids the issue completely. | |
| Feb 12, 2016 at 18:55 | history | asked | user41037 | CC BY-SA 3.0 |