LOBPCG Initial k eigenvectors approximation
2 visualizzazioni (ultimi 30 giorni)
Mostra commenti meno recenti
Hello,
I am currently working with the lobpcg.py code in python to solve for the eigenvalues and eigenvectors of large sparse matrices. I noticed that the solution is quite sensitive to the initial eigenvectors approximations X.
I am currently using a random function to generate the initial approximations and wanted to know if there is a better about doing this. Could I use a fixed X? Which X could I use to ensure that it will work for many different matrices and still converge?
Thank you,
Frank
0 Commenti
Risposte (1)
Andrew Knyazev
il 21 Set 2018
See https://en.wikipedia.org/wiki/LOBPCG#Convergence_theory_and_practice
0 Commenti
Vedere anche
Categorie
Scopri di più su Eigenvalues & Eigenvectors in Help Center e File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!