SavedAdd your journal

Journals / Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :A-Uygulamalı Bilimler ve Mühendislik / 2002 / Cilt: 3 - Sayı: 3

Stability of convex combinations of complex polynomials

Kompleks katsayılı polinomların konveks kombinasyonlarının kararlılığı

Vakıf DZHAFAROV
Taner BÜYÜKKÖROĞLU
Pages
357–361
Publication Date
2022-10-11
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

In this study an algorithm for testing on stability-unstability of complex polynomial segments with stable end points is given.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:By Edge Theorem, if all edges of polynomial polytope is stable then the whole polytope is also stable.
📊
Key Findings & Data:Therefore, the investigating of line segments of polynomials with stable end points is of great importance.
💡
Conclusion & Impact:In this study an algorithm for testing on stability-unstability of complex polynomial segments with stable end points is given.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

By Edge Theorem, if all edges of polynomial polytope is stable then the whole polytope is also stable. Therefore, the investigating of line segments of polynomials with stable end points is of great importance. In this study an algorithm for testing on stability-unstability of complex polynomial segments with stable end points is given.

Özet

Polinomlar politopunun kararlılığı için, Kenar Teoremine (Edge Theorem) göre eğer politopun tüm kenarları kararlı ve politoptaki polinomların dereceleri aynı ise o zaman tüm politop da kararlıdır. Bundan dolayı, iki kararlı polinomun konveks kombinasyonunun kararlılığının araştırılması çok önemlidir. Bu çalışmada, iki kararlı kompleks katsayılı polinomun konveks kombinasyonlarının kararlı olup olmadığını incelemek için bir algoritma verilmiştir.

🔖

Cite This Article

DZHAFAROV, V., BÜYÜKKÖROĞLU, T. (2022). Stability of convex combinations of complex polynomials. Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :A-Uygulamalı Bilimler ve Mühendislik, Cilt: 3 - Sayı: 3, 357–361. https://ajindex.com/articles/438503

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (6)

  1. Barmish, B.R.(1994). New Tools for Robustness of Linear Systems. Macmillan, New York. Bartlett, A.C., Hollot, C.V. and Huang, L. (1988). Rootlocations of an entire polytope of polynomials: It suffices to check the edges. Mathematics of Control 1, 61-71.
  2. Bialas, S. (1985). A necessary and sufficient condition for the stability of convex combinations of stable polynomials or matrices. Bulletin of the Polish Academy of Sciences, Technical Sciences 33, 473-480.
  3. Dzhafarov, V., Koçak Ş. and Azcan H. (2002). A Note on a Theorem of Rantzer. International Journal of Robust and Nonlinear Control 12, 403-407.
  4. Dzhafarov, V., Büyükköroğlu T. (2001). Line Segments in the Space of Hurwitz Polynomials, International Conference on Applicable General Topology, 12-18 Ağustos 2001,
  5. Hacettepe Üniversitesi, Ankara,Türkiye. Fu, M., Barmish, B.R. (1988). Maximal Undirectional Perturbation Bounds for Stability of Polynomials and Matrices. Systems Control Lett. 11, 173-179.
  6. Rantzer, A. (1992). Stability Conditions for Polytopes of Polynomials. IEEE Trans. Automat. Contr. 37, 79-89.