An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
From MaRDI portal
Publication:4785924
DOI10.1137/S1064827500382579zbMath1016.65017OpenAlexW2060488365MaRDI QIDQ4785924
Publication date: 5 January 2003
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1064827500382579
convergence analysisiteration methodJacobi-Davidson methodinner/outer iterationKrylov basisinverse freeno inversionpencil problempreconditioning schemesymmetric generalized eigenvalue problems
Related Items (52)
On global convergence of subspace projection methods for Hermitian eigenvalue problems ⋮ A truncated-CG style method for symmetric generalized eigenvalue problems ⋮ A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices ⋮ A Rayleigh-Ritz style method for large-scale discriminant analysis ⋮ Optimal Low-rank Approximations of Bayesian Linear Inverse Problems ⋮ Computing eigenpairs in augmented Krylov subspace produced by Jacobi-Davidson correction equation ⋮ Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods ⋮ Applications of gauge duality in robust principal component analysis and semidefinite programming ⋮ An efficient algorithm for solving the generalized trust region subproblem ⋮ Locally optimal and heavy ball GMRES methods ⋮ Preconditioned Locally Harmonic Residual Method for Computing Interior Eigenpairs of Certain Classes of Hermitian Matrices ⋮ A refined variant of the inverse-free Krylov subspace method for symmetric generalized eigenvalue problems ⋮ On local quadratic convergence of inexact simplified Jacobi-Davidson method for interior eigenpairs of Hermitian eigenproblems ⋮ THE HYPERBOLIC QUADRATIC EIGENVALUE PROBLEM ⋮ A new justification of the Jacobi-Davidson method for large eigenproblems ⋮ Iterative minimization of the Rayleigh quotient by block steepest descent iterations ⋮ Fixed support positive-definite modification of covariance matrix estimators via linear shrinkage ⋮ On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems ⋮ Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ Two Conjectures on the Stokes Complex in Three Dimensions on Freudenthal Meshes ⋮ Goal-Oriented Optimal Approximations of Bayesian Linear Inverse Problems ⋮ Computing the smallest singular triplets of a large matrix ⋮ The generalized trust region subproblem ⋮ \(n\)-widths, sup-infs, and optimality ratios for the \(k\)-version of the isogeometric finite element method ⋮ On Chebyshev-Davidson method for symmetric generalized eigenvalue problems ⋮ Updating component reduction bases of static and vibration modes using preconditioned iterative techniques ⋮ TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems ⋮ ADMM for the SDP relaxation of the QAP ⋮ Continuous methods for symmetric generalized eigenvalue problems ⋮ Augmented block Householder Arnoldi method ⋮ On local quadratic convergence of inexact simplified Jacobi-Davidson method ⋮ The power method and beyond ⋮ An inexact spectral bundle method for convex quadratic semidefinite programming ⋮ Computing eigenpairs of Hermitian matrices in perfect Krylov subspaces ⋮ Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems ⋮ Deflation by restriction for the inverse-free preconditioned Krylov subspace method ⋮ Preconditioned Lanczos method for generalized Toeplitz eigenvalue problems ⋮ PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations ⋮ Preconditioned gradient iterations for the eigenproblem of definite matrix pairs ⋮ EIGIFP ⋮ A simple extrapolation method for clustered eigenvalues ⋮ Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem ⋮ Toward Quantifying Vertex Similarity in Networks ⋮ Rayleigh quotient minimization method for symmetric eigenvalue problems ⋮ A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems ⋮ A method for computing a few eigenpairs of large generalized eigenvalue problems ⋮ 3-D nested eigenanalysis on finite element grids ⋮ On generalizing trace minimization principles ⋮ Quantum algorithms for the generalized eigenvalue problem ⋮ Triangularized orthogonalization-free method for solving extreme eigenvalue problems ⋮ A Block Arnoldi Method for the SPN Equations
Uses Software
This page was built for publication: An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
