Journals / Mathematical and Computational Applications / 2003 / Cilt: 8 - Sayı: 1

An algorithm for segment stability

Pages
111–118
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)

Some illustrative examples also are given.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this note an algorithm for testing on stability-unstability of polynomial segments with stable end-points is given.
📊
Key Findings & Data:The algorithm is based on well-known segment lemma and on approximate positive real roots of suitable polynomial equation.
💡
Conclusion & Impact:Some illustrative examples also are given.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

In this note an algorithm for testing on stability-unstability of polynomial segments with stable end-points is given. The algorithm is based on well-known segment lemma and on approximate positive real roots of suitable polynomial equation. In this paper an upper bound for absolute error of aproximate root that guarantees the segment stability or unstability is established. In the case of unstability the algorithm, differs from the existing algorithms, explains the segment behavior in the parameter space. Some illustrative examples also are given.

🔖

Cite This Article

DZHAFAROV, V., BÜYÜKKÖROĞLU, T. (2003). An algorithm for segment stability. Mathematical and Computational Applications, Cilt: 8 - Sayı: 1, 111–118. https://ajindex.com/articles/280356

📄 Full Text PDF Viewer

📄

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

References (7)

  1. B.R. Barmish, New Tools for Robustness of Linear Systems, Macmillan, NY, 1994
  2. S. Bialas, A necessary and sufficient condition for the stability of convex combinations of stable polynomials or matrices, Bull. Polish. Acad. Set, Tech. Sci., 33, 474-480, 1985
  3. S. Bialas and J. Carloff, Convex Combinations of Stable Polynomials, J.Franklin Inst. 319, 373-377, 1985
  4. H. Bougherra, B.C. Chang, H.H. Yeh and S.S. Banda, Fast Stability Checking for the Convex Combination of Stable Polynomials, IEEE Trans. Automat. Contr35, 586-588,1990
  5. H. Chapellat and S.P. Bhattacharyya, An Alternative Proof of Kharitonov's Theorem, IEEE Trans. Automat. Contr., 34, 448-450, 1989
  6. M. Fu and B.R. Barmish, Maximal Unidirectional Perturbation Bounds for Stability of Polynomials and Matrices, Systems and Control Lett., 11, 173-179, 1988
  7. A. Rantzer, Stability Conditions for Poly topes of Polynomials, IEEE Trans. Automat. Contr., 37, 79-89, 1992.