✨
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