Pages that link to "Item:Q5206495"

The following pages link to Relaxation methods for solving the tensor equation arising from the higher‐order Markov chains (Q5206495):

Displaying 17 items.

• Tensor approach to mixed high-order moments of absorbing Markov chains (Q1940338) (← links)
• A new modified Newton iteration for computing nonnegative \(Z\)-eigenpairs of nonnegative tensors (Q2106085) (← links)
• Novel accelerated methods of tensor splitting iteration for solving multi-systems (Q2133006) (← links)
• A new preconditioned SOR method for solving multi-linear systems with an \(\mathcal{M} \)-tensor (Q2177536) (← links)
• Multilinear PageRank: uniqueness, error bound and perturbation analysis (Q2189714) (← links)
• A new preconditioner of the tensor splitting iterative method for solving multi-linear systems with \(\mathcal{M}\)-tensors (Q2190866) (← links)
• Vector Aitken extrapolation method for multilinear PageRank computations (Q2700155) (← links)
• (Q5038024) (← links)
• Tristochastic operations and products of quantum states (Q6063368) (← links)
• Semidefinite Relaxation Methods for Tensor Absolute Value Equations (Q6066099) (← links)
• Slice tensor splitting method for solving tensor equation (Q6090275) (← links)
• A new preconditioned AOR-type method for \(\mathcal{M}\)-tensor equation (Q6106952) (← links)
• Multi-linear pseudo-PageRank for hypergraph partitioning (Q6123354) (← links)
• Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems (Q6159014) (← links)
• The MFPIO iteration and the FPMPE method for multilinear PageRank computations (Q6593345) (← links)
• Extrapolation methods for multilinear PageRank (Q6664401) (← links)
• Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions (Q6664835) (← links)