Bounds on the extreme generalized eigenvalues of Hermitian pencils
Fargues, Monique P.
MetadataShow full item record
We present easily computable bounds on the extreme generalized eigenvalues of Hermitian pencils (R,B) with finite eigenvalues and positive definite B matrices. The bounds are derived in terms of the generalized eigenvalues of the subpencil of maximum dimension contained in (R,B). Known results based on the generalization of the Gershgorin theorem and norm inequalities are presented and compared to the proposed bounds. It is shown that the new bounds compare favorably with these known results; they are easier to compute, require less restrictions on the properties of the pencils studied, and they are in an average sense tighter than those obtained with the norm inequality bounds
NPS Report NumberNPS-62-90-016
Showing items related by title, author, creator and subject.
Gragg, William B.; Ammar, Gregory S.; Reichel, Lother (Monterey, California. Naval Postgraduate School, 1988-11); NPS-53-89-005We consider the numerical construction of a unitary Hessenberg matrix from spectral data using an inverse QR algorithm. Any unitary upper Hessenberg matrix H with nonnegative subdiagonal elements can be represented by 2n ...
Florkowski, Stanley F. (Monterey, California. Naval Postgraduate School, 2008-12);In Graph Theory, every graph can be expressed in terms of certain real, symmetric matrices derived from the graph, most notably the adjacency or Laplacian matrices. Spectral Graph Theory focuses on the set of eigenvalues ...
Parallel Divide and Conquer Algorithms for the Symmetric Tridiagonal Eigenproblem and Bidiagonal Singular Value Problem Borges, Carlos F.; Gragg, William B.; Thornton, John R.; Warner, Daniel D. (Monterey, California: Naval Postgraduate School., 1993-06-10);Recent advances [2, 7, 9, 13] can improve run times for certain matrix eigen-value problems by orders of magnitude. In this paper we consider applying permutations to real symmetric tridiagonal matrix T to produce a ...