Dynamic normal forms and dynamic characteristic polynomial (Q633626): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.049 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074035802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly Optimal Algorithms for Canonical Matrix Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2702027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pointers versus addresses / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the matrix eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for dynamic algebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic matrix rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating finite markov chains by using techniques of group matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating $LU$ Factorizations for Computing Stationary Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric bounds for eigenvalues of Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational Matrix Functions and Rank-1 Updates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two uses for updating the partial singular value decomposition in latent semantic indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Downdating the Singular Value Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Divide-and-Conquer Algorithm for the Bidiagonal SVD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank

Latest revision as of 22:41, 3 July 2024

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