Timeline for Algorithm for the smallest (algebraic) eigenvalues of a symmetric (sparse) matrix
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 17, 2011 at 13:41 | comment | added | Antoine Levitt | That's basically SA (when the matrix is symmetric). It's extremely slow, presumably because the positive spectrum is so large (largest eigenvalues are proportional to the inverse square of the stepsize of the grid), and it messes up the convergence. | |
| Nov 17, 2011 at 13:37 | history | answered | Federico Poloni | CC BY-SA 3.0 |