Parallel multisplitting iteration methods based on M-splitting for the PageRank problem (Q1732194)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel multisplitting iteration methods based on M-splitting for the PageRank problem |
scientific article; zbMATH DE number 7040902
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel multisplitting iteration methods based on M-splitting for the PageRank problem |
scientific article; zbMATH DE number 7040902 |
Statements
Parallel multisplitting iteration methods based on M-splitting for the PageRank problem (English)
0 references
22 March 2019
0 references
PageRank
0 references
linear systems
0 references
regular splitting
0 references
M-splitting
0 references
iteration method
0 references
0 references
0 references
0 references
0 references
0.92489517
0 references
0.9172025
0 references
0.9059736
0 references
0.9056554
0 references
0.9047717
0 references
0.89876366
0 references
0.89692014
0 references
0.8912779
0 references
