Related papers: Minimal Gersgorin tensor eigenvalue inclusion set …

By excluding some sets, which don't include any eigenvalue of a tensor, from some existing eigenvalue inclusion sets, two new sets are given to locate all eigenvalues of a tensor. And it is shown that these two sets are contained in the…

We present Gerschgorin-type eigenvalue inclusion sets applicable to generalized eigenvalue problems.Our sets are defined by circles in the complex plane in the standard Euclidean metric, and are easier to compute than known similar…

Extending an earlier result for real matrices we show that multiple eigenvalues of a complex matrix lie in a reduced Gershgorin disk. One consequence is a slightly better estimate in the real case. Another one is a geometric application.…

This article introduces an algebraic framework for establishing eigenvalue bounds for symmetric positive definite tensors by leveraging intrinsic invariants, specifically the trace and determinant (resultant). We derive a hierarchy of…

A new $Z$-eigenvalue inclusion theorem for tensors is given and proved to be tighter than those in [G. Wang, G.L. Zhou, L. Caccetta, $Z$-eigenvalue inclusion theorems for tensors, Discrete and Continuous Dynamical Systems Series B,22(1)…

An algorithm for finding the eigenvalue of a nonnegative irreducible tensor was recently proposed by Michael Ng, Liqun Qi, and Guanglu Zhou in {\it Finding the largest eigenvalue of a nonnegative tensor}. However, the authors did not prove…

Let ({\lambda}, v) be a known real eigenpair of a square real matrix A. In this paper it is shown how to locate the other eigenvalues of A in terms of the components of v. The obtained region is a union of Gershgorin discs of the second…

An S-type eigenvalue localization set for a tensor is given by breaking N={1,2,...,n} into disjoint subsets S and its complement. It is shown that the new set is tighter than those provided by L. Qi (Journal of Symbolic Computation 40…

In this paper, we introduce set-valued tensor complementarity problem where the elements of the involved tensors are defined based on a set-valued mapping. We study several properties of the solution set under the framework of set-valued…

In this article we give necessary and sufficient conditions that a complex number must satisfy to be a continuous eigenvalue of a minimal Cantor system. Similarly, for minimal Cantor systems of finite rank, we provide necessary and…

We introduce $\hat{H}$-eigenvalue for $2m$-th order $n$-dimensional complex tensors. Then we determine several checkable inclusion sets for $\hat{H}$-eigenvalues and derive some criterions for the Hermitian positive definiteness…

This paper studies tensor eigenvalue complementarity problems. Basic properties of standard and complementarity tensor eigenvalues are discussed. We formulate tensor eigenvalue complementarity problems as constrained polynomial…

A tensor $\mathcal T\in \mathbb T(\mathbb C^n,m+1)$, the space of tensors of order $m+1$ and dimension $n$ with complex entries, has $nm^{n-1}$ eigenvalues (counted with algebraic multiplicities). The inverse eigenvalue problem for tensors…

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…

This paper concerns the reconstruction of a complex-valued anisotropic tensor $\gamma=\sigma+\i\omega\varepsilon$ from knowledge of several internal magnetic fields $H$, where $H$ satisfies the anisotropic Maxwell system on a bounded domain…

Let $n$ be a positive integer and $m$ be a positive even integer. Let ${\mathcal A}$ be an $m^{th}$ order $n$-dimensional real weakly symmetric tensor and ${\mathcal B}$ be a real weakly symmetric positive definite tensor of the same size.…

This paper establishes a new comparison principle for the minimum eigenvalue of a sum of independent random positive-semidefinite matrices. The principle states that the minimum eigenvalue of the matrix sum is controlled by the minimum…

Low-rank tensor approximation techniques attempt to mitigate the overwhelming complexity of linear algebra tasks arising from high-dimensional applications. In this work, we study the low-rank approximability of solutions to linear systems…

We obtain a tail bound for the least non-zero singular value of $A-z$ when $A$ is a random matrix and $z$ is an eigenvalue of $A$ in a neighbourhood of a given point $z_0$ in the bulk of the spectrum. The argument relies on a resolvent…

Eigenvectors of tensors, as studied recently in numerical multilinear algebra, correspond to fixed points of self-maps of a projective space. We determine the number of eigenvectors and eigenvalues of a generic tensor, and we show that the…