Relaxation methods for solving the tensor equation arising from the higher‐order Markov chains

DOI10.1002/NLA.2260OpenAlexW2962989821WikidataQ112878904 ScholiaQ112878904MaRDI QIDQ5206495FDOQ5206495

Authors: Dongdong Liu, Wen Li, Seak-Weng Vong 

Publication date: 18 December 2019

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

Full work available at URL: https://doi.org/10.1002/nla.2260

zbMATH Keywords

relaxation algorithmtensor equationhigher-order Markov chainmultilinear PageRank

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Iterative numerical methods for linear systems (65F10)

Cited In (18)

• Semidefinite Relaxation Methods for Tensor Absolute Value Equations
• A new modified Newton iteration for computing nonnegative \(Z\)-eigenpairs of nonnegative tensors
• Higher-order power methods with momentum for solving the limiting probability distribution vector of higher-order Markov chains
• A new preconditioner of the tensor splitting iterative method for solving multi-linear systems with \(\mathcal{M}\)-tensors
• Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems
• The MFPIO iteration and the FPMPE method for multilinear PageRank computations
• Novel accelerated methods of tensor splitting iteration for solving multi-systems
• A new preconditioned SOR method for solving multi-linear systems with an \(\mathcal{M} \)-tensor
• Improved uniqueness conditions of solution for multilinear pagerank and its application
• Tristochastic operations and products of quantum states
• Tensor approach to mixed high-order moments of absorbing Markov chains
• Slice tensor splitting method for solving tensor equation
• Vector Aitken extrapolation method for multilinear PageRank computations
• A new preconditioned AOR-type method for \(\mathcal{M}\)-tensor equation
• Multilinear PageRank: uniqueness, error bound and perturbation analysis
• Extrapolation methods for multilinear PageRank
• Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
• Multi-linear pseudo-PageRank for hypergraph partitioning

This page was built for publication: Relaxation methods for solving the tensor equation arising from the higher‐order Markov chains

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