Squaring down and the problems of almost zeros for continuous-time systems

DOI10.1016/0167-6911(94)90072-8MaRDI QIDQ1338070zbMATH OpenOpenAlexFDO

Authors J. H. A. Ludlage, Anton A. Stoorvogel

Publication date 17 November 1994

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

Full work available at URL https://doi.org/10.1016/0167-6911(94)90072-8

zbMATH Keywords

continuous-timeNehari approximationprecompensator

Mathematics Subject Classification ID

Model systems in control theory (93C99)

Recommendations

• Squaring down with zeros cancellation in generalized systems
• A numerically reliable solution for the squaring-down problem in system design
• Squaring down of non-strictly proper systems
• Squaring down by static and dynamic compensators
• Squaring down LTI systems: a geometric approach

Cites work

• All optimal Hankel-norm approximations of linear multivariable systems and theirL,^∞-error bounds†
• Grassmann invariants, almost zeros and the determinantal zero, pole assignment problems of linear multivariable systems
• Inner-outer factorizations of right-invertible real-rational matrices
• Poles and zeros of linear multivariable systems : a survey of the algebraic, geometric and complex-variable theory
• Some properties of minimum phase systems and "Squared-down" systems
• Squaring down by static and dynamic compensators
• Squaring down of non-strictly proper systems

Cited in

(5)

• A numerically reliable solution for the squaring-down problem in system design
• Squaring down with zeros cancellation in generalized systems
• Squaring down of non-strictly proper systems
• Squaring down of general MIMO systems to invertible uniform rank systems via pre- and/or post-compensators
• Squaring down LTI systems: a geometric approach

This page was built for publication: Squaring down and the problems of almost zeros for continuous-time systems

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