A solution of the random eigenvalue problem by crossing theory
暂无分享,去创建一个
Abstract A method is developed for finding probabilistic descriptors of the eigenvalues of stochastic real-valued symmetric matrices. The method is based on the mean rate at which the characteristic polynomial of a stochastic matrix crosses level zero. The proposed approach can also be applied when additional information is available on the value of the first or the first few eigenvalues. Several examples are presented in the paper to demonstrate the application and usefulness of the method.
[1] Anthony J. Pettofrezzo,et al. Matrices and Transformations , 1978 .
[2] Mircea Grigoriu. Eigenvalue Problem for Uncertain Systems , 1991 .
[3] J. Scheidt,et al. Random Eigenvalue Problems , 1983 .
[4] M. R. Leadbetter,et al. Extremes and Related Properties of Random Sequences and Processes: Springer Series in Statistics , 1983 .
[5] M. Grigoriu. Crossings of non-gaussian translation processes , 1984 .