Efficient algorithm for computing QFT bounds
From MaRDI portal
Publication:3577873
DOI10.1080/00207170903390161zbMath1209.93061OpenAlexW1997130518MaRDI QIDQ3577873
Publication date: 26 July 2010
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207170903390161
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Computation of QFT bounds for robust tracking specifications
- Direct control design in sampled-data uncertain systems
- Template generation for continuous transfer functions using interval analysis
- Invited paper Survey of quantitative feedback theory (QFT)
- Recursive grid methods to compute value sets and Horowitz–Sidi bounds
- Improvements on the computation of boundaries in QFT
- Simple pivoting algorithm for root-locus method of linear systems with delay
- An Efficient Algorithm for Computing QFT Bounds
- Multi‐input/single‐output computer‐aided control design using the quantitative feedback theory
- Single-Loop QFT Design for Robust Performance in the Presence of Non-Parametric Uncertainties
- QFT Templates for Plants With a High Number of Uncertainty Parameters
- Generation of frequency-response templates for linear systems with an uncertain time delay and multilinearly-correlated parameter perturbations
- QFT template generation for time-delay plants based on zero-inclusion test
This page was built for publication: Efficient algorithm for computing QFT bounds
