Global algorithms for maximal eigenpair (Q1690469)

From MaRDI portal
Revision as of 23:24, 14 July 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
Global algorithms for maximal eigenpair
scientific article

    Statements

    Global algorithms for maximal eigenpair (English)
    0 references
    19 January 2018
    0 references
    The author extends the results from his previous paper on efficient algorithms for computing the maximal eigenpair of irreducible matrices with nonnegative off-diagonal elements. Two algorithms are proposed in this respect: the first one is based on (specific) Rayleigh quotient iteration and the second one on shifted inverse iteration. Numerical experiments and comparisons with previous methods are also provided.
    0 references
    maximal eigenpair
    0 references
    shifted inverse iteration
    0 references
    global algorithm
    0 references
    irreducible matrices
    0 references
    Rayleigh quotient iteration
    0 references
    numerical experiments
    0 references
    0 references

    Identifiers