Simple pivoting algorithm for root-locus method of linear systems with delay
From MaRDI portal
Publication:3978348
DOI10.1080/00207179108953658zbMATH Open0737.93025OpenAlexW1999903653MaRDI QIDQ3978348FDOQ3978348
Authors:
Publication date: 25 June 1992
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207179108953658
Recommendations
Cites Work
Cited In (9)
- Characterization of robust root loci of polytopes of polynomials
- Title not available (Why is that?)
- Efficient algorithm for computing QFT bounds
- QFT template generation for time-delay plants based on zero-inclusion test
- Generation of QFT bounds for robust tracking specifications for plants with affinely dependent uncertainties
- Root locus for SISO dead-time systems: A continuation based approach
- An algorithm for computing multivariable root loci by pivoting
- Generation of robust root loci for linear systems with parametric uncertainties in an ellipsoid
- Computation of the frequency response of interval systems
This page was built for publication: Simple pivoting algorithm for root-locus method of linear systems with delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978348)