A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
From MaRDI portal
Cited in
(40)- Preconditioning constrained eigenvalue problems
- On correction equations and domain decomposition for computing invariant subspaces
- Absolute and relative Weyl theorems for generalized eigenvalue problems
- An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
- Accelerated simultaneous iterations for large finite element eigenproblems
- Unconstrained energy functionals for electronic structure calculations
- Wielandt and Ky-Fan theorem for matrix pairs.
- The trace minimization method for the symmetric generalized eigenvalue problem
- Conditional gradient method for double-convex fractional programming matrix problems
- Trace minimization and definiteness of symmetric pencils
- On conjugate gradient-like methods for eigen-like problems
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- Trace minimization principles for positive semi-definite pencils
- Iterative diagonalization of symmetric matrices in mixed precision and its application to electronic structure calculations
- Block minimum perturbation algorithm based on block Arnoldi process for nonsymmetric linear systems with multiple right-hand sides
- On generalizing trace minimization principles
- Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory
- Quantum algorithm for Laplacian eigenmap via Rayleigh quotient iteration
- Trace-penalty minimization for large-scale eigenspace computation
- Barzilai-Borwein-like methods for the extreme eigenvalue problem
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
- TRACEMIN-Fiedler: a parallel algorithm for computing the Fiedler vector
- Inverse, shifted inverse, and Rayleigh quotient iteration as Newton's method
- Parallel hybrid sparse linear system solvers
- Optimal low-rank approximations of Bayesian linear inverse problems
- A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- Computing symplectic eigenpairs of symmetric positive-definite matrices via trace minimization and Riemannian optimization
- Symplectic eigenvalues of positive-semidefinite matrices and the trace minimization theorem
- The eigenvalues slicing library (EVSL): algorithms, implementation, and software
- Goal-oriented optimal approximations of Bayesian linear inverse problems
- On generalizing trace minimization principles. II
- Gradient-type subspace iteration methods for the symmetric eigenvalue problem
- A generalized canonical metric for optimization on the indefinite Stiefel manifold
- Identification robust inference for the risk premium in term structure models
- On the modification of an eigenvalue problem that preserves an eigenspace
- Generalized pseudospectral shattering and inverse-free matrix pencil diagonalization
- On a shrink-and-expand technique for symmetric block eigensolvers
- A truncated-CG style method for symmetric generalized eigenvalue problems
- Computing several eigenpairs of Hermitian problems by conjugate gradient iterations
This page was built for publication: A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3956309)
