Computing Most Nearly Rank-Reducing Structured Matrix Perturbations

DOI10.1137/S089547989222758XMaRDI QIDQ4325682zbMATH OpenOpenAlexFDO

Authors M. Wicks, Raymond A. DeCarlo

Publication date 3 April 1995

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s089547989222758x

zbMATH Keywords

convergencenumerical examplesalgorithmmatrix perturbationsrank-reducing perturbations

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Recommendations

• On computation of the stability radius for nonlinearly structured perturbations
• On structured perturbation of Hermitian matrices.
• The Smallest Perturbation of a Submatrix that Lowers the Rank of the Matrix
• Computing the nearest rank-deficient matrix polynomial
• Rank Robustness of Complex Matrices with Respect to Real Perturbations

Cited in

(7)

• On the two-parameter matrix pencil problem
• The Smallest Perturbation of a Submatrix that Lowers the Rank of the Matrix
• On the structured distance to uncontrollability
• Switched controller synthesis for the quadratic stabilisation of a pair of unstable linear systems
• Efficient vectors for simple perturbed consistent matrices
• Molecular conformation search by distance matrix perturbations
• A Hessenberg Reduction Algorithm for Rank Structured Matrices

This page was built for publication: Computing Most Nearly Rank-Reducing Structured Matrix Perturbations

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