Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
From MaRDI portal
Publication:5218397
DOI10.1553/etna_vol51s331zbMath1431.65046OpenAlexW2982663907MaRDI QIDQ5218397
Publication date: 3 March 2020
Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://etna.mcs.kent.edu/volumes/2011-2020/vol51/abstract.php?vol=51&pages=331-362
spectral gapeigenpairdefinite matrix pairdefiniteness intervaldefinitizing shiftindefinite LOBPCGpreconditioned steepest descent/ascent iteration
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Preconditioners for iterative methods (65F08)
Related Items
An indefinite variant of LOBPCG for definite matrix pencils ⋮ Detecting a hyperbolic quadratic eigenvalue problem by using a subspace algorithm ⋮ A method for computing a few eigenpairs of large generalized eigenvalue problems ⋮ On generalizing trace minimization principles ⋮ 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
- Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
- An indefinite variant of LOBPCG for definite matrix pencils
- Damped oscillations of linear systems. A mathematical introduction
- Block-oriented \(J\)-Jacobi methods for Hermitian matrices
- Basis selection in LOBPCG
- On preconditioned eigensolvers and invert-Lanczos processes
- A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
- Minimization of the computational labor in determining the first eigenvalues of differential operators
- Decomposition of a symmetric matrix
- Preconditioning eigensolvers -- an Oxymoron?
- A Jacobi eigenreduction algorithm for definite matrix pairs
- Componentwise analysis of direct factorization of real symmetric and Hermitian matrices
- Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
- A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
- Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
- Trace minimization and definiteness of symmetric pencils
- Trace minimization principles for positive semi-definite pencils
- Minimization principles and computation for the generalized linear response eigenvalue problem
- The block preconditioned steepest descent iteration for elliptic operator eigenvalue problems
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- Minimization Principles for the Linear Response Eigenvalue Problem II: Computation
- THE HYPERBOLIC QUADRATIC EIGENVALUE PROBLEM
- Convergence Analysis of Gradient Iterations for the Symmetric Eigenvalue Problem
- NLEVP
- Variational and numerical methods for symmetric matrix pencils
- The retraction algorithm for factoring banded symmetric matrices
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Gradient Flow Approach to Geometric Convergence Analysis of Preconditioned Eigensolvers
- An Improved Arc Algorithm for Detecting Definite Hermitian Pairs
- A simplified pivoting strategy for symmetric tridiagonal matrices
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Accurate Symmetric Indefinite Linear Equation Solvers
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- Templates for the Solution of Algebraic Eigenvalue Problems
- A Robust and Efficient Implementation of LOBPCG
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Canonical Forms for Hermitian Matrix Pairs under Strict Equivalence and Congruence
- Analysis of the Diagonal Pivoting Method
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- Partial Pivoting Strategies for Symmetric Matrices
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues
