The general inner-outer iteration method based on regular splittings for the PageRank problem
From MaRDI portal
Publication:2009568
Recommendations
- A multi-power and multi-splitting inner-outer iteration for PageRank computation
- A general multi-splitting iteration method for computing PageRank
- A note on the two-step matrix splitting iteration for computing PageRank
- On the multi-splitting iteration method for computing PageRank
- An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank
Cites work
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- A new extrapolation method for PageRank computations
- A note on the two-step matrix splitting iteration for computing PageRank
- A Power–Arnoldi algorithm for computing PageRank
- A preconditioned and extrapolation-accelerated GMRES method for pagerank
- A Survey on PageRank Computing
- A two-step matrix splitting iteration for computing PageRank
- A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
- Accelerated Overrelaxation Method
- Adaptive methods for the computation of PageRank
- An Arnoldi-extrapolation algorithm for computing pagerank
- An Arnoldi-Inout algorithm for computing PageRank problems
- An Arnoldi-type algorithm for computing Page Rank
- An efficient elimination strategy for solving PageRank problems
- An inner-outer iteration for computing PageRank
- Deeper Inside PageRank
- FOM accelerated by an extrapolation method for solving PageRank problems
- Google's PageRank and beyond. The science of search engine rankings
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1433445 (Why is no real title available?)
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- On convergence of the inner-outer iteration method for computing Pagerank
- On the multi-splitting iteration method for computing PageRank
- Parallel iterative methods for sparse linear systems
- Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
Cited in
(32)- On convergence of the inner-outer iteration method for computing Pagerank
- A multi-power and multi-splitting inner-outer iteration for PageRank computation
- Dynamics analysis on a class of delayed neural networks involving inertial terms
- Global asymptotic stability for a nonlinear density-dependent mortality Nicholson's blowflies system involving multiple pairs of time-varying delays
- Optimal two-parameter geometric and arithmetic mean bounds for the Sándor-Yang mean
- A note on generalized convex functions
- Some new fractional integral inequalities for exponentially \(m\)-convex functions via extended generalized Mittag-Leffler function
- Hermite-Hadamard type inequalities for co-ordinated convex and qausi-convex functions and their applications
- Monotonicity properties and bounds involving the two-parameter generalized Grötzsch ring function
- New Hermite-Hadamard type inequalities for n-polynomial harmonically convex functions
- An extrapolation iteration and its lumped type iteration for computing PageRank
- The coupled iteration algorithms for computing PageRank
- Acceleration of the generalized FOM algorithm for computing PageRank
- Acceleration of an adaptive generalized Arnoldi method for computing PageRank
- Using of PQWs for solving NFID in the complex plane
- A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank
- Some new inequalities involving \(\kappa \)-fractional integral for certain classes of functions and their applications
- A variant of the Power-Arnoldi algorithm for computing PageRank
- An adaptive Power-GArnoldi algorithm for computing PageRank
- Several relaxed iteration methods for computing PageRank
- Approximation for the complete elliptic integral of the first kind
- Inequalities involving conformable approach for exponentially convex functions and their applications
- Some new Hermite-Hadamard-type inequalities associated with conformable fractional integrals and their applications
- Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors
- An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank
- Notes on the complete elliptic integral of the first kind
- Inequalities for generalized trigonometric and hyperbolic functions with one parameter
- Sharp rational bounds for the gamma function
- Sharp bounds for Sándor-Yang means in terms of one-parameter family of bivariate means
- Parametric controllability of the personalized PageRank: Classic model vs biplex approach
- The parameterized accelerated iteration method for solving the matrix equation AXB=C
- Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
This page was built for publication: The general inner-outer iteration method based on regular splittings for the PageRank problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009568)
