An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank (Q1675429)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6798985
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank |
scientific article; zbMATH DE number 6798985 |
Statements
An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank (English)
0 references
27 October 2017
0 references
A new two-stage matrix splitting iteration technique is proposed for computing PageRank. Then this technique is used to accelerate the Arnoldi-Inout algorithm and as a result, a preconditioned Arnoldi-inner-inner-out algorithm is presented for computing PageRank. Theoretical analysis and numerical tests show that the new algorithm performs better than the thick Arnoldi method and the Arnoldi-Inout method.
0 references
PageRank
0 references
inner-outer iteration
0 references
Arnoldi algorithm
0 references
two-stage splitting
0 references
preconditioned Arnoldi-Inout
0 references
numerical example
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.93094015
0 references
0.92715734
0 references
0.92637897
0 references
0.9209963
0 references
0.91810834
0 references
0.9161606
0 references
0.9141226
0 references
0.90830225
0 references
