Search
Results: 6
Shift for nonsymmetric generalised eigenvalue problems
In this paper we analyze inexact inverse iteration for the nonsymmetric generalized eigenvalue problem Ax = λMx, where M is symmetric positive definite and the problem is diagonalizable. Our analysis is designed to apply to the...
Rayleigh quotient iteration and simplified Jacobi-Davidson method with preconditioned iterative solves
We show that for the non-Hermitian eigenvalue problem simplified Jacobi-Davidson with preconditioned Galerkin-Krylov solves is equivalent to inexact Rayleigh quotient iteration where the preconditioner is altered by a simple...
Rayleigh quotient iteration and simplified Jacobi-Davidson method with preconditioned iterative solves
We show that for the non-Hermitian eigenvalue problem simplified Jacobi-Davidson with preconditioned Galerkin-Krylov solves is equivalent to inexact Rayleigh quotient iteration where the preconditioner is altered by a simple...
Inexact inverse subspace iteration with preconditioning applied to non-Hermitian eigenvalue problems
Convergence results are provided for inexact inverse subspace iteration applied to the problem of finding the invariant subspace associated with a small number of eigenvalues of a large sparse matrix. These results are...
Shift for nonsymmetric generalised eigenvalue problems
In this paper we analyze inexact inverse iteration for the nonsymmetric generalized eigenvalue problem Ax = λMx, where M is symmetric positive definite and the problem is diagonalizable. Our analysis is designed to apply to the...
Inexact inverse subspace iteration with preconditioning applied to non-Hermitian eigenvalue problems
Convergence results are provided for inexact inverse subspace iteration applied to the problem of finding the invariant subspace associated with a small number of eigenvalues of a large sparse matrix. These results are...