An evolution strategy method for computing eigenvalue bounds of interval matrices

In this paper, a modified method by means of an evolution strategy (ES) is introduced for computing eigenvalue bounds of interval matrices. Then a sufficient condition theorem of the evolutionary strategy is presented which guarantees the convergence in probability of the method. The numerical examples show the method can effectively yield accurate bounds for interval eigenvalues.