A modified Newton method for multilinear PageRank

DOI10.11650/TJM/180303MaRDI QIDQ1990430zbMATH OpenOpenAlexWikidataFDO

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

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

monotone convergencemultilinear PageRankNewton-like methodtensor

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Recommendations

• Vector Aitken extrapolation method for multilinear PageRank computations
• Multilinear PageRank
• A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
• A residual-based error bound for the multilinear PageRank vector
• Multilinear PageRank: uniqueness, error bound and perturbation analysis

Cites work

• A modified Newton method for the quadratic vector equation arising in Markovian binary trees
• Convergence analysis of the Newton-Shamanskii method for a nonsymmetric algebraic Riccati equation
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• Monotone convergence of Newton-like methods for M-matrix algebraic Riccati equations
• Multilinear PageRank
• On the limiting probability distribution of a transition probability tensor
• PageRank beyond the web
• Solving Nonlinear Equations with Newton's Method
• The modified Newton-Shamanskii method for the solution of a quadratic vector equation arising in Markovian binary trees
• The uniqueness of multilinear PageRank vectors.

Cited in

(13)

• Multilinear PageRank: uniqueness, error bound and perturbation analysis
• Vector Aitken extrapolation method for multilinear PageRank computations
• Perron-based algorithms for the multilinear PageRank
• Multilinear PageRank
• The uniqueness of multilinear PageRank vectors.
• Convergence of the fixed‐point iteration for multilinear PageRank
• Saddle point mirror descent algorithm for the robust PageRank problem
• A residual-based error bound for the multilinear PageRank vector
• 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
• Extrapolation methods for multilinear PageRank
• Spliting iteration method for solving multilinear PageRank problem
• Preconditioned iterative methods with Anderson acceleration for solving multilinear PageRank and applications

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

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