Computing the generic jordan canonical form (Q3203922): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1080/03081089108818048 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969086058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Jordan Canonical Form: An Old Proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3721676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of the invariant factors and the rank of principal submatrices of a matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems analysis by graphs and matroids. Structural solvability and controllability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Rank of Powers of a Matrix of a Given Pattern / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:23, 21 June 2024

scientific article
Language Label Description Also known as
English
Computing the generic jordan canonical form
scientific article

    Statements

    Computing the generic jordan canonical form (English)
    0 references
    0 references
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    generic Jordan canonical form
    0 references
    sparse matrices
    0 references
    complexity reduction
    0 references
    graph-theoretical approach
    0 references
    Jordan blocks
    0 references
    zero/nonzero pattern of the matrix
    0 references
    \(O(n^ 4\log \,n)\) time algorithm
    0 references
    0 references