Triangularized Orthogonalization-free Method for Solving Extreme Eigenvalue Problems
arXiv:2005.12161
Abstract
A novel orthogonalization-free method together with two specific algorithms are proposed to solve extreme eigenvalue problems. On top of gradient-based algorithms, the proposed algorithms modify the multi-column gradient such that earlier columns are decoupled from later ones. Global convergence to eigenvectors instead of eigenspace is guaranteed almost surely. Locally, algorithms converge linearly with convergence rate depending on eigengaps. Momentum acceleration, exact linesearch, and column locking are incorporated to further accelerate both algorithms and reduce their computational costs. We demonstrate the efficiency of both algorithms on several random matrices with different spectrum distribution and matrices from computational chemistry.
References in corpus (8)
- Exponential localization of Wannier functions in insulators
- ELSI: A Unified Software Interface for Kohn-Sham Electronic Structure Solvers
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- Coordinate descent full configuration interaction
- Optimal Orbital Selection for Full Configuration Interaction (OptOrbFCI): Pursuing the Basis Set Limit under a Budget
- Existence and computation of generalized Wannier functions for non-periodic systems in two dimensions and higher
- Bold Diagrammatic Monte Carlo in the Lens of Stochastic Iterative Methods
- Adaptive Step Size Strategy for Orthogonality Constrained Line Search Methods