论文信息 - Evaluation of Stopping Criteria for Ranks in Solving Linear Systems

Evaluation of Stopping Criteria for Ranks in Solving Linear Systems

Bioinformatics, internet search engines (web pages) and social networks are some of the examples with large and high sparsity matrices. For some of these systems, only the actual ranks of the solut ...

Sergei Silvestrov | Christopher Engström | Benard Abola | Pitos Seleka Biganda

[1] Iain S. Duff,et al. Stopping Criteria for Iterative Solvers , 1992, SIAM J. Matrix Anal. Appl..

[2] Pavel Berkhin,et al. A Survey on PageRank Computing , 2005, Internet Math..

[3] Qiang Wu,et al. PageRank Tracker: From Ranking to Tracking , 2014, IEEE Transactions on Cybernetics.

[5] Feng Qiu,et al. Automatic identification of user interest for personalized search , 2006, WWW '06.

[6] A. Hadjidimos. Successive overrelaxation (SOR) and related methods , 2000 .

[7] Sebastiano Vigna,et al. Paradoxical Effects in PageRank Incremental Computations , 2005, Internet Math..

[8] J. C. Miellou,et al. A new stopping criterion for linear perturbed asynchronous iterations , 2008 .

[9] Ilse C. F. Ipsen,et al. Ordinal Ranking for Google's PageRank , 2008, SIAM J. Matrix Anal. Appl..

[10] Amy Nicole Langville,et al. A Reordering for the PageRank Problem , 2005, SIAM J. Sci. Comput..

[11] Carl D. Meyer,et al. Matrix Analysis and Applied Linear Algebra , 2000 .

[12] S. Silvestrov,et al. PageRank, Connecting a Line of Nodes with a Complete Graph , 2016 .