Dynamic normal forms and dynamic characteristic polynomial (Q633626)

From MaRDI portal
Revision as of 22:41, 3 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
Dynamic normal forms and dynamic characteristic polynomial
scientific article

    Statements

    Dynamic normal forms and dynamic characteristic polynomial (English)
    0 references
    29 March 2011
    0 references
    The paper is concerned with the computation of the characteristic polynomial of a matrix and the associated eigenproblem. The authors analyze the dynamic complexity of these fundamental problems, devise efficient algorithms, prove matching lower bounds, and study the arithmetic complexity of the problem.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Characteristic polynomial
    0 references
    matrix normal form
    0 references
    eigenproblem
    0 references
    dynamic algorithm
    0 references
    lower bound
    0 references
    arithmetic complexity
    0 references
    0 references