Abstract
In this paper, we study two classes of quasi-double diagonally dominant tensors and prove they are -tensors. Numerical examples show that two classes of -tensors are mutually exclusive. Thus, we extend the decision conditions of -tensors. Based on these two classes of tensors, two estimation inequalities for the upper and lower bounds for the spectral radius of nonnegative tensors are obtained.
1. Introduction
Let () be the real (complex) field. Consider an m-th order n-dimensional tensor , which consists of entries in :
Let be the set of all n-dimensional real vectors, and let () be the set of all m-th order n-dimensional real (complex) tensors. A tensor is called nonnegative if , and we denote this by . and represent the sets of nonnegative and positive vectors in n-dimensional Euclidean space, respectively. We denote
In 2005, Lim [1] and Qi [2] defined the eigenvalues of a tensor, respectively.
Definition 1.
Let . If there are a complex number λ and a nonzero complex vector , such that
then λ is called an eigenvalue of , x is termed an eigenvector of associated with and and are vectors, whose i-th entries are
and , respectively.
Specifically, is called an H-eigenpair if . The largest eigenvalue of tensor is called the spectral radius, and we denote it by . We denote the set of eigenvalues of tensor as .
As a higher-dimensional generalization of matrices, tensors are used in many scientific fields, such as signal and image processing, continuum physics, data mining and processing, nonlinear optimization, elastic analysis in physics, and higher-order statistics [3,4,5,6]. The properties and criteria of -tensor (-tensor) were discussed in detail in [7,8,9], and the relevant results were given. There are many applications for the -tensor (-tensor); for example, the multilinear systems can be expressed as , where and are given, and x is to be solved. Examples of multilinear systems can be found in [10,11,12,13]. Consider the positive define of ; that is, when , the -tensor is also an important application [9]. The estimation of the upper and lower bounds for the spectral radius of a nonnegative tensor is an important element in the study of the spectral problem of nonnegative tensors [14,15], and the application of the relation between the -tensor and the nonnegative tensor gives an estimate of the upper and lower bounds for the spectral radius of the nonnegative tensor. By analyzing the tensor structure, two classes of quasi-double diagonally dominant tensors are given in this paper, and they are proved to be -tensors; at the same time, an inequality is given for the estimation of the upper and lower bounds for the spectral radius of the nonnegative tensor.
2. Preliminaries
In this section, we first recall some preliminary knowledge important to our work on nonnegative tensors.
Ref. [16] generalized the concept of irreducible matrices to irreducible tensors.
Definition 2 ([16]).
An m-th order n-dimensional tensor is called reducible if there exists a nonempty proper index subset , such that
If is not reducible, then is irreducible.
Definition 3 ([17]).
Let .
- (1)
- We call a nonnegative matrix the representation associated with the nonnegative tensor , if the -th element of is defined to be the summation of with indices
- (2)
- We call weakly reducible if its representation is a reducible matrix, and we call it weakly primitive if is a primitive matrix. If is not weakly reducible, then it is called weakly irreducible.
Definition 4 ([7,18]).
Let , be a positive diagonal matrix of order n; we define it as .
We use to denote the m-th order n-dimensional unit tensor with entries
and we define the following m-th order Kronecker delta
Let , and denote
The study of the conditions for the determination of the -tensor is the basis for the application of the -tensor. The literature [7,8,9] provides some methods for the determination of the -tensor. In this paper, a different method is used to obtain a class of quasi-double diagonally dominant tensor by carefully analysing the structure of the tensor, and another class of quasi-double diagonally dominant tensor is discussed by analysing the digraph of the majorization matrix of the tensor.
In the following, we describe two classes of quasi-double diagonally dominant tensors, prove that they are nonsingular -tensors, and give several inequalities to estimate the spectral radius of nonnegative tensors based on the correspondence between the diagonal dominance of a tensor and the inclusion domain of its eigenvalues.
3. Two Classes of Quasi-Double Diagonally Dominant -Tensors
In this section, we describe two classes of quasi-double dominant -tensors and show that the two classes of tensors are not mutually inclusive.
Definition 5 ([8]).
Let . If
then tensor is called diagonally dominant. If (1) are all strictly inequalities, then tensor is called strictly diagonally dominant. If tensor is irreducible, and (1) holds at least one strict inequality, then tensor is called irreducible diagonally dominant. If there is a positive diagonal matrix D, such that is strictly diagonally dominant, then tensor is called generalized strictly diagonally dominant.
Definition 6 ([9]).
For , its comparison tensor, denoted by , is defined as
Definition 7 ([7,8,9]).
Let . Tensor is said to be a -tensor if it can be written as , where . Furthermore, if , then tensor is said to be an -tensor, and if , then tensor is said to be a nonsingular -tensor.
Reference [6] also proved the following:
Theorem 1 ([9]).
If is a -tensor, then tensor is a nonsingular -tensor if and only if
Definition 8 ([7,8]).
Let . If the comparison tensor of tensor is an -tensor, then tensor is called an -tensor, and if comparison tensor is a nonsingular -tensor, then tensor is called a nonsingular -tensor.
Theorem 2 ([7,8]).
Let . If tensor is strictly diagonally dominant, irreducible diagonally dominant, or generalized strictly diagonally dominant, then tensor is called a nonsingular -tensor.
Theorem 3.
Let . If
- (i)
- (ii)
then is nonsingular; that is, .
Proof.
If , then there exists such that
Assume ; therefore, , and we have
Hence,
thus, we have
i.e.,
Theorem 4.
If , then , where
Proof.
If is an eigenvalue of tensor , then . From Theorem 3, we know there is some such that
or there is some such that
Therefore, we have or . □
Theorem 5.
Let . If
- (i)
- (ii)
then is a nonsingular -tensor; that is, is a nonsingular -tensor.
Proof.
Consider the comparison tensor of tensor . Otherwise, if there exists then from (i), we have
From (ii), we have
Hence, from (i) and (ii), we have
Therefore, from Theorem 4, we know a contradiction with . Thus, there must be . Then, from Theorem 1, we know is a nonsingular -tensor; so, from Definition 8, we know tensor is a nonsingular -tensor. □
Let ; its majorization matrix [19], we denote by where The digraph [20] of matrix is denoted as , and the directed edge on is denoted as ,
Theorem 6.
Let . If
- (i)
- (ii)
then
Proof.
If then there exists such that
Assume ; therefore, .
- (1)
- If then From (5), we have
Hence, we have
i.e.,
This is in contradiction with (ii).
- (2)
- If we assume
then We discuss this in two cases:
- (2.1)
- Let ; from (5), we have
Hence, we have
i.e.,
Similarly, from (5), we have
Thus,
i.e.,
- (2.2)
- If then we have
thus,
Hence,
Combining (2.1) and (2.2), we know that the result contradicts with (ii). Recombining (1) and (2), we know □
Theorem 7.
If then
Proof.
If is an eigenvalue of tensor , then . From Theorem 6, we know there is some such that
or there exists , such that
□
Theorem 8.
Let If
- (i)
- (ii)
then is a nonsingular -tensor; that is, is a nonsingular -tensor.
Proof.
Consider the comparison tensor of tensor . Similar to the proof of Theorem 5, we know . Therefore, from Theorem 1, we know the comparison tensor of tensor is a nonsingular -tensor; so, is a nonsingular -tensor. □
We give a simple example for Theorems 5 and 8, respectively.
Example 1.
Let , where
Clearly, tensor is a -tensor, due to ; thus, is not a strictly diagonally dominant tensor. By calculation, we have
Conditions (i) and (ii) of Theorem 5 is satisfied; therefore, from Theorem 5, we know tensor is a nonsingular -tensor; so, is a nonsingular -tensor.
Example 2.
Let , where
Clearly, tensor is a -tensor, due to ; thus, tensor is not strictly diagonally dominant. However, it is easy to verify that the condition of Theorem 8 is satisfied; therefore, is a nonsingular -tensor; that is, is a nonsingular -tensor.
Remark 1.
The conditions of Theorems 3 and 8, which determine the -tensor, are not mutually inclusive. If Example 1 satisfies the conditions of Theorem 3, it is known to be an -tensor by applying Theorem 3; however,
Therefore, the conditions of Theorem 8 are not satisfied, and thus Theorem 8 can not determine it to be an -tensor.
Another example is Example 2, which satisfies the conditions of Theorem 8 and is known to be an -tensor by applying Theorem 8; however,
Therefore, the conditions of Theorem 3 are not satisfied, and thus Theorem 3 cannot be applied to determine that it is an -tensor.
4. Estimation Inequalities for the Spectral Radius of Nonnegative Tensors
Based on the two classes of -tensors given in Section 3, two estimation inequalities for the spectral radius of nonnegative tensors are given in this section. First, some basic results of the spectral radius are introduced.
Let . If , then we denote
Theorem 9 ([21]).
Let , and . If , then . Specifically, .
For the spectral properties of general nonnegative tensors, Ref. [21] provided the following results.
Theorem 10.
If then is the eigenvalue of , and there is a corresponding nonnegative eigenvector .
Theorem 11.
Let be an m-th order n-dimensional nonnegative weakly irreducible tensor; then, there exists a unique positive eigenvector corresponding to the spectral radius up to a multiplicative constant.
In [21], the upper and lower bounds for the spectral radius of a nonnegative tensor were given, which all depended only on the entries of .
Theorem 12.
If then
Based on Theorems 4 and 5 in Section 3, the following estimation inequalities for the upper and lower bounds for the spectral radius of nonnegative tensors are given.
Theorem 13.
Let ; then,
where
Proof.
From Theorem 10, we have . From Theorem 4, we know there exists , satisfying
or there exists satisfying
Therefore,
On the other hand, if is weakly irreducible, then it is known from Theorem 11 that there exists , such that
Thus, we have
and
Therefore, we have
For general nonnegative tensors , we define
where ; then, is irreducible. Therefore, from the above proof, we have
Notice that are continuous functions of . Let ; then,
□
Remark 2.
The inequality in the spectral radius of nonnegative tensors given by Theorem 13 is not a complete improvement of Theorem 12, and it can be combined with Theorem 12 to obtain further improved results.
Theorem 14.
If , then
where , see Theorem 13.
Similarly, based on Theorems 7 and 8 in Section 3, we have the following estimation inequalities for the upper and lower bounds of the spectral radius of nonnegative tensors.
Theorem 15.
If is weakly irreducible, then
where
Proof.
From Theorem 10, we have . From Theorem 7, we know there exists , satisfying
or there exists , satisfying
Therefore, we have
Next, we prove that the left-hand side of the inequality of the theorem holds.
Since is weakly irreducible, and from Theorem 11, we have ; therefore, there exists , such that
Without loss of generality, suppose that
- (1.1)
- If , then . From (9), we have
Therefore,
- (1.2)
- If , assume ; then, From (10), we have
Similarly, from
we obtain
Therefore, we have
that is,
□
The estimation of the spectral radius of a general nonnegative tensor has the following result.
Theorem 16.
If , then
where , see Theorem 15.
Proof.
We only need to prove the inequality on the left. Let be reducible but not weakly irreducible. We construct nonnegative tensors , where
then, is weakly irreducible. Similar to the proof of Theorem 15, and with as a continuous function of , letting , we obtain
□
The following results show that Theorem 15 is an improvement of Theorem 12.
Theorem 17.
If , then
where , see Theorem 15.
Proof.
Without loss of generality, suppose that for any , we have
When , we have
When , we have
From Theorem 12, we have
Similar to the above proof of the theorem, we have
□
Example 3.
Let
Thus, . From Theorem 17, we obtain
Therefore,
From Theorem 12,
Example 4.
Let
We know that is weakly irreducible, and
Thus, . From Theorem 15, we obtain
Therefore,
From Theorem 12,
5. Conclusions
In this paper, by systematically analyzing the structure of tensors, a new classification method was used to define a class of quasi-double diagonally dominant tensors, and another class of quasi-double diagonally dominant tensors was defined by applying the digraph of the majorization matrix of a tensor, proving that they were -tensors and further extending the determination conditions of -tensors. Moreover, inequalities for estimating the upper and lower bounds for the spectral radius (the largest H-eigenvalue) of nonnegative tensors were given based on the relationship between the diagonal dominance of the tensor (-tensor) and the inclusion domain of the eigenvalues of the tensor, and these inequalities improved the Perron–Frobenius inequality for estimating the upper and lower bounds for the spectral radius of nonnegative tensors. This paper provides new ways of thinking to provide more refined determination conditions for the -tensor and to improve the inequalities for estimating the upper and lower bounds of the spectral radius of the nonnegative tensor.
Author Contributions
In this paper, H.L. proposed the concept of the quasi-double diagonal dominance of tensors, and X.W. consulted the relevant literature and specifically gave two quasi-double diagonal dominance forms of tensors. X.W. and H.L. jointly completed the proof of the theorem, and H.L. reviewed it. All authors have read and agreed to the submitted version of the manuscript.
Funding
This work was supported by the Natural Sciences Program of Science and Technology of Jilin Province of China (20190201139JC).
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Lim, L.H. Singular value and and eigenvalue of tensors, a variational approach. In Proceedings of the 1st IEEE International Workshop on Computational Advances in Multi Sensor Adaptive Processing, Puerto Vallarta, Mexico, 13–15 December 2005; pp. 129–132. [Google Scholar]
- Qi, L.Q. Eigenvalues of a real supersymmetric tensor. J. Symb. Comput. 2005, 40, 1302–1324. [Google Scholar] [CrossRef] [Scilit]
- Cichocki, A.; Zdunek, R.; Phan, A.H.; Amari, S.I. Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-Way Data Analysis and Blind Source Separation; John Wiley and Sons, Ltd.: Natick, MA, USA, 2009. [Google Scholar]
- Hu, S.; Huang, Z.H.; Ling, C.; Qi, L. On determinants and eigenvalue theory of tensors. J. Symb. Comput. 2013, 50, 508–531. [Google Scholar] [CrossRef] [Scilit]
- Moakher, M. On the averaging of symmetric positive-definite tensors. J. Elast. 2006, 82, 273–296. [Google Scholar] [CrossRef] [Scilit]
- Nikias, C.L.; Mendel, J.M. Signal processing with higher-order spectra. IEEE Signal Process. Mag. 1993, 10, 10–37. [Google Scholar] [CrossRef] [Scilit]
- Ding, W.Y.; Qi, L.Q.; Wei, Y.M. -tensors and nonsingular -tensors. Linear Algebra Appl. 2013, 439, 3264–3278. [Google Scholar] [CrossRef] [Scilit]
- Kannan, M.R.; Shaked-Monderer, N.A. Berman. Some properties of strong H-tensors and general H-tensors. Linear Algebra Appl. 2015, 476, 42–55. [Google Scholar] [CrossRef] [Scilit]
- Zhang, L.P.; Qi, L.Q.; Zhou, G.L. -tensors and some applications. SIAM J. Matrix Anal. Appl. 2014, 35, 437–452. [Google Scholar] [CrossRef] [Scilit]
- Li, X.; Ng, M.K. Solving sparse non-negative tensor equations: Algorithms and applications. Front. Math. China 2015, 10, 649–680. [Google Scholar] [CrossRef] [Scilit]
- Li, X.; Ng, M.K.; Ye, Y. HAR: Hub, Authority and Relevance scores in multi-relational data for query search. In Proceedings of the 2012 SIAM International Conference on Data Mining, Anaheim, CA, USA, 26–28 April 2012; pp. 141–152. [Google Scholar]
- Li, X.; Ng, M.K.; Ye, Y. MultiComm: Finding community structure in multi-dimensional networks. IEEE Trans. Knowl. Data Eng. 2014, 26, 929–941. [Google Scholar] [CrossRef] [Scilit]
- Ng, M.K.; Li, X.; Ye, Y. MultiRank: Co-ranking for objects and relations in multi-relational data. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, 21–24 August 2011; pp. 1217–1225. [Google Scholar]
- Jin, H.; Kannan, M.; Bai, M. Lower and upper bounds for H-eigenvalues of even order real symmetric tensors. Linear Multilinear Algebra 2017, 65, 1402–1416. [Google Scholar] [CrossRef] [Scilit]
- Li, S.; Chen, Z.; Li, C.; Zhao, J. Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices. Comput. Appl. Math. 2020, 39, 293–312. [Google Scholar] [CrossRef] [Scilit]
- Chang, K.C.; Pearson, K.; Zhang, T. Perron-Frobenius theorem for nonnegative tensors. Commun. Math. Sci. 2008, 6, 507–520. [Google Scholar] [CrossRef] [Scilit]
- Friedland, S.; Gaubet, S.; Han, L. Perron-Frobenius theorem for nonnegative multilinear forms and extensions. Linear Algebra Appl. 2013, 438, 738–749. [Google Scholar] [CrossRef] [Scilit]
- Koldda, T.G.; Bader, B.W. Tensor decompositions and applications. SIAM Rev. 2009, 51, 455–500. [Google Scholar] [CrossRef] [Scilit]
- Pearson, K.J. Essentially positive tensors. Int. J. Algebra 2010, 4, 421–427. [Google Scholar]
- Hord, R.A.; Johnson, C.R. Matrix Analysis; Cambridge University Press: New York, NY, USA, 1985. [Google Scholar]
- Yang, Y.; Yang, Q. Further results for Perron-Frobenius theorem for nonnegative tensors. SIAM. J. Matrix Anal. Appl. 2010, 31, 2517–2530. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).