Computing rank-deficiency of rectangular matrix pencils

DOI10.1016/0167-6911(87)90042-9MaRDI QIDQ1094094zbMATH OpenOpenAlexFDO

Authors Daniel 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

experimental computational methodlocal minimum of the distance functionmatrix pencilquadratic convergencerank-deficiency

Mathematics Subject Classification ID

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

Review text

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.

Recommendations

• Computing the nearest rank-deficient matrix polynomial
• On the distance to singularity via low rank perturbations
• Numerical Rank Deficiency in Matrix Products
• Estimating the Sensitivity of the Algebraic Structure of Pencils with Simple Eigenvalue Estimates
• Nearest rank deficient matrix polynomials

Cites work

• Algorithm 747: a Fortran subroutine to solve the eigenvalue assignment problem for multiinput systems using state feedback
• Between controllable and uncontrollable
• Fast projection methods for minimal design problems in linear system theory
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3658896 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• scientific article; zbMATH DE number 3256013 (Why is no real title available?)
• Properties of numerical algorithms related to computing controllability
• RGSVD—AN Algorithm for Computing the Kronecker Structure and Reducing Subspaces of Singular A - \lambda B Pencils
• The codimension of singular matrix pairs
• The computation of Kronecker's canonical form of a singular pencil

Cited in

(10)

• An algorithm for computing the distance to uncontrollability
• A global minimum search algorithm for estimating the distance to uncontrollability
• The feedback search algorithm: estimating the distance of semi-explicit systems to \(\mathcal{R}\)-uncontrollability
• scientific article; zbMATH DE number 6612007 (Why is no real title available?)
• A deflation method for regular matrix pencils
• Rank-deficient matrices as a computational tool
• Computing the nearest rank-deficient matrix polynomial
• scientific article; zbMATH DE number 6401305 (Why is no real title available?)
• Estimating the distance to uncontrollability: A fast method and a slow one
• Response performance and stability analysis of fixed-wing airplane by improved control technique

This page was built for publication: Computing rank-deficiency of rectangular matrix pencils

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094094)