✦ LIBER ✦

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

✍ Scribed by Piet Van Mieghem

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 162 KB
Volume: 427
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2007.06.027

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

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

On the sum of two largest eigenvalues of

On the sum of two largest eigenvalues of a symmetric matrix

✍ Javad Ebrahimi B; Bojan Mohar; Vladimir Nikiforov; Azhvan Sheikh Ahmady 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 107 KB

A lower bound for the product of eigenva

A lower bound for the product of eigenvalues of solutions to matrix equations

✍ Mehdi Dehghan; Masoud Hajarian 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 276 KB

are encountered in many systems and control applications, and these matrix equations contain several linear matrix equations as special cases. In the present work, we introduce the inequalities for the determinant of the solutions of these matrix equations, separately. Then using these inequalities,

Improvable bounds on the largest eigenva

Improvable bounds on the largest eigenvalue of a completely positive finite element flexibility matrix

✍ Isaac Fried; Michael Coleman 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 192 KB

A new upper bound for eigenvalues of the

A new upper bound for eigenvalues of the laplacian matrix of a graph

✍ Li Jiong-Sheng; Zhang Xiao-Dong 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 270 KB

We first give a result on eigenvalues of the line graph of a graph. We then use the result to present a new upper bound for eigenvalues of the Laplacian matrix of a graph. Moreover we determine all graphs the largest eigenvalue of whose Laplacian matrix reaches the upper bound.