Spliting iteration method for solving multilinear PageRank problem

DOI10.12286/JSSX.J2023-1128MaRDI QIDQ7005552zbMATH OpenFDO

Authors Shuting Tang, Xiu Qin Deng, Dongdong Liu

Publication date 1 April 2025

Published in Mathematica Numerica Sinica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.12286/JSSX.J2023-1128

zbMATH Keywords

multilinear PageRank problemrelaxation algorithmtensor splitting

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical linear algebra (65F99)

Cites work

• A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
• A modified Newton method for multilinear PageRank
• An inner-outer iteration for computing PageRank
• Anderson accelerated fixed‐point iteration for multilinear PageRank
• Computing tensor Z-eigenvectors with dynamical systems
• Ergodicity Coefficients for Higher-Order Stochastic Processes
• Extrapolation methods for fixed‐point multilinear PageRank computations
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• Multilinear PageRank
• Multilinear PageRank: uniqueness, error bound and perturbation analysis
• On the limiting probability distribution of a transition probability tensor
• Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
• Perron-based algorithms for the multilinear PageRank
• Relaxation methods for solving the tensor equation arising from the higher‐order Markov chains
• The tensor splitting with application to solve multi-linear systems
• The uniqueness of multilinear PageRank vectors.

This page was built for publication: Spliting iteration method for solving multilinear PageRank problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7005552)