MATLAB Answers

LOBPCG Initial k eigenvectors approximation

3 views (last 30 days)
frank on 20 Jul 2012
Answered: Andrew Knyazev on 21 Sep 2018
I am currently working with the 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,

Answers (1)

Andrew Knyazev
Andrew Knyazev on 21 Sep 2018


Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!