Hostname: page-component-76fb5796d-22dnz Total loading time: 0 Render date: 2024-04-29T19:21:13.589Z Has data issue: false hasContentIssue false
  • English
  • Français

Inequalities for the Maximal Eigenvalue of a Nonnegative Matrix

Published online by Cambridge University Press:  18 May 2009

Lina Yeh
Lina Yeh
Affiliation:
Department of Mathematics, Soochow University, Taipei, Taiwan
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We gave an elementary proof of Theorem 4 in the paper, published in the Glasgow Mathematical Journal 39(1997), 275–284. The result provides an algorithm for approximating the maximal eigenvalue of a nonnegative matrix. Recently the author has learnt that the result can be proved immediately from Theorem 6.8 in [1]. Indeed, the paper [1] determines necessary and sufficient conditions for the convergence of an iterative sequence to the maximal eigenvalue. Their proof needs knowledge of graph theoretical concepts.

Type
Addendum
Information
Glasgow Mathematical Journal , Volume 40 , Issue 2 , May 1998 , pp. 297
Copyright
Copyright © Glasgow Mathematical Journal Trust 1998

References

1.Friedland, S. and Schneider, H., The growth of powers of a nonnegative matrix, SIAM J. Alg. Disc. Meth. 1 (1980), 185–200.CrossRefGoogle Scholar