LOBPCG Initial k eigenvectors approximation

2 次查看（过去 30 天）
frank
frank 2012-7-20
回答： Andrew Knyazev 2018-9-21
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

请先登录，再回答此问题。

回答（1 个）

Andrew Knyazev
Andrew Knyazev 2018-9-21
See https://en.wikipedia.org/wiki/LOBPCG#Convergence_theory_and_practice

类别

在 Help Center 和 File Exchange 中查找有关 Eigenvalues & Eigenvectors 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by