On error bounds for eigenvalues of a matrix pencil
نویسندگان
چکیده
منابع مشابه
Accurate Error Bounds for the Eigenvalues of the Kernel Matrix
The eigenvalues of the kernel matrix play an important role in a number of kernel methods, in particular, in kernel principal component analysis. It is well known that the eigenvalues of the kernel matrix converge as the number of samples tends to infinity. We derive probabilistic finite sample size bounds on the approximation error of individual eigenvalues which have the important property th...
متن کاملBounds for eigenvalues of matrix polynomials
Upper and lower bounds are derived for the absolute values of the eigenvalues of a matrix polynomial (or λ-matrix). The bounds are based on norms of the coefficient matrices and involve the inverses of the leading and trailing coefficient matrices. They generalize various existing bounds for scalar polynomials and single matrices. A variety of tools are used in the derivations, including block ...
متن کاملThree Absolute Perturbation Bounds for Matrix Eigenvalues Imply Relative Bounds
We show that three well-known perturbation bounds for matrix eigenvalues imply relative bounds: the Bauer-Fike and Hooman-Wielandt theorems for diagonalisable matrices, and Weyl's theorem for Hermitian matrices. As a consequence, relative perturbation bounds are not necessarily stronger than absolute bounds; and the conditioning of an eigenvalue in the relative sense is the same as in the absol...
متن کاملThe Relation between Two Types of Error Bounds for Computed Matrix Eigenvalues
Two types of error bounds are considered for numerically enclosing all eigenvalues of a matrix. A theorem is presented for clarifying the relation between these two error bounds under an assumption. We discuss the validity of this assumption, and report some numerical results illustrating the presented theorem and showing that this assumption is satisfied in many cases.
متن کاملComputational Error Bounds for Multiple or Nearly Multiple Eigenvalues
In this paper bounds for clusters of eigenvalues of non-selfadjoint matrices are investigated. We describe a method for the computation of rigorous error bounds for multiple or nearly multiple eigenvalues, and for a basis of the corresponding invariant subspaces. The input matrix may be real or complex, dense or sparse. The method is based on a quadratically convergent Newton-like method; it in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1998
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(97)89324-x