Iterative methods for approximating the subdominant modulus of an eigenvalue of a nonnegative matrix (Q1092608)

From MaRDI portal
Revision as of 12:41, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Iterative methods for approximating the subdominant modulus of an eigenvalue of a nonnegative matrix
scientific article

    Statements

    Iterative methods for approximating the subdominant modulus of an eigenvalue of a nonnegative matrix (English)
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    Considered is an irreducible nonnegative square matrix B where, by assumption, the spectral radius \(\rho\) (B) and a corresponding positive eigenvector w are known. In terms of \(\rho\) (B) and w, two easily computable sequences of bounds on the subdominant modulus of an eigenvalue are introduced, and their convergence to the subdominant modulus are shown. A sequence of bounds generated by a method of \textit{A. Brauer} [Numer. Math. 17, 163-165 (1971; Zbl 0206.464)] turns out to be a subsequence of one of the two sequences under consideration. Thus, the results presented imply the convergence of Brauer's sequence.
    0 references
    0 references
    0 references
    0 references
    0 references
    irreducible nonnegative square matrix
    0 references
    spectral radius
    0 references
    positive eigenvector
    0 references
    subdominant modulus of an eigenvalue
    0 references
    convergence
    0 references
    sequence of bounds
    0 references
    0 references