A study of the gap between the structured singular value and its convex upper bound for low-rank matrices

DOI10.1109/9.618251zbMATH Open0887.93050OpenAlexW2147612952MaRDI QIDQ4357999

Roy S. Smith

Publication date: 20 November 1997

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.618251

zbMATH Keywords

structured singular valueBinet-Cauchy formulalow-rank problems

Mathematics Subject Classification ID

Eigenvalue problems (93B60) Robust stability (93D09)

Related Items (2)

On the Gap Between the Complex Structured Singular Value and Its Convex Upper Bound ⋮ Low-Rank Matrix Approximations Do Not Need a Singular Value Gap

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery 👍 👎
• A nonlinear programming technique to compute a~tight~lower bound for the real structured singular value 👍 👎
• The Stability of Low-Rank Matrix Reconstruction: A Constrained Singular Value View 👍 👎
• Low-Rank Matrix Approximations Do Not Need a Singular Value Gap 👍 👎
• Characterization and efficient computation of the structured singular value 👍 👎
• Improved upper bounds for the mixed structured singular value 👍 👎
• On the Gap Between the Complex Structured Singular Value and Its Convex Upper Bound 👍 👎

This page was built for publication: A study of the gap between the structured singular value and its convex upper bound for low-rank matrices

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