This paper describes a new method and algorithm for the numerical solution of eigenvalues with the largest real part of positive matrices.The method is based on a numerical implementation of Collatz＇s eigenvalue incl...This paper describes a new method and algorithm for the numerical solution of eigenvalues with the largest real part of positive matrices.The method is based on a numerical implementation of Collatz＇s eigenvalue inclusion theorem for non-negative irreducible matrices.Eigenvalues are analyzed for the studies of the stability of linear systems.Finally, a numerical discussion is given to derive the required number of mathematical operations of the new algorithm. Comparisons between the new algorithm and several well known ones, such as Power, and QR methods, are discussed.展开更多
This paper introduces some efficient initials for a well-known algorithm （an inverse iteration） for computing the maximal eigenpair of a class of real matrices. The initials not only avoid the collapse of the algori...This paper introduces some efficient initials for a well-known algorithm （an inverse iteration） for computing the maximal eigenpair of a class of real matrices. The initials not only avoid the collapse of the algorithm but are also unexpectedly efficient. The initials presented here are based on our analytic estimates of the maximal eigenvalue and a mimic of its eigenvector for many years of accumulation in the study of stochastic stability speed. In parallel, the same problem for computing the next to the maximal eigenpair is also studied.展开更多
We study irreducible tensors. the real and complex geometric simplicity of nonnegative First, we prove some basic conclusions. Based on the conclusions, the real geometric simplicity of the spectral radius of an even-...We study irreducible tensors. the real and complex geometric simplicity of nonnegative First, we prove some basic conclusions. Based on the conclusions, the real geometric simplicity of the spectral radius of an even- order nonnegative irreducible tensor is proved. For an odd-order nonnegative irreducible tensor, sufficient conditions are investigated to ensure the spectral radius to be real geometrically simple. Furthermore, the complex geometric simplicity of nonnegative irreducible tensors is also studied.展开更多
文摘This paper describes a new method and algorithm for the numerical solution of eigenvalues with the largest real part of positive matrices.The method is based on a numerical implementation of Collatz＇s eigenvalue inclusion theorem for non-negative irreducible matrices.Eigenvalues are analyzed for the studies of the stability of linear systems.Finally, a numerical discussion is given to derive the required number of mathematical operations of the new algorithm. Comparisons between the new algorithm and several well known ones, such as Power, and QR methods, are discussed.
基金Acknowledgements The main results of the paper have been reported at Anhui Normal University, Jiangsu Normal University, the International Workshop on SDEs and Numerical Methods at Shanghai Normal University, Workshop on Markov Processes and Their Applications at Hunan University of Arts and Science, and Workshop of Probability Theory with Applications at University of Macao. The author acknowledges Professors Dong-Jin Zhu, Wan-Ding Ding, Ying-Chao Xie, Xue-Rong Mao, Xiang-Qun Yang, Xu-Yan Xiang, Jie Xiong, Li-Hu Xu, and their teams for very warm hospitality and financial support. The author also thanks Ms. Yue-Shuang Li for her assistance in computing large matrices. This work was supported in part by the National Natural Science Foundation of China （Grant No. 11131003）, the ＂985＂ project from the Ministry of Education in China, and the Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions.
文摘This paper introduces some efficient initials for a well-known algorithm （an inverse iteration） for computing the maximal eigenpair of a class of real matrices. The initials not only avoid the collapse of the algorithm but are also unexpectedly efficient. The initials presented here are based on our analytic estimates of the maximal eigenvalue and a mimic of its eigenvector for many years of accumulation in the study of stochastic stability speed. In parallel, the same problem for computing the next to the maximal eigenpair is also studied.
文摘We study irreducible tensors. the real and complex geometric simplicity of nonnegative First, we prove some basic conclusions. Based on the conclusions, the real geometric simplicity of the spectral radius of an even- order nonnegative irreducible tensor is proved. For an odd-order nonnegative irreducible tensor, sufficient conditions are investigated to ensure the spectral radius to be real geometrically simple. Furthermore, the complex geometric simplicity of nonnegative irreducible tensors is also studied.
