Trilogy on Computing Maximal Eigenpair

摘要：

　　The eigenpair here means the twins of eigenvalue and corresponding eigenvector.The talk introduces the three steps of our study on computing the maximal eigenpair.In the first two steps,we construct efficient initials for a known but dangerous algorithm,first for tridiagonal matrices and then for the irreducible matrices,having nonnegative off-diagonal elements.In the third step,we present two global algorithms which are still efficient and work well for a quite large class of matrices,even complex for instance.

关键词： Maximal eigenpair Efficient initial Tridiagonal matrix Global algorithm

作者: Mu-Fa Chen

作者单位: School of Mathematical Sciences,Beijing Normal University,Beijing 100875,China

会议类型: 国际会议

会议名称: The 12th International Conference on Queueing Theory and Network Applications(第十二届排序理论与网络应用国际会议)(QTNA 2017)

会议地点: 河北秦皇岛

会议语种:英文

页码: 312-329

在线出版日期: 2017-08-21（万方平台首次上网日期，不代表论文的发表时间）