Abstract
In this article, we have experimented with the Chebyshev semi-iterative (CSI) method for PageRank computation. The CSI method is slow, and for a few PageRank matrices, the method diverges. To overcome such difficulties, we have introduced a two stage Chebyshev semi-iterative (TSCI) method. TSCI method is convergent for all PageRank matrices and comparatively faster than some of the recently developed iterative methods. The numerical experiment has been performed for Multiple PageRank matrices. The computational results show how the TSCI algorithm is efficient.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
