Simple pivoting algorithm for root-locus method of linear systems with delay
Consider the linear feedback control system whose closed-loop transfer function is \(Y(s)/X(s)=G(s)/(1+G(s)H(s))\). Suppose that \(G(s)H(s)=k(Q(s)/P(s))\exp(-us)\) is the open-loop transfer function. Here \(u\) is a delay time and \(P(s)\) and \(Q(s)\) are polynomials of degree \(n\) and \(r\), respectively, where \(n>r\). The purpose of this paper is to extend the pivoting method to the root loci problem for the system. A method for computing root loci is proposed. The method solves characteristic equations by pivoting procedures. Some theoretical results are given to validate the algorithm, and numerical examples are given to illustrate the efficiency of the method.
- A computer-aided root-locus method
- A note on a computer-aided root-locus method
- A root-locus technique for linear systems with delay
- An algorithm for computing multivariable root loci by pivoting
- scientific article; zbMATH DE number 3708182 (Why is no real title available?)
- Numerical methods for the synthesis of linear control systems
- Computation of the frequency response of interval systems
- Characterization of robust root loci of polytopes of polynomials
- Generation of QFT bounds for robust tracking specifications for plants with affinely dependent uncertainties
- Generation of robust root loci for linear systems with parametric uncertainties in an ellipsoid
- Efficient algorithm for computing QFT bounds
- An algorithm for computing multivariable root loci by pivoting
- scientific article; zbMATH DE number 4039735 (Why is no real title available?)
- Root locus for SISO dead-time systems: A continuation based approach
- QFT template generation for time-delay plants based on zero-inclusion test
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)