An Efficient Algorithm for Computing QFT Bounds

DOI10.1115/1.2801292zbMATH Open0900.93184OpenAlexW2029590479MaRDI QIDQ4388541FDOQ4388541

Authors:

Publication date: 1 November 1998

Published in: Journal of Dynamic Systems, Measurement, and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1115/1.2801292

Mathematics Subject Classification ID

Frequency-response methods in control theory (93C80)

Cited In (6)

• Computation of QFT bounds for robust tracking specifications
• Efficient algorithm for computing QFT bounds
• Generation of QFT bounds for robust tracking specifications for plants with affinely dependent uncertainties
• Analytical formulation to compute QFT bounds: The envelope method
• Linear time computation of feasible regions for robust compensators
• Interval QFT: a mathematical and computational enhancement of QFT

This page was built for publication: An Efficient Algorithm for Computing QFT Bounds

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