Extrapolation methods for fixed‐point multilinear PageRank computations

DOI10.1002/nla.2280zbMath1488.65106arXiv1906.01494OpenAlexW2997212412WikidataQ126460730 ScholiaQ126460730MaRDI QIDQ5218989

Stefano Cipolla, Francesco Tudisco, Michela Redivo-Zaglia

Publication date: 6 March 2020

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.01494

zbMATH Keywords

tensorgraphfixed-pointacceleration of convergenceextrapolation methodshigher-order Markov chainmultilinear PageRankspacey random surferhigher order power method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Extrapolation to the limit, deferred corrections (65B05) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)

Related Items (10)

Ergodicity Coefficients for Higher-Order Stochastic Processes ⋮ Acceleration of the generalized FOM algorithm for computing PageRank ⋮ Higher Order Extended Dynamic Mode Decomposition Based on the Structured Total Least Squares ⋮ Multi-linear pseudo-PageRank for hypergraph partitioning ⋮ Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems ⋮ Improved uniqueness conditions of solution for multilinear pagerank and its application ⋮ The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods ⋮ A survey of Shanks' extrapolation methods and their applications ⋮ Matrix Shanks Transformations ⋮ Nonlocal pagerank

Uses Software

• Matlab
• Netlib
• EPSfun

This page was built for publication: Extrapolation methods for fixed‐point multilinear PageRank computations