A nonnegativity preserving algorithm for multilinear systems with nonsingular M-tensors
From MaRDI portal
Publication:2035524
Abstract: This paper addresses multilinear systems of equations which arise in various applications such as data mining and numerical partial differential equations. When the multilinear system under consideration involves a nonsingular -tensor and a nonnegative right-hand side vector, it may have multiple nonnegative solutions. In this paper, we propose an algorithm which can always preserve the nonnegativity of solutions. Theoretically, we show that the sequence generated by the proposed algorithm is a nonnegative decreasing sequence and converges to a nonnegative solution of the system. Numerical results further support the novelty of the proposed method. Particularly, when some elements of the right-hand side vector are zeros, the proposed algorithm works well while existing state-of-the-art solvers may not produce a nonnegative solution.
Recommendations
- On nonnegative solution of multi-linear system with strong \({\mathcal{M}_z}\)-tensors
- Two new algorithms for solving multi-linear systems with M-tensor
- A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- Fast verified computation for positive solutions to \(\mathcal{M} \)-tensor multi-linear systems and Perron vectors of a kind of weakly irreducible nonnegative tensors
- An efficient algorithm for solving the nonnegative tensor least squares problem
- A homotopy method for solving multilinear systems with M-tensors
- Preconditioned Jacobi type method for solving multi-linear systems with \(\mathcal{M}\)-tensors
- A new preconditioned SOR method for solving multi-linear systems with an \(\mathcal{M} \)-tensor
- A homotopy method for solving multilinear systems with strong completely positive tensors
Cites work
- \(M\)-tensors and nonsingular \(M\)-tensors
- \(M\)-tensors and some applications
- A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
- A homotopy method for solving multilinear systems with M-tensors
- A Levenberg-Marquardt method for solving semi-symmetric tensor equations
- A projection method to solve linear systems in tensor format
- Alternating iterative methods for solving tensor equations with applications
- Alternating projection method for a class of tensor equations
- Comparison results for splitting iterations for solving multi-linear systems
- Eigenvalues of a real supersymmetric tensor
- Existence and uniqueness of positive solution for \(\mathcal{H}^+\)-tensor equations
- Finding a nonnegative solution to an M-tensor equation
- Further study on tensor absolute value equations
- Generalized tensor equations with leading structured tensors
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- Linear systems with a canonical polyadic decomposition constrained solution: Algorithms and applications
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- Solving multilinear systems via tensor inversion
- Solving sparse non-negative tensor equations: algorithms and applications
- Splitting methods for tensor equations
- Tensor absolute value equations
- Tensor analysis. Spectral theory and special tensors
- Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems
- The sparsest solutions to \(Z\)-tensor complementarity problems
- The tensor splitting with application to solve multi-linear systems
Cited in
(16)- A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
- Newton's method for M-tensor equations
- A homotopy method for solving multilinear systems with strong completely positive tensors
- A general preconditioner accelerated SOR-type iterative method for multi-linear systems with \(\mathcal{Z}\)-tensors
- A homotopy method for solving multilinear systems with M-tensors
- On nonnegative solution of multi-linear system with strong \({\mathcal{M}_z}\)-tensors
- Iterative refinement method by higher-order singular value decomposition for solving multi-linear systems
- Computing the extremal nonnegative solutions of the M-tensor equation with a nonnegative right-side vector
- Slice tensor splitting method for solving tensor equation
- A new preconditioned AOR-type method for \(\mathcal{M}\)-tensor equation
- Alternating minimization methods for solving multilinear systems
- Iterative methods for sparse symmetric multilinear systems
- Restarted nonnegativity preserving tensor splitting methods via relaxed Anderson acceleration for solving multilinear systems
- Tensor splitting preconditioners for multilinear systems
- Geometric programming for multilinear systems with nonsingular \(\mathcal{M}\)-tensors
- On the multilinear systems. I: Comparison of splittings of tensors
This page was built for publication: A nonnegativity preserving algorithm for multilinear systems with nonsingular \(\mathcal{M}\)-tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035524)
