Abstract
The problem of robust Schur stability of a polynomial matrix family is considered as that of discovering the structure of the stability domain in parameter space. The algorithms are proposed for establishing whether or not any given box in the parameter space belongs to this domain, and for finding the distance to instability from any internal point of the domain to its boundary. The treatment is performed in the ideology of analytical algorithm for elimination of variables and localization of zeros of algebraic systems. Some examples are given.
Supported by RFBR, project No. 17-29-04288.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
\({\mathcal P}(A_1,\dots ,A_K):=\sum _{j=1}^{K-1} {\mathcal P}(A_j,A_{j+1})\) where \( {\mathcal P}(A_j,A_{j+1}) :=1 \) if \( A_jA_{j+1}>0 \) and \( {\mathcal P}(A_j,A_{j+1}) :=0 \) if \( A_jA_{j+1}<0 \). \({\mathcal V}(A_1,\dots ,A_K) \) is defined similarly with \( {\mathcal V}(A_j,A_{j+1}):=1-{\mathcal P}(A_j,A_{j+1}) \).
- 2.
We treat the matrix entries as rational fractions.
References
Ackermann, J.: Robust Control: The Parameter Space Approach. Springer-Verlag, London (2002)
Akritas, A.G.: Elements of Computer Algebra with Applications. Wiley, New York (1989)
Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer-Verlag, Heidelberg (2010)
Bhattacharya, S.P., Chapellat, H., Keel, L.: Robust Control: The Parametric Approach. Prentice-Hall, New Jersey (1995)
Bikker, P., Uteshev, A.Y.: On the Bézout construction of the resultant. J. Symb. Comput. 28, 45–88 (1999)
Büyükköroǧlu, T., Çelebi, G., Dzhafarov, V.: On the robust stability of polynomial matrix families. Electron. J. Linear Algebra 30, 905–915 (2015)
Chesi, G.: Exact robust stability analysis of uncertain systems with a scalar parameter via LMIs. Automatica 49, 1083–1086 (2013)
Chilali, M., Gahinet, P., Apkarian, P.: Robust pole placement in LMI regions. IEEE Trans. Automat. Control. 44(12), 2257–2270 (1999)
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9(3), 251–280 (1990)
Dzhafarov, V., Büyükköroǧlu, T.: On nonsingularity of a polytope of matrices. Linear Algebra Appl. 429, 1174–1183 (2008)
Elaydi, S.: An Introduction to Difference Equations. Springer, New York (2005)
Faddeev, D.K., Faddeeva, V.N.: Computational Methods of Linear Algebra. Freeman, San Francisco (1963)
Farouki, R.T.: The Bernstein polynomial basis: a centennial retrospective. Comput. Aided Geom. Des. 29(6), 379–419 (2012)
Gantmakher, F.R.: The Theory of Matrices, vol. I, II. Chelsea, New York (1959)
Henrion, O., Bachelier, O., Sebek, M.: \(D\)-stability of polynomial matrices. Int. J. Control 74(8), 845–856 (2001)
Joachimsthal, F.: Bemerkungen über den Sturmschen Satz. J. Reine Angew. Math. 48, 386–416 (1854)
Jury, E.I.: Innors and Stability of Dynamic Systems. Wiley, New York (1974)
Kalinina, E.A.: Stability and D-stability of the family of real polynomials. Linear Algebra Appl. 438, 2635–2650 (2013)
Keel, L.H., Bhattacharya, S.P.: Robust stability via sign-definite decomposition. IEEE Trans. Automat. Control 56(1), 140–145 (2011)
Krein, M.G., Naimark, M.A.: The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations. Linear Multilinear A. 10, 265–308 (1981)
Kunz, E.: Introduction to Plane Algebraic Curves. Birkhäuser, Boston (2005)
Lee, M. M.-D.: Factorization of Multivariate Polynomials. Technische Universität Kaiserslautern (2013)
Lenstra, A.K.: Factoring multivariate polynomials over finite fields. J. Comput. Syst. Sci. 30(2), 235–248 (1985)
Mishra, B.: Algorithmic Algebra. Springer-Verlag, New York (1993)
Schur, J.: Über Potenzreihen, die im Innern des Einheitskreises beschränkt sind. J. Reine Angew. Math., 147, 205–232 (1917), 148, 122–145 (1918)
Skalna, I.: Parametric Interval Algebraic Systems. Springer, Cham (2018)
Uteshev, A.Y., Shulyak, S.G.: Hermite’s method of separation of solutions of systems of algebraic equations and its applications. Linear Algebra Appl. 177, 49–88 (1992)
Smith III, J.O.: Introduction to Digital Filters: with Audio Applications. W3K Publishing, USA (2007)
Uteshev, A.Y., Cherkasov, T.M.: The search for the maximum of a polynomial. J. Symb. Comput. 25(5), 87–618 (1998)
Uteshev, A.Y., Borovoi, I.I.: Solution of a rational interpolation problem using Hankel polynomials. Vestn. St.-Peterbg. Univ. Ser. 10 Prikl. Mat. Inform. Protsessy Upr. 4, 31–43 (2016). (in Russian)
Uteshev, A.Yu., Goncharova, M.V.: Metric problems for algebraic manifolds: analytical approach. In: Constructive Nonsmooth Analysis and Related Topics – CNSA 2017 Proceedings, 7974027 (2017)
Uteshev, A.Y., Yashina, M.V.: Metric problems for quadrics in multidimensional space. J. Symb. Comput. 68, 287–315 (2015)
Wayland, H.: Expansion of determinantal equations into polynomial form. Quart. Appl. Math. 2(4), 277–305 (1945)
Yli-Kaakinen, J., Saramaki, T.: Efficient recursive digital filters with variable magnitude characteristics. In: Proceedings of 7th Nordic Signal Processing Symposium – NORSIG 2006, pp. 30–33 (2006)
Acknowledgments
The authors are grateful to Prof Evgenii Vorozhtzov and to the anonimous referees for valuable suggestions that helped to improve the quality of the paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Kalinina, E., Smol’kin, Y., Uteshev, A. (2019). Robust Schur Stability of a Polynomial Matrix Family. In: England, M., Koepf, W., Sadykov, T., Seiler, W., Vorozhtsov, E. (eds) Computer Algebra in Scientific Computing. CASC 2019. Lecture Notes in Computer Science(), vol 11661. Springer, Cham. https://doi.org/10.1007/978-3-030-26831-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-26831-2_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26830-5
Online ISBN: 978-3-030-26831-2
eBook Packages: Computer ScienceComputer Science (R0)