Computing rank-deficiency of rectangular matrix pencils (Q1094094): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Between controllable and uncontrollable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: RGSVD—AN Algorithm for Computing the Kronecker Structure and Reducing Subspaces of Singular $A - \lambda B$ Pencils / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast projection methods for minimal design problems in linear system theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5542360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 747: a Fortran subroutine to solve the eigenvalue assignment problem for multiinput systems using state feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of numerical algorithms related to computing controllability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3857636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of Kronecker's canonical form of a singular pencil / rank
 
Normal rank
Property / cites work
 
Property / cites work: The codimension of singular matrix pairs / rank
 
Normal rank

Latest revision as of 12:08, 18 June 2024

scientific article
Language Label Description Also known as
English
Computing rank-deficiency of rectangular matrix pencils
scientific article

    Statements

    Computing rank-deficiency of rectangular matrix pencils (English)
    0 references
    1987
    0 references
    From author's summary: We examine a method to find the distance from an arbitrary given matrix pencil to a nearby rank-deficient one. We propose an experimental computational method that exhibits quadratic convergence to a local minimum of the distance function.
    0 references
    rank-deficiency
    0 references
    matrix pencil
    0 references
    experimental computational method
    0 references
    quadratic convergence
    0 references
    local minimum of the distance function
    0 references
    0 references

    Identifiers