Harmonic Ritz Values and Their Reciprocals
نویسنده
چکیده
One application of harmonic Ritz values is to approximate, with a projection method, the interior eigenvalues of a matrix A while avoiding the explicit use of the inverse A. In this context, harmonic Ritz values are commonly derived from a Petrov-Galerkin condition for the residual of a vector from the test space. In this paper, we investigate harmonic Ritz values from a slightly different perspective. We consider a bounded functional ψ that yields the reciprocals of the harmonic Ritz values of a symmetric matrix A. The crucial observation is that with an appropriate residual s that differs from the commonly used one, many results from Rayleigh quotient and Rayleigh-Ritz theory naturally extend. The same is true for the generalization to matrix pencils (A,B) when B is symmetric positive definite. These observations have an application in the computation of eigenvalues in the interior of the spectrum of a large sparse matrix. The minimum and maximum of ψ correspond to the eigenpairs just to the left and right of zero (or a chosen shift). As a spectral transformation, this distinguishes ψ from the original harmonic approach where an interior eigenvalue remains at the interior of the transformed spectrum. As a consequence, ψ is a very attractive vehicle for a matrix-free, optimization-based eigensolver such as the steepest descent, the nonlinear Preconditioned Conjugate Gradient (PCG), or the Locally Optimal Block PCG (LOBPCG) method. Instead of computing the smallest/largest eigenvalues by minimizing/maximizing the Rayleigh quotient, one can compute interior eigenvalues as the minimum/maximum of ψ. AMS subject classifications. 65F15, 65Y15.
منابع مشابه
Variations of Ritz and Lehmann Bounds
Eigenvalue estimates that are optimal in some sense have selfevident appeal and leave estimators with a sense of virtue and economy. So, it is natural that ongoing searches for effective strategies for difficult tasks such as estimating matrix eigenvalues that are situated well into the interior of the spectrum revisit from time to time methods that are known to yield optimal bounds. This artic...
متن کاملRitz and harmonic Ritz values and the convergence of FOM and GMRES
FOM and GMRES are Krylov subspace iterative methods for solving nonsymmetric linear systems. The Ritz values are approximate eigenvalues, which can be computed cheaply within these algorithms. In this paper, we generalise the concept of Harmonic Ritz values, introduced by Paige et al. for symmetric matrices, to nonsymmetric matrices. We show that the zeroes of the residual polynomials of FOM an...
متن کاملA Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices
The harmonic Lanczos bidiagonalization method can be used to compute the smallest singular triplets of a large matrix A. We prove that for good enough projection subspaces harmonic Ritz values converge if the columns of A are strongly linearly independent. On the other hand, harmonic Ritz values may miss some desired singular values when the columns of A are almost linearly dependent. Furthermo...
متن کاملThe convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
This paper concerns a harmonic projection method for computing an approximation to an eigenpair (λ, x) of a large matrix A. Given a target point τ and a subspace W that contains an approximation to x, the harmonic projection method returns an approximation (μ + τ, x̃) to (λ, x). Three convergence results are established as the deviation of x from W approaches zero. First, the harmonic Ritz value...
متن کاملAn Implicitly Restarted Lanczos Bidiagonalization Method for Computing Smallest Singular Triplets
We describe the development of a method for the efficient computation of the smallest singular values and corresponding vectors for large sparse matrices [4]. The method combines state-of-the-art techniques that make it a useful computational tool appropriate for large scale computations. The method relies upon Lanczos bidiagonalization (LBD) with partial reorthogonalization [6], enhanced with ...
متن کامل