Inverse iteration, if applied to a symmetric positive definite matrix, is shown to generate a sequence of iterates with monotonously decreasing Rayleigh quotients. We present sharp bounds from above and from below which highlight inverse iteration as a descent scheme for the Rayleigh quotient. Such estimates provide the background for the analysis of the behavior of the Rayleigh quotient in certain approximate variants of inverse iteration. key words: Symmetric eigenvalue problem; Inverse iteration; Rayleigh quotient. 1
We discuss variants of the Jacobi--Davidson method for solving the generalized complex symmetric eig...
We discuss variants of the Jacobi--Davidson method for solving the generalized complex symmetric eig...
We discuss variants of the Jacobi--Davidson method for solving the generalized complex symmetric eig...
In this paper we analyse inexact inverse iteration for the real symmet-ric eigenvalue problem Av = v...
We present new algorithms for refining the estimates of the eigenvectors of a real symmetric matrix....
AbstractThis paper analyses the effects of inaccurate linear solvers on the behaviour of inverse ite...
AbstractWe incorporate our recent preconditioning techniques into the classical inverse power (Rayle...
Abstract. The aim of this paper is to provide a convergence analysis for a preconditioned subspace i...
We incorporate our recent preconditioning techniques into the classical inverse power (Rayleigh quot...
AbstractIn this paper we analyse inexact inverse iteration for the real symmetric eigenvalue problem...
The algorithms of inverse iteration and Rayleigh quotient iteration for approximating an eigenpair o...
AbstractExamples are given of nonsymmetric matrices for which the Rayleigh Quotient Iteration fails ...
AbstractThe discretization of eigenvalue problems for partial differential operators is a major sour...
© 2014 Society for Industrial and Applied Mathematics. Consider a symmetric matrix A(v) ∈ ℝnxn depen...
ABSTRACT. The aim of this paper is to provide a convergence analysis for a precondi-tioned subspace ...
We discuss variants of the Jacobi--Davidson method for solving the generalized complex symmetric eig...
We discuss variants of the Jacobi--Davidson method for solving the generalized complex symmetric eig...
We discuss variants of the Jacobi--Davidson method for solving the generalized complex symmetric eig...
In this paper we analyse inexact inverse iteration for the real symmet-ric eigenvalue problem Av = v...
We present new algorithms for refining the estimates of the eigenvectors of a real symmetric matrix....
AbstractThis paper analyses the effects of inaccurate linear solvers on the behaviour of inverse ite...
AbstractWe incorporate our recent preconditioning techniques into the classical inverse power (Rayle...
Abstract. The aim of this paper is to provide a convergence analysis for a preconditioned subspace i...
We incorporate our recent preconditioning techniques into the classical inverse power (Rayleigh quot...
AbstractIn this paper we analyse inexact inverse iteration for the real symmetric eigenvalue problem...
The algorithms of inverse iteration and Rayleigh quotient iteration for approximating an eigenpair o...
AbstractExamples are given of nonsymmetric matrices for which the Rayleigh Quotient Iteration fails ...
AbstractThe discretization of eigenvalue problems for partial differential operators is a major sour...
© 2014 Society for Industrial and Applied Mathematics. Consider a symmetric matrix A(v) ∈ ℝnxn depen...
ABSTRACT. The aim of this paper is to provide a convergence analysis for a precondi-tioned subspace ...
We discuss variants of the Jacobi--Davidson method for solving the generalized complex symmetric eig...
We discuss variants of the Jacobi--Davidson method for solving the generalized complex symmetric eig...
We discuss variants of the Jacobi--Davidson method for solving the generalized complex symmetric eig...