Trace minimization method via penalty for linear response eigenvalue problems
From MaRDI portal
Publication:2083411
DOI10.3934/jimo.2021206OpenAlexW4206715557MaRDI QIDQ2083411
Shanshan Liu, Yadan Chen, Yuan Shen
Publication date: 10 October 2022
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2021206
Nonlinear programming (90C30) Eigenvalues, singular values, and eigenvectors (15A18) Numerical solution of eigenvalue problems involving ordinary differential equations (65L15)
Cites Work
- Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
- A block Chebyshev-Davidson method for linear response eigenvalue problems
- A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process
- A KQZ algorithm for solving linear-response eigenvalue equations
- Weighted Golub-Kahan-Lanczos bidiagonalization algorithms
- Convergence analysis of Lanczos-type methods for the linear response eigenvalue problem
- Trace-penalty minimization for large-scale eigenspace computation
- Limited Memory Block Krylov Subspace Optimization for Computing Dominant Singular Value Decompositions
- Minimization Principles for the Linear Response Eigenvalue Problem II: Computation
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Numerical Methods for Electronic Structure Calculations of Materials
- An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations
- Calculating the Singular Values and Pseudo-Inverse of a Matrix