Abstract
Two easily computable sequences of bounds on the subdominant modulus of an eigenvalue of a square nonnegative matrix are obtained. In particular it is shown that the sequences converge to the subdominant modulus. A sequence of bounds generated by a method of Brauer (1971) turns out to be a subsequence of one of our sequences. Thus, our results imply the convergence of Brauer's sequence.
| Original language | English |
|---|---|
| Pages (from-to) | 61-75 |
| Number of pages | 15 |
| Journal | Linear Algebra and Its Applications |
| Volume | 87 |
| Issue number | C |
| DOIs | |
| State | Published - Mar 1987 |
Fingerprint
Dive into the research topics of 'Iterative methods for approximating the subdominant modulus of an eigenvalue of a nonnegative matrix'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver