An Algorithm for Segment Stability
AbstractIn 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 approximate 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.
Share & Cite This Article
Dzhafarov, V.; Büyükköroğlu, T. An Algorithm for Segment Stability. Math. Comput. Appl. 2003, 8, 111-118.
Dzhafarov V, Büyükköroğlu T. An Algorithm for Segment Stability. Mathematical and Computational Applications. 2003; 8(1):111-118.Chicago/Turabian Style
Dzhafarov, V.; Büyükköroğlu, T. 2003. "An Algorithm for Segment Stability." Math. Comput. Appl. 8, no. 1: 111-118.