Hostname: page-component-784d4fb959-wvrvt Total loading time: 0 Render date: 2025-07-14T15:10:42.029Z 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, Taiwan11102
Rights & Permissions [Opens in a new window]

Abstract

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.

Two-sided bounds are obtained for the maximal eigenvalue of a positive matrix by iterating computations of row sums. The result provides an algorithm for approximating the maximal eigenvalue of a nonnegative matrix.

Information

Type
Research Article
Information
Glasgow Mathematical Journal , Volume 39 , Issue 3 , September 1997 , pp. 276 - 284
Copyright
Copyright © Glasgow Mathematical Journal Trust 1997

References

REFERENCES

1.Kolotilina, L. Y., Lower bounds for the Perron root of a nonnegative matrix, Linear Algebra and Appl. 180 (1993), 133–151.Google Scholar
2.Liu, S. L., Bounds for the greatest characteristic root of a nonnegative matrix, Linear Algebra and Appl. 239 (1996), 151–160.CrossRefGoogle Scholar
3.Marcus, M. and Mine, H., Modern university algebra (Macmillan, New York, 1965).Google Scholar
4.Mine, H., Nonnegative matrices (John Wiley and Sons, New York, 1988).Google Scholar
5.Rojo, O. and Jimenez, R., A decreasing sequence of upper-bounds for the Perron root, Computer Math. Appl. No 8, 28 (1994), 9–15.Google Scholar
6.Wilkinson, J. H., The algebraic eigenvalue problem (Oxford Univ. Press, 1992).Google Scholar