An algorithm for segment stability

Creative Commons License

Dzhafarov V., BÜYÜKKÖROĞLU T.

Mathematical and Computational Applications, cilt.8, sa.1-3, ss.111-118, 2003 (Scopus) identifier

  • Yayın Türü: Makale / Özet
  • Cilt numarası: 8 Sayı: 1-3
  • Basım Tarihi: 2003
  • Doi Numarası: 10.3390/mca8010111
  • Dergi Adı: Mathematical and Computational Applications
  • Derginin Tarandığı İndeksler: Scopus, TR DİZİN (ULAKBİM)
  • Sayfa Sayıları: ss.111-118
  • Anahtar Kelimeler: Segment Lemma, Segment Stability, Stable Polynomial
  • Anadolu Üniversitesi Adresli: Evet

Özet

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.