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

DOI10.1002/nla.2260OpenAlexW2962989821WikidataQ112878904 ScholiaQ112878904MaRDI QIDQ5206495

Dongdong Liu, Seak Weng Vong, Wen Li

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

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

Related Items (14)

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 ⋮ Tristochastic operations and products of quantum states ⋮ Semidefinite Relaxation Methods for Tensor Absolute Value Equations ⋮ Multilinear PageRank: uniqueness, error bound and perturbation analysis ⋮ A new preconditioner of the tensor splitting iterative method for solving multi-linear systems with \(\mathcal{M}\)-tensors ⋮ Slice tensor splitting method for solving tensor equation ⋮ A new preconditioned AOR-type method for \(\mathcal{M}\)-tensor equation ⋮ Multi-linear pseudo-PageRank for hypergraph partitioning ⋮ 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 ⋮ Vector Aitken extrapolation method for multilinear PageRank computations ⋮ Unnamed Item ⋮ A new modified Newton iteration for computing nonnegative \(Z\)-eigenpairs of nonnegative tensors

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