An indefinite variant of LOBPCG for definite matrix pencils
From MaRDI portal
(Redirected from Publication:403080)
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
Cites work
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 1471817 (Why is no real title available?)
- scientific article; zbMATH DE number 2163265 (Why is no real title available?)
- scientific article; zbMATH DE number 919117 (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 geometric theory for preconditioned inverse iteration applied to a subspace
- A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
- A geometric theory for preconditioned inverse iteration. II: Convergence estimates
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
- 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
- Convergence analysis of gradient iterations for the symmetric eigenvalue problem
- Damped oscillations of linear systems. A mathematical introduction
- Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
- 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
- Matrices and indefinite scalar products
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Minimization principles for the linear response eigenvalue problem. II: Computation
- NLEVP, a collection of nonlinear eigenvalue problems
- Normwise Scaling of Second Order Polynomial Matrices
- On Positive Semidefinite Matrices with Known Null Space
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- Quadratic Residual Bounds for the Hermitian Eigenvalue Problem
- Symmetric rank revealing factorizations
- Templates for the Solution of Algebraic Eigenvalue Problems
- 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
(16)- Cholesky-like factorization of symmetric indefinite matrices and orthogonalization with respect to bilinear forms
- A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
- A robust numerical algorithm for computing Maxwell's transmission eigenvalue problems
- Convergence theory for preconditioned eigenvalue solvers in a nutshell
- Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- Backward perturbation analysis and residual-based error bounds for the linear response eigenvalue problem
- Fast eigenpairs computation with operator adapted wavelets and hierarchical subspace correction
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
- Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems
- Basis selection in LOBPCG
- Computing symplectic eigenpairs of symmetric positive-definite matrices via trace minimization and Riemannian optimization
- Goal-oriented optimal approximations of Bayesian linear inverse problems
- scientific article; zbMATH DE number 7626767 (Why is no real title available?)
- A Chebyshev locally optimal block preconditioned conjugate gradient method for product and standard symmetric eigenvalue problems
- Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory
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)
