A modified Newton method for multilinear PageRank

DOI10.11650/tjm/180303zbMath1401.65045OpenAlexW2579999967WikidataQ130076749 ScholiaQ130076749MaRDI QIDQ1990430

Xiao-Xia Guo, Pei-Chang Guo, Shi-Chen Gao

Publication date: 25 October 2018

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.twjm/1521792084

zbMATH Keywords

tensorNewton-like methodmonotone convergencemultilinear PageRank

Mathematics Subject Classification ID

Related Items (1)

Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems

Cites Work

• Unnamed Item
• Unnamed Item
• Monotone convergence of Newton-like methods for \(M\)-matrix algebraic Riccati equations
• The modified Newton-Shamanskii method for the solution of a quadratic vector equation arising in Markovian binary trees
• A modified Newton method for the quadratic vector equation arising in Markovian binary trees
• PageRank Beyond the Web
• Multilinear PageRank
• Convergence analysis of the Newton-Shamanskii method for a nonsymmetric algebraic Riccati equation
• Solving Nonlinear Equations with Newton's Method
• The uniqueness of multilinear PageRank vectors
• On the limiting probability distribution of a transition probability tensor

This page was built for publication: A modified Newton method for multilinear PageRank