Generalized tensor equations with leading structured tensors
Weijie Yan, Chen Ling, Liyun Ling, Hongjin He

TL;DR
This paper introduces generalized tensor equations (GTEs), explores their solution properties using Z+ tensors, and applies a Levenberg-Marquardt algorithm, expanding the theoretical and computational understanding of tensor systems.
Contribution
It defines Z+ tensors, proves existence of solutions for GTEs with such tensors, and develops an algorithm for solving these equations.
Findings
GTEs with Z+ tensors have at least one solution.
Local error bounds are established under certain conditions.
Preliminary numerical results demonstrate the algorithm's effectiveness.
Abstract
The system of tensor equations (TEs) has received much considerable attention in the recent literature. In this paper, we consider a class of generalized tensor equations (GTEs). An important difference between GTEs and TEs is that GTEs can be regarded as a system of non-homogenous polynomial equations, whereas TEs is a homogenous one. Such a difference usually makes the theoretical and algorithmic results tailored for TEs not necessarily applicable to GTEs. To study properties of the solution set of GTEs, we first introduce a new class of so-named -tensor, which includes the set of all P-tensors as its proper subset. With the help of degree theory, we prove that the system of GTEs with a leading coefficient -tensor has at least one solution for any right-hand side vector. Moreover, we study the local error bounds under some appropriate conditions. Finally, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Matrix Theory and Algorithms
