An efficient computational method for bounds of eigenvalues of an interval system using a convex hull algorithm

Abstract EN

-This paper presents an efficient computational method for generating a plot for the bounds of eigenvalues of the entire family of interval matrices through a simple and efficient algorithm.

The convex-hull technique is utilized and incorporated to find the smallest convex polygon containing all characteristic polynomial points.

Finally, the algorithm is examined through several uncertain systems and a complete electrical application is presented to validate the proposed method.