Triangularized orthogonalization-free method for solving extreme eigenvalue problems
From MaRDI portal
Publication:2103436
DOI10.1007/s10915-022-02025-0OpenAlexW4307157157MaRDI QIDQ2103436
Weiguo Gao, Bichen Lu, Yingzhou Li
Publication date: 13 December 2022
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.12161
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items
Weighted Trace-Penalty Minimization for Full Configuration Interaction ⋮ Triangularized orthogonalization-free method for solving extreme eigenvalue problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
- Self-consistent-field calculations using Chebyshev-filtered subspace iteration
- Computing several eigenpairs of Hermitian problems by conjugate gradient iterations
- A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- An accelerated conjugate gradient algorithm to compute low-lying eigenvalues -- a study for the Dirac operator in SU(2) lattice QCD
- Orbital minimization method with \(\ell^{1}\) regularization
- Triangularized orthogonalization-free method for solving extreme eigenvalue problems
- Existence and computation of generalized Wannier functions for non-periodic systems in two dimensions and higher
- Trace-penalty minimization for large-scale eigenspace computation
- First-order methods almost always avoid strict saddle points
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- Gradient Type Optimization Methods For Electronic Structure Calculations
- FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral Projection
- A Broyden Class of Quasi-Newton Methods for Riemannian Optimization
- The vectorization of ITPACK 2C
- Rayleigh Quotient Based Optimization Methods for Eigenvalue Problems
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- Bold diagrammatic Monte Carlo in the lens of stochastic iterative methods
- Optimization Methods for Large-Scale Machine Learning
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Gradient Flow Based Kohn--Sham Density Functional Theory Model
- Numerical Methods for Electronic Structure Calculations of Materials
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- CoordinateWise Descent Methods for Leading Eigenvalue Problem
- An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations
- Preconditioning Orbital Minimization Method for Planewave Discretization
- ELSI: a unified software interface for Kohn-Sham electronic structure solvers
