An indefinite variant of LOBPCG for definite matrix pencils
From MaRDI portal
Publication:403080
DOI10.1007/S11075-013-9754-3zbMATH Open1297.65040OpenAlexW1971291073MaRDI QIDQ403080FDOQ403080
Authors: Daniel Kressner, Marija Miloloža Pandur, Meiyue Shao 
Publication date: 29 August 2014
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/201147
Recommendations
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues
- Convergence analysis of a locally accelerated preconditioned steepest descent method for Hermitian-definite generalized eigenvalue problems
preconditioningnumerical experimentdefinite matrix pencilgeneralized Hermitian eigenvalue problemslocally optimal block preconditioned conjugate gradient (LOBPCG) methodminimization principleproduct eigenvalue problemsquadratic eigenvalue problems
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Preconditioners for iterative methods (65F08) Matrix pencils (15A22)
Cites Work
- NLEVP, a collection of nonlinear eigenvalue problems
- Templates for the Solution of Algebraic Eigenvalue Problems
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matrices and indefinite scalar products
- Damped oscillations of linear systems. A mathematical introduction
- Title not available (Why is that?)
- Canonical Forms for Hermitian Matrix Pairs under Strict Equivalence and Congruence
- Trace minimization and definiteness of symmetric pencils
- Trace minimization principles for positive semi-definite pencils
- Minimization principles for the linear response eigenvalue problem. II: Computation
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Basis selection in LOBPCG
- Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- A Jacobi eigenreduction algorithm for definite matrix pairs
- A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
- A geometric theory for preconditioned inverse iteration. II: Convergence estimates
- Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
- Symmetric rank revealing factorizations
- A geometric theory for preconditioned inverse iteration applied to a subspace
- Convergence analysis of gradient iterations for the symmetric eigenvalue problem
- Variational and numerical methods for symmetric matrix pencils
- Gradient flow approach to geometric convergence analysis of preconditioned eigensolvers
- Quadratic Residual Bounds for the Hermitian Eigenvalue Problem
- Title not available (Why is that?)
- Normwise Scaling of Second Order Polynomial Matrices
- Title not available (Why is that?)
- On Positive Semidefinite Matrices with Known Null Space
- Title not available (Why is that?)
- A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- Block-oriented \(J\)-Jacobi methods for Hermitian matrices
Cited In (16)
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- Cholesky-like factorization of symmetric indefinite matrices and orthogonalization with respect to bilinear forms
- Convergence theory for preconditioned eigenvalue solvers in a nutshell
- Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers
- Fast eigenpairs computation with operator adapted wavelets and hierarchical subspace correction
- Title not available (Why is that?)
- Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems
- Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
- Goal-oriented optimal approximations of Bayesian linear inverse problems
- Basis selection in LOBPCG
- A Chebyshev locally optimal block preconditioned conjugate gradient method for product and standard symmetric eigenvalue problems
- Backward perturbation analysis and residual-based error bounds for the linear response eigenvalue problem
- Computing symplectic eigenpairs of symmetric positive-definite matrices via trace minimization and Riemannian optimization
- A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
- A robust numerical algorithm for computing Maxwell's transmission eigenvalue problems
Uses Software
This page was built for publication: An indefinite variant of LOBPCG for definite matrix pencils
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403080)
