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 μ+ τ converges to λ if a certain Rayleigh quotient matrix is uniformly nonsingular. Second, the harmonic Ritz vector x̃ converges to x if the Rayleigh quotient matrix is uniformly nonsingular and μ + τ remains well separated from the other harmonic Ritz values. Third, better error bounds for the convergence of μ+τ are derived when x̃ converges. However, we show that the harmonic projection method can fail to find the desired eigenvalue λ—in other words, the method can miss λ if it is very close to τ . To this end, we propose to compute the Rayleigh quotient ρ of A with respect to x̃ and take it as a new approximate eigenvalue. ρ is shown to converge to λ once x̃ tends to x, no matter how τ is close to λ. Finally, we show that if the Rayleigh quotient matrix is uniformly nonsingular, then the refined harmonic Ritz vector, or more generally the refined eigenvector approximation introduced by the author, converges. We construct examples to illustrate our theory.
منابع مشابه
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...
متن کاملPii: S0168-9274(01)00132-5
The harmonic Arnoldi method can be used to compute some eigenpairs of a large matrix, and it is more suitable for finding interior eigenpairs. However, the harmonic Ritz vectors obtained by the method may converge erratically and may even fail to converge, so that resulting algorithms may not perform well. To improve convergence, a refined harmonic Arnoldi method is proposed that replaces the h...
متن کاملA modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigenproblems
The harmonic block Arnoldi method can be used to find interior eigenpairs of large matrices. Given a target point or shift to which the needed interior eigenvalues are close, the desired interior eigenpairs are the eigenvalues nearest and the associated eigenvectors. However, it has been shown that the harmonic Ritz vectors may converge erratically and even may fail to do so. To do a better job...
متن کاملSome insights on restarting symmetric eigenvalue methods with Ritz and harmonic Ritz vectors
Eigenvalue iterative methods, such as Arnoldi and Jacobi-Davidson, are typically used with restarting. This has signiicant performance shortcomings, since important components of the invariant subspace may be discarded. One way of saving more information at restart is the idea of \thick" restarting which keeps more Ritz vectors than needed. Our previously proposed dynamic thick restarting choos...
متن کامل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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 74 شماره
صفحات -
تاریخ انتشار 2005