Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
From MaRDI portal
Publication:5218397
Recommendations
- An indefinite variant of LOBPCG for definite matrix pencils
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- scientific article; zbMATH DE number 176177
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues
- Cluster robustness of preconditioned gradient subspace iteration eigensolvers
Cites work
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 766233 (Why is no real title available?)
- scientific article; zbMATH DE number 919117 (Why is no real title available?)
- scientific article; zbMATH DE number 4197271 (Why is no real title available?)
- A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration
- A Jacobi eigenreduction algorithm for definite matrix pairs
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
- A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
- A robust and efficient implementation of LOBPCG
- A simplified pivoting strategy for symmetric tridiagonal matrices
- Accurate Symmetric Indefinite Linear Equation Solvers
- An Improved Arc Algorithm for Detecting Definite Hermitian Pairs
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- An indefinite variant of LOBPCG for definite matrix pencils
- Analysis of the Diagonal Pivoting Method
- Basis selection in LOBPCG
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Block-oriented J-Jacobi methods for Hermitian matrices
- Canonical Forms for Hermitian Matrix Pairs under Strict Equivalence and Congruence
- Componentwise analysis of direct factorization of real symmetric and Hermitian matrices
- Convergence analysis of gradient iterations for the symmetric eigenvalue problem
- Damped oscillations of linear systems. A mathematical introduction
- Decomposition of a symmetric matrix
- Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
- Gradient flow approach to geometric convergence analysis of preconditioned eigensolvers
- Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Minimization of the computational labor in determining the first eigenvalues of differential operators
- Minimization principles and computation for the generalized linear response eigenvalue problem
- Minimization principles for the linear response eigenvalue problem. II: Computation
- NLEVP, a collection of nonlinear eigenvalue problems
- On preconditioned eigensolvers and invert-Lanczos processes
- Partial Pivoting Strategies for Symmetric Matrices
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues
- Preconditioning eigensolvers -- an Oxymoron?
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Templates for the Solution of Algebraic Eigenvalue Problems
- The block preconditioned steepest descent iteration for elliptic operator eigenvalue problems
- The hyperbolic quadratic eigenvalue problem
- The retraction algorithm for factoring banded symmetric matrices
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Trace minimization and definiteness of symmetric pencils
- Trace minimization principles for positive semi-definite pencils
- Variational and numerical methods for symmetric matrix pencils
Cited in
(8)- An indefinite variant of LOBPCG for definite matrix pencils
- Fast accurate eigenvalue methods for graded positive definite matrices
- Preconditioned iterative methods for a class of nonlinear eigenvalue problems
- On generalizing trace minimization principles
- A method for computing a few eigenpairs of large generalized eigenvalue problems
- Preconditioning for eigenproblems
- Detecting a hyperbolic quadratic eigenvalue problem by using a subspace algorithm
- Computing symplectic eigenpairs of symmetric positive-definite matrices via trace minimization and Riemannian optimization
Describes a project that uses
Uses Software
This page was built for publication: Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5218397)
