A new extension of Leverrier's algorithm (Q1210398)

From MaRDI portal
Revision as of 00:28, 15 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A new extension of Leverrier's algorithm
scientific article

    Statements

    A new extension of Leverrier's algorithm (English)
    0 references
    0 references
    0 references
    8 August 1993
    0 references
    A recursion derived by \textit{S.Barnett} [SIAM J. Matrix Anal. Appl. 10, No. 4, 551-556 (1989; Zbl 0682.65022)], for computing the inverse of a matrix polynomial by means of a Leverrier type recursion, is extended to the case of a singular leading term.
    0 references
    0 references
    Leverrier's algorithm
    0 references
    inverse
    0 references
    matrix polynomial
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references