An algorithm for computing multivariable root loci by pivoting
DOI10.1080/0020718508961111zbMATH Open0563.93024OpenAlexW2008110096MaRDI QIDQ3677589FDOQ3677589
Authors:
Publication date: 1985
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020718508961111
Recommendations
- Characterization of robust root loci of polytopes of polynomials
- Algorithms and programs for calculating the roots of polynomial of one or two variables
- Root locus of fractional linear systems
- Simple pivoting algorithm for root-locus method of linear systems with delay
- Computation of finite and infinite zeros of linear multivariable systems: a state space approach
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Linear systems in control theory (93C05) Multivariable systems, multidimensional control systems (93C35) Model systems in control theory (93C99) Nonlinear algebraic or transcendental equations (65H99)
Cites Work
- The computation of fixed points and applications
- Finding all solutions to polynomial systems and other systems of equations
- Multivariate root loci: a unified approach to finite and infinite zeros
- Asymptotic behaviour of root-loci of linear multivariable systems
- On the asymptotic root-loci of linear multivariable systems
- Graphical bounds for the root-loci of linear multivariable systems
- The asymptotic behaviour, the angles of departure, and the angles of approach, of the characteristic frequency loci
- Characteristic frequency functions and characteristic gain functions
Cited In (4)
This page was built for publication: An algorithm for computing multivariable root loci by pivoting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677589)
