Pages that link to "Item:Q4909729"
From MaRDI portal
The following pages link to On adaptively accelerated Arnoldi method for computing PageRank (Q4909729):
Displaying 14 items.
- Recent advances in bibliometric indexes and the PaperRank problem (Q396049) (← links)
- Numerical stability of orthogonalization methods with a non-standard inner product (Q695058) (← links)
- FOM accelerated by an extrapolation method for solving PageRank problems (Q898964) (← links)
- A relaxed two-step splitting iteration method for computing PageRank (Q1655370) (← links)
- A Hessenberg-type algorithm for computing PageRank problems (Q2118965) (← links)
- Acceleration of the generalized FOM algorithm for computing PageRank (Q2127521) (← links)
- Acceleration of an adaptive generalized Arnoldi method for computing PageRank (Q2131499) (← 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)
- On the multi-splitting iteration method for computing PageRank (Q2511375) (← 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)
- (Q2787244) (← links)