Pages that link to "Item:Q898964"
From MaRDI portal
The following pages link to FOM accelerated by an extrapolation method for solving PageRank problems (Q898964):
Displaying 13 items.
- Off-diagonal low-rank preconditioner for difficult PageRank problems (Q1624665) (← links)
- An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank (Q1675429) (← links)
- An efficient elimination strategy for solving PageRank problems (Q1735084) (← links)
- Multipreconditioned GMRES for simulating stochastic automata networks (Q1738192) (← links)
- Vector extrapolation based Landweber method for discrete ill-posed problems (Q1992317) (← links)
- The general inner-outer iteration method based on regular splittings for the PageRank problem (Q2009568) (← links)
- Acceleration of the generalized FOM algorithm for computing PageRank (Q2127521) (← links)
- A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank (Q2146348) (← links)
- A variant of the Power-Arnoldi algorithm for computing PageRank (Q2195926) (← links)
- An adaptive Power-GArnoldi algorithm for computing PageRank (Q2222161) (← links)
- Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors (Q2668354) (← links)
- An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank (Q2679824) (← links)
- Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions (Q6664835) (← links)