.png){kind=icon}
Return
An evolution strategy method for computing eigenvalue bounds of interval matrices
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2007.05.051.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2007 Elsevier Inc. All rights reserved.
Keywords:
evolution strategy (ES)
interval matrix
eigenvalue bounds
convergence in probability
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more