An Algorithm for Segment Stability

V. Dzhafarov; T. Büyükköroğlu

doi:10.3390/mca8010111

Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Previous articles were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence, and they are hosted by MDPI on mdpi.com as a courtesy and upon agreement with Association for Scientific Research (ASR).

Article

1 April 2003

An Algorithm for Segment Stability

and

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

Version Notes

Order Reprints

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

Article Metrics

Citations

Article Access Statistics

Journal Statistics

Multiple requests from the same IP address are counted as one view.

Pruning Decision Trees using Rules3 Inductive Learning Algorithm

Long Term Energy Consumption Forecasting Using Genetic Programming