Solving sparse non-negative tensor equations: algorithms and applications
DOI10.1007/s11464-014-0377-3zbMath1323.65027OpenAlexW1968373943MaRDI QIDQ2355654
Publication date: 24 July 2015
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-014-0377-3
iterative methodinformation retrievallinear convergencenumerical experimentGauss-Seidel methodJacobi methodnonnegative tensorcommunity discoverymultivariate polynomial equationmultidimensional networkquery search
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Information storage and retrieval of data (68P20) Multilinear algebra, tensor calculus (15A69)
Related Items (54)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Convergence of a second order Markov chain
- Random walk with restart: fast solutions and applications
- Perron-Frobenius theorem for nonnegative tensors
- Eine Methode zur Berechnung sämtlicher Lösungen von Polynomgleichungssystemen
- Krylov-type methods for tensor computations.I
- On the uniqueness and non-uniqueness of the positive \(\mathcal Z\)-eigenvector for transition probability tensors
- The perturbation bound for the Perron vector of a transition probability tensor
- Authoritative sources in a hyperlinked environment
- Uniqueness in the Schauder Fixed Point Theorem
- Finding all solutions to polynomial systems and other systems of equations
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- The Structure and Function of Complex Networks
- A Multilinear Singular Value Decomposition
This page was built for publication: Solving sparse non-negative tensor equations: algorithms and applications