شماره ركورد كنفرانس :
3806
عنوان مقاله :
Noda-Arnoldi method for computing Perron root of adjacency matrix associated with a large graph
پديدآورندگان :
Abadi Z zeinab.abadi@stu.yazd.ac.ir Department of Mathematics,Yazd University, Yazd, Iran , Shahzadeh Fazeli S. A fazeli@yazd.ac.ir Parallel Processing Laboratory, Department of Mathematics, Yazd University, Yazd, Iran , Karbassi S. M smkarbassi@yazd.ac.ir Department of Mathematics,Yazd University, Yazd, Iran
كليدواژه :
Connected graphs , Adjacency matrices , Large eigenvalue problems , Arnoldi method , Noda iteration
عنوان كنفرانس :
دهمين كنفرانس ملي نظريه گراف و تركيبات جبري
چكيده فارسي :
Graphs are used in multiple important applications such that network traffic monitoring, webstructureanalysis, socialnetworkmining, proteininteraction study and scientific computing. In this paper we present a new method for computing Perron root and Perron vector of a large graph with sparse adjacency matrix. This new method is a hybrid method of explicitly restarted Arnoldi method (ERAM) and Noda iteration. The implementation of the method has been tested by a numerical example.
