Inexact inverse subspace iteration for generalized eigenvalue problems

DOI10.1016/J.LAA.2010.08.001zbMath1215.65069OpenAlexW2051833651MaRDI QIDQ630516

Qiang Ye, Ping Zhang

Publication date: 17 March 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.08.001

zbMATH Keywords

convergenceeigenvectorsgeneralized eigenvalue problempreconditionerinner-outer iterationinverse subspace iterationinexact inner iteration

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Preconditioners for iterative methods (65F08)

Related Items (7)

An efficient algorithm based on Lanczos type of BCR to solve constrained quadratic inverse eigenvalue problems ⋮ Computing the smallest singular triplets of a large matrix ⋮ Convergence and preconditioning of inexact inverse subspace iteration for generalized eigenvalue problems ⋮ On local quadratic convergence of inexact simplified Jacobi-Davidson method ⋮ Eigenvalue topology optimization via efficient multilevel solution of the frequency response ⋮ BCR algorithm for solving quadratic inverse eigenvalue problems for partially bisymmetric matrices ⋮ Inexact inverse subspace iteration with preconditioning applied to quadratic matrix polynomials

Uses Software

• JDQR
• JDQZ

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence of inexact inverse iteration with application to preconditioned iterative solvers
• The effects of inexact solvers in algorithms for symmetric eigenvalue problems
• Inexact inverse iteration for generalized eigenvalue problems
• Inexact Rayleigh quotient-type methods for eigenvalue computations
• Robust preconditioning of large, sparse, symmetric eigenvalue problems
• Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
• Inexact inverse iteration for symmetric matrices
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• A Truncated RQ Iteration for Large Scale Eigenvalue Calculations
• Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
• Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
• Templates for the Solution of Algebraic Eigenvalue Problems
• Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• Inexact Inverse Subspace Iteration with Preconditioning Applied to Non-Hermitian Eigenvalue Problems
• The method of conjugate gradients used in inverse iteration

This page was built for publication: Inexact inverse subspace iteration for generalized eigenvalue problems