Triangularized orthogonalization-free method for solving extreme eigenvalue problems
From MaRDI portal
Publication:2103436
Recommendations
- A fast continuous method for the extreme eigenvalue problem
- A subspace accelerated truncated Newton algorithm for solving the extreme eigenvalue of a large-scale sparse symmetric matrix
- Barzilai-Borwein-like methods for the extreme eigenvalue problem
- Global convergence of triangularized orthogonalization-free method
- An Inverse Extreme Eigenpair Problem and Its Parallel Iterative Solution for Symmetric Tridiagonal Matrices
Cites work
- A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
- A Broyden class of quasi-Newton methods for Riemannian optimization
- A feasible method for optimization with orthogonality constraints
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
- An accelerated conjugate gradient algorithm to compute low-lying eigenvalues -- a study for the Dirac operator in SU(2) lattice QCD
- An efficient Gauss-Newton algorithm for symmetric low-rank product matrix approximations
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Bold diagrammatic Monte Carlo in the lens of stochastic iterative methods
- Computing several eigenpairs of Hermitian problems by conjugate gradient iterations
- Coordinatewise descent methods for leading eigenvalue problem
- ELSI: a unified software interface for Kohn-Sham electronic structure solvers
- Existence and computation of generalized Wannier functions for non-periodic systems in two dimensions and higher
- FEAST as a subspace iteration eigensolver accelerated by approximate spectral projection
- First-order methods almost always avoid strict saddle points
- Gradient flow based Kohn-Sham density functional theory model
- Gradient type optimization methods for electronic structure calculations
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Numerical methods for electronic structure calculations of materials
- Optimization methods for large-scale machine learning
- Orbital minimization method with \(\ell^{1}\) regularization
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- Preconditioning orbital minimization method for planewave discretization
- Rayleigh quotient based optimization methods for eigenvalue problems
- Self-consistent-field calculations using Chebyshev-filtered subspace iteration
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- The vectorization of ITPACK 2C
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Trace-penalty minimization for large-scale eigenspace computation
- Triangularized orthogonalization-free method for solving extreme eigenvalue problems
Cited in
(6)- Triangularized orthogonalization-free method for solving extreme eigenvalue problems
- Global convergence of triangularized orthogonalization-free method
- Weighted Trace-Penalty Minimization for Full Configuration Interaction
- Triangularized Orthogonalization-free Method for Solving Extreme Eigenvalue Problems
- On the convergence of orthogonalization-free conjugate gradient method for extreme eigenvalues of Hermitian matrices: a Riemannian optimization interpretation
- Risk modeling and assessment with a logical-probabilistic scenario
This page was built for publication: Triangularized orthogonalization-free method for solving extreme eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103436)
