Inexact inverse subspace iteration for generalized eigenvalue problems
DOI10.1016/J.LAA.2010.08.001zbMATH Open1215.65069OpenAlexW2051833651MaRDI QIDQ630516FDOQ630516
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
convergenceeigenvectorspreconditionergeneralized eigenvalue probleminner-outer iterationinverse subspace iterationinexact inner iteration
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Preconditioners for iterative methods (65F08)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Templates for the Solution of Algebraic Eigenvalue Problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
- Inexact Rayleigh quotient-type methods for eigenvalue computations
- Inexact inverse iteration for symmetric matrices
- The method of conjugate gradients used in inverse iteration
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- A Truncated RQ Iteration for Large Scale Eigenvalue Calculations
- 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
- 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 Subspace Iteration with Preconditioning Applied to Non-Hermitian Eigenvalue Problems
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
Cited In (14)
- Eigenvalue topology optimization via efficient multilevel solution of the frequency response
- Efficient inversion of the Galerkin matrix of general second-order elliptic operators with nonsmooth coefficients
- Inexact inverse subspace iteration with preconditioning applied to quadratic matrix polynomials
- Title not available (Why is that?)
- BCR algorithm for solving quadratic inverse eigenvalue problems for partially bisymmetric matrices
- Convergence theory for inexact inverse iteration applied to the generalised nonsymmetric eigenproblem
- An efficient algorithm based on Lanczos type of BCR to solve constrained quadratic inverse eigenvalue problems
- Title not available (Why is that?)
- Computing the smallest singular triplets of a large matrix
- Inexact Inverse Iteration with Variable Shift for Nonsymmetric Generalized Eigenvalue Problems
- Convergence and preconditioning of inexact inverse subspace iteration for generalized eigenvalue problems
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Inexact inverse iteration for generalized eigenvalue problems
- On local quadratic convergence of inexact simplified Jacobi-Davidson method
Uses Software
This page was built for publication: Inexact inverse subspace iteration for generalized eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q630516)
