A residual-based error bound for the multilinear PageRank vector
From MaRDI portal
Publication:5217490
DOI10.1080/03081087.2018.1509937zbMATH Open1431.65072OpenAlexW2891979585WikidataQ114641413 ScholiaQ114641413MaRDI QIDQ5217490FDOQ5217490
Authors: Pei-Chang Guo
Publication date: 24 February 2020
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2018.1509937
Recommendations
- Multilinear PageRank: uniqueness, error bound and perturbation analysis
- Vector Aitken extrapolation method for multilinear PageRank computations
- Extrapolation methods for fixed‐point multilinear PageRank computations
- A continuation method for computing the multilinear PageRank
- Perron-based algorithms for the multilinear PageRank
- Convergence of the fixed‐point iteration for multilinear PageRank
- The uniqueness of multilinear PageRank vectors.
- A modified Newton method for multilinear PageRank
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- Multilinear PageRank
Multilinear algebra, tensor calculus (15A69) Numerical computation of solutions to systems of equations (65H10) Conditioning of matrices (15A12)
Cites Work
Cited In (5)
- A modified Newton method for multilinear PageRank
- Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems
- The uniqueness of multilinear PageRank vectors.
- Multilinear PageRank: uniqueness, error bound and perturbation analysis
- Extrapolation methods for multilinear PageRank
This page was built for publication: A residual-based error bound for the multilinear PageRank vector
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217490)