Computing rank-deficiency of rectangular matrix pencils

DOI10.1016/0167-6911(87)90042-9zbMath0629.65045OpenAlexW2149301704MaRDI QIDQ1094094

Daniel L. Boley

Publication date: 1987

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6911(87)90042-9

zbMATH Keywords

quadratic convergencematrix pencilexperimental computational methodlocal minimum of the distance functionrank-deficiency

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Matrix pencils (15A22)

Related Items

Estimating the distance to uncontrollability: A fast method and a slow one, An algorithm for computing the distance to uncontrollability, The feedback search algorithm: estimating the distance of semi-explicit systems to \(\mathcal{R}\)-uncontrollability, A global minimum search algorithm for estimating the distance to uncontrollability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The codimension of singular matrix pairs
• The computation of Kronecker's canonical form of a singular pencil
• Between controllable and uncontrollable
• Fast projection methods for minimal design problems in linear system theory
• RGSVD—AN Algorithm for Computing the Kronecker Structure and Reducing Subspaces of Singular $A - \lambda B$ Pencils
• Properties of numerical algorithms related to computing controllability
• Algorithm 747: a Fortran subroutine to solve the eigenvalue assignment problem for multiinput systems using state feedback