lobpcg.m

lobpcg.m, MATLAB implementation of the locally optimal block preconditioned conjugate gradient method: Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method. We describe new algorithms of the locally optimal block preconditioned conjugate gradient (LOBPCG) method for symmetric eigenvalue problems, based on a local optimization of a three-term recurrence, and suggest several other new methods. To be able to compare numerically different methods in the class, with different preconditioners, we propose a common system of model tests, using random preconditioners and initial guesses. As the “ideal” control algorithm, we advocate the standard preconditioned conjugate gradient method for finding an eigenvector as an element of the null-space of the corresponding homogeneous system of linear equations under the assumption that the eigenvalue is known. We recommend that every new preconditioned eigensolver be compared with this “ideal” algorithm on our model test problems in terms of the speed of convergence, costs of every iteration, and memory requirements. We provide such comparison for our LOBPCG method. Numerical results establish that our algorithm is practically as efficient as the “ideal” algorithm when the same preconditioner is used in both methods. We also show numerically that the LOBPCG method provides approximations to first eigenpairs of about the same quality as those by the much more expensive global optimization method on the same generalized block Krylov subspace. We propose a new version of block Davidson’s method as a generalization of the LOBPCG method. Finally, direct numerical comparisons with the Jacobi-Davidson method show that our method is more robust and converges almost two times faster.


References in zbMATH (referenced in 130 articles , 1 standard article )

Showing results 1 to 20 of 130.
Sorted by year (citations)

1 2 3 ... 5 6 7 next

  1. Jolivet, Pierre; Roman, Jose E.; Zampini, Stefano: KSPHPDDM and PCHPDDM: extending PETSc with advanced Krylov methods and robust multilevel overlapping Schwarz preconditioners (2021)
  2. Krumnow, Christian; Pfeffer, Max; Uschmajew, André: Computing eigenspaces with low rank constraints (2021)
  3. Li, Ji; Cai, Jian-Feng; Zhao, Hongkai: Scalable incremental nonconvex optimization approach for phase retrieval (2021)
  4. Li, Tianyi; Abdelmoula, Radhi: Gradient damage analysis of a cylinder under torsion: bifurcation and size effects (2021)
  5. Miao, Cun-Qiang; Wu, Wen-Ting: On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems (2021)
  6. Williamson, Kevin; Cho, Heyrim; Sousedík, Bedřich: Application of adaptive ANOVA and reduced basis methods to the stochastic Stokes-Brinkman problem (2021)
  7. Ezvan, Olivier; Zeng, Xiaoshu; Ghanem, Roger; Gencturk, Bora: Multiscale modal analysis of fully-loaded spent nuclear fuel canisters (2020)
  8. Ferrari, Federico; Sigmund, Ole: Towards solving large-scale topology optimization problems with buckling constraints at the cost of linear analyses (2020)
  9. Kelley, C. T.; Bernholc, J.; Briggs, E. L.; Hamilton, Steven; Lin, Lin; Yang, Chao: Mesh independence of the generalized Davidson algorithm (2020)
  10. Lu, Ding: Nonlinear eigenvector methods for convex minimization over the numerical range (2020)
  11. Miao, Cun-Qiang: On Chebyshev-Davidson method for symmetric generalized eigenvalue problems (2020)
  12. Nakatsukasa, Yuji: Sharp error bounds for Ritz vectors and approximate singular vectors (2020)
  13. Xu, Fei; Xie, Hehu; Zhang, Ning: A parallel augmented subspace method for eigenvalue problems (2020)
  14. Zhang, Lei-Hong; Yang, Wei Hong; Shen, Chungen; Ying, Jiaqi: An eigenvalue-based method for the unbalanced Procrustes problem (2020)
  15. Altmann, R.; Peterseim, D.: Localized computation of eigenstates of random Schrödinger operators (2019)
  16. Dax, Achiya: Computing the smallest singular triplets of a large matrix (2019)
  17. Elman, Howard C.; Su, Tengfei: Low-rank solution methods for stochastic eigenvalue problems (2019)
  18. Goldenberg, Steven; Stathopoulos, Andreas; Romero, Eloy: A Golub-Kahan Davidson method for accurately computing a few singular triplets of large sparse matrices (2019)
  19. Heinlein, Alexander; Klawonn, Axel; Knepper, Jascha; Rheinbach, Oliver: Adaptive GDSW coarse spaces for overlapping Schwarz methods in three dimensions (2019)
  20. Hu, Jiang; Jiang, Bo; Lin, Lin; Wen, Zaiwen; Yuan, Ya-Xiang: Structured quasi-Newton methods for optimization with orthogonality constraints (2019)

1 2 3 ... 5 6 7 next