An Algorithm for Segment Stability
Anadolu University, Faculty of Science, Department of Mathematics, 26470 Eskisehir, Turkey
*
Authors to whom correspondence should be addressed.
Math. Comput. Appl. 2003, 8(1), 111-118; https://doi.org/10.3390/mca8010111
Published: 1 April 2003
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 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.
Keywords:
Stable Polynomial; Segment Stability; Segment Lemma
Share and Cite
MDPI and ACS Style
Dzhafarov, V.; Büyükköroğlu, T. An Algorithm for Segment Stability. Math. Comput. Appl. 2003, 8, 111-118. https://doi.org/10.3390/mca8010111
AMA Style
Dzhafarov V, Büyükköroğlu T. An Algorithm for Segment Stability. Mathematical and Computational Applications. 2003; 8(1):111-118. https://doi.org/10.3390/mca8010111
Chicago/Turabian StyleDzhafarov, V., and T. Büyükköroğlu. 2003. "An Algorithm for Segment Stability" Mathematical and Computational Applications 8, no. 1: 111-118. https://doi.org/10.3390/mca8010111
