An Arnoldi-Inout algorithm for computing PageRank problems (Q313604): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65F15 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6626244 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
PageRank | |||
| Property / zbMATH Keywords: PageRank / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
inner-outer iteration | |||
| Property / zbMATH Keywords: inner-outer iteration / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
PIO iteration | |||
| Property / zbMATH Keywords: PIO iteration / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
thick restarted Arnoldi algorithm | |||
| Property / zbMATH Keywords: thick restarted Arnoldi algorithm / rank | |||
Normal rank | |||
Revision as of 00:30, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Arnoldi-Inout algorithm for computing PageRank problems |
scientific article |
Statements
An Arnoldi-Inout algorithm for computing PageRank problems (English)
0 references
12 September 2016
0 references
PageRank
0 references
inner-outer iteration
0 references
PIO iteration
0 references
thick restarted Arnoldi algorithm
0 references
