The general inner-outer iteration method based on regular splittings for the PageRank problem
From MaRDI portal
Publication:2009568
DOI10.1016/j.amc.2019.02.066zbMath1429.65079OpenAlexW2937528284MaRDI QIDQ2009568
Yan Zhang, Maoyi Tian, Yong Liu, Zhong-Yun Liu, Zhao Lu Tian
Publication date: 29 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.02.066
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Linear equations (linear algebraic aspects) (15A06) Preconditioners for iterative methods (65F08)
Related Items (29)
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 ⋮ 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 ⋮ 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 ⋮ Sharp rational bounds for the gamma function ⋮ Approximation for the complete elliptic integral of the first kind ⋮ Sharp bounds for Sándor-Yang means in terms of one-parameter family of bivariate means ⋮ Inequalities involving conformable approach for exponentially convex functions and their applications ⋮ A multi-power and multi-splitting inner-outer iteration for PageRank computation ⋮ Parametric controllability of the personalized PageRank: Classic model vs biplex approach ⋮ 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 ⋮ Some new Hermite-Hadamard-type inequalities associated with conformable fractional integrals and their applications ⋮ 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
Cites Work
- An Arnoldi-Inout algorithm for computing PageRank problems
- A new extrapolation method for PageRank computations
- 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
- A note on the two-step matrix splitting iteration for computing PageRank
- An Arnoldi-type algorithm for computing Page Rank
- FOM accelerated by an extrapolation method for solving PageRank problems
- An Arnoldi-extrapolation algorithm for computing pagerank
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- Adaptive methods for the computation of PageRank
- Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
- An efficient elimination strategy for solving PageRank problems
- On convergence of the inner-outer iteration method for computing Pagerank
- A preconditioned and extrapolation-accelerated GMRES method for pagerank
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- On the multi-splitting iteration method for computing PageRank
- An Inner-Outer Iteration for Computing PageRank
- A Power–Arnoldi algorithm for computing PageRank
- Accelerated Overrelaxation Method
- Deeper Inside PageRank
- A Survey on PageRank Computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The general inner-outer iteration method based on regular splittings for the PageRank problem
