报告题目：Efficient initials for computing the maximal eigenpair
报告人： 陈 木 法
中国科学院院士、北京
报告时间：2015年10月8日下午3:00
报告地点：数学计算机科学学院学苑南楼5号楼二楼学术报告厅
报告简介: This talk introduces some new efficient initials for a well-known algorithm (an inverse iteration) for computing the maximal eigenpair of a class of real matrices. 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. These initials not only avoid the collapse of the algorithm but also are unexpected efficient.
欢迎参加！
数学计算机科学学院