The trace minimization method for the symmetric generalized eigenvalue problem
From MaRDI portal
Publication:1591180
DOI10.1016/S0377-0427(00)00391-5zbMath0964.65038MaRDI QIDQ1591180
Publication date: 26 June 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
eigenvectorgeneralized eigenvalue problemRayleigh-Ritz methodJacobi-Davidson schememinimization of trace
Related Items
A truncated-CG style method for symmetric generalized eigenvalue problems, Generalized spectral decomposition method for solving stochastic finite element equations: invariant subspace problem and dedicated algorithms, A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix, Weighted Trace-Penalty Minimization for Full Configuration Interaction, Two Conjectures on the Stokes Complex in Three Dimensions on Freudenthal Meshes, Iterative diagonalization of symmetric matrices in mixed precision and its application to electronic structure calculations, Parallel Hybrid Sparse Linear System Solvers, Unnamed Item, Recent developments in spectral stochastic methods for the numerical solution of stochastic partial differential equations, An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration, TRACEMIN-Fiedler: A Parallel Algorithm for Computing the Fiedler Vector, An alternate gradient method for optimization problems with orthogonality constraints, Preconditioning constrained eigenvalue problems, The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software, A generalized spectral decomposition technique to solve a class of linear stochastic partial differential equations, On correction equations and domain decomposition for computing invariant subspaces, Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization, Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property, Inverse, Shifted Inverse, and Rayleigh Quotient Iteration as Newton's Method, A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems, Computing Symplectic Eigenpairs of Symmetric Positive-Definite Matrices via Trace Minimization and Riemannian Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer Eigenwertprobleme
- A Lanczos-type algorithm for the generalized eigenvalue problem Ax=lambdaBx
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Computing eigenvalues of very large symmetric matrices. An implementation of a Lanczos algorithm with no reorthogonalization
- Finite hybrid elements to compute the ideal magnetohydrodynamic spectrum of an axisymmetric plasma
- Robust preconditioning of large, sparse, symmetric eigenvalue problems
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- Computational aspects of F. L. Bauer's simultaneous iteration method
- Accelerating the orthogonal iteration for the eigenvectors of a Hermitian matrix
- Simultaneous iteration method for symmetric matrices
- The Lanczos Algorithm With Partial Reorthogonalization
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- The Lanczos Algorithm with Selective Orthogonalization
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- The Davidson Method
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A method of solving the partial eigenvalue problem
- The evaluation of eigenvalues and eigenvectors of real symmetric matrices by simultaneous iteration
- Solution methods for eigenvalue problems in structural mechanics