✦ LIBER ✦

On the sum of two largest eigenvalues of a symmetric matrix

✍ Scribed by Javad Ebrahimi B; Bojan Mohar; Vladimir Nikiforov; Azhvan Sheikh Ahmady

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 107 KB
Volume: 429
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.06.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On lower bounds for the largest eigenval

On lower bounds for the largest eigenvalue of a symmetric matrix

✍ S.G. Walker; P. Van Mieghem 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 120 KB

On symmetric functions of the eigenvalue

On symmetric functions of the eigenvalues of the sum of two Hermitian matrices

✍ S.W. Drury 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 605 KB

On the two largest eigenvalues of trees

✍ M. Hofmeister 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 650 KB

Very little is known about upper bounds for the largest eigenvalues of a tree that depend only on the vertex number. Starting from a classical upper bound for the largest eigenvalue, some refinements can be obtained by successively removing trees from consideration. The results can be used to charac

A new type of lower bound for the larges

A new type of lower bound for the largest eigenvalue of a symmetric matrix

✍ Piet Van Mieghem 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 162 KB

Error bounds on the power method for det

Error bounds on the power method for determining the largest eigenvalue of a symmetric, positive definite matrix

✍ Joel Friedman 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 957 KB

Let A be a positive definite, symmetric matrix. We wish to determine the largest eigenvalue, 1,. We consider the power method, i.e. that of choosing a vector v. and setting vk = Akvo; then the Rayleigh quotients Rk = (Auk, vk)/( ok, ok) usually converge to 21 as k -+ 03 (here (u, v) denotes their in

Estimating the extremal eigenvalues of a

Estimating the extremal eigenvalues of a symmetric matrix

✍ V. Pan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Almtraet--Lower and upper bounds on the absolute values of the eigenvalues of an n x n real symmetric matrix A are given by (trace A ,,)t/m for both negative and positive even m. (The bounds are within a factor of 2 from the eigenvalues already for m > log 2 n.) We present algorithms for computing t