eigs() runs faster for more eigenvalues of the same matrix
43 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
Ilya Tyuryukanov
le 12 Sep 2017
Modifié(e) : Walter Roberson
le 12 Août 2018
I'm a bit confused: running eigs() for 3..20 largest eingevalues/vectors of a ~3000x3000 sparse real symmetric matrix causes the following run times (in seconds, on Linux):
1.03 1.42 1.02 1.16 1.11 1.81 3.01 3.13 3.73 3.12 2.89 2.03 1.36 1.32 1.27 1.22 1.07 0.97 1.23
That is, solving for 9..14 eingepairs is more difficult, but the same eigenpairs (may be a tiny bit less accurate) can be obtained by computing the first 15 or 20 eigenvalues...
I'm running eigs with the following options:
opts.issym = 1;
opts.isreal = 1;
opts.disp = 0;
opts.maxit = 10000;
opts.tol = 2.2204e-16;
[V, v] = eigs(adj, k, 'la', opts);
The large max number of iterations is to get rid of possible NaN values in the solution.
0 commentaires
Réponse acceptée
Christine Tobler
le 12 Sep 2017
The reason is that the "search space" used in each iteration is determined based on the number of eigenvalues requested. By increasing k, the size of the subspace is increased, which in this case means that all eigenvalues can be found much faster. There's no way of knowing the optimal subspace size to use, EIGS just uses max(2*k, 20) by default. So increasing opts.p will have the same effect as asking for more eigenvalues.
The reason EIGS is having problems is that the largest eigenvalues of matrix adj are very close together, and the algorithm used in EIGS depends on a gap between eigenvalues.
An alternative would be to just call eig(full(A)) and compute all eigenvalues and eigenvectors. For this specific matrix, it could be faster than EIGS, since the matrix is real symmetric and has a difficult eigenvalue distribution for EIGS. On my machine, this took 2.5 seconds, while most EIGS calls I tried took about 1.5 seconds.
1 commentaire
Plus de réponses (1)
Andrew Knyazev
le 12 Août 2018
Modifié(e) : Walter Roberson
le 12 Août 2018
Please check https://www.mathworks.com/matlabcentral/fileexchange/48-lobpcg-m that has probably faster and more predictable convergence, compared to EIGS
0 commentaires
Voir également
Catégories
En savoir plus sur Eigenvalues & Eigenvectors dans Help Center et File Exchange
Produits
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!