Abstract
In this paper, theories, algorithms and properties of eigenvalues of quaternion tensors via the t-product termed T-eigenvalues are explored. Firstly, we define the T-eigenvalue of quaternion tensors and provide an algorithm to compute the right T-eigenvalues and the corresponding T-eigentensors, along with an example to illustrate the efficiency of our algorithm by comparing it with other methods. We then study some inequalities related to the right T-eigenvalues of Hermitian quaternion tensors, providing upper and lower bounds for the right T-eigenvalues of the sum of a pair of Hermitian tensors. We further generalize the Weyl theorem from matrices to quaternion third-order tensors. Additionally, we explore estimations related to right T-eigenvalues, extending the Geršgorin theorem for matrices to quaternion third-order tensors.
MSC:
15A23; 15A69; 65F30
1. Introduction
Quaternion algebra was first introduced by Hamilton [1], and it is a noncommutative division ring. One of its most important properties is that multiplication does not satisfy the commutative law, which leads to many situations that hold for complex numbers not being valid in quaternion algebra. However, quaternions play a crucial role in various fields, including computer graphics, signal processing, image processing, face recognition, etc. (e.g., [2,3,4,5,6,7]).The concept of tensors is extended from that of matrices, and tensors can serve as valuable resources for handling high-dimensional data, such as image processing [8], computer vision [9] and analysis of medical data [10]. In recent years, numerous scholars have studied tensors and their various applications [11,12,13,14,15,16]. To the best of our knowledge, the eigenvalues of matrices are widely used in various fields, such as facial recognition, image processing, image denoising, image clustering, etc. (e.g., [17,18,19]). As an extension from matrices, eigenvalues of tensors have begun to receive more and more attention among scholars, and theories and applications about different kinds of eigenvalues of tensors have been explored, such as E-eigenvalue, H-eigenvalue, Z-eigenvalue, etc. (e.g., [20,21]). Recently, with the advent of the tensor Einstein product [22] and the t-product [23], there has been a growing interest in the eigenvalues of tensors associated with these operations. For instance, He et al. have already studied theories and algorithms of eigenvalues of tensors via the Einstein product on quaternion realm and have given applications of color video processing [24,25]. Very recently, Liu et al. [26] have proposed eigenvalues of tensors under the t-product named T-eigenvalues, and have extended Weyl’s theorem and Cauchy’s interlacing theorem from matrix case to tensor case. Chen et al. [27] concentrated on perturbation theory regarding the tensor T-eigenvalues, and give three extensions from matrix domain to tensor domain: the Geršgorin theorem [28], the Bauer–Fike theorem [29] and Kahan theorem [30]. Recent research on t-products has primarily concentrated on tensors within real and complex number fields, whereas the study of quaternion algebra has been comparatively limited. To address this gap in research, this paper seeks to explore the theoretical foundations, computational methods and distinctive characteristics of T-eigenvalues in the realm of third-order quaternion tensors.
The arrangement of the remaining sections of the paper is as follows: In Section 2, we provide the basic symbols and definitions that will be used later. In Section 3, we present the computation of right T-eigenvalues and their associated T-eigentensors for third-order quaternion tensors under the T-product, and we compare our algorithm with other methods in terms of computational error and CPU time to demonstrate the efficiency of our method. In Section 4, we investigate some important inequalities related to the right T-eigenvalues for Hermitian quaternion tensors. In Section 5, we explore estimations concerning the right T-eigenvalues.
2. Preliminaries
In this section, some basic notations and definitions are given. First, we begin with some notations that will be used in the following sections. In this paper, the real number field, the complex number field and the quaternion algebra are symbolized by , and , respectively. The scalars under real number field or complex number field are denoted by lowercase characters such as q, and we use bold minuscule letters to denote vectors, like . For matrices, we choose bold uppercase characters to symbolize them, for example, . For tensors, we utilize Euler script letters to denote them, taking the expression for example. In the context of quaternion algebra, these symbols are accompanied by a breve, i.e., and , respectively.
Quaternion algebra [1] is a noncommutative division ring. For any given quaternion, here we use the bold lowercase letters and to denote the three imaginary units of any given quaternion. Each element of the quaternion algebra can be denoted as , where and , , satisfy that , , and . The modulus of the above quaternion number can be expressed as , and a quaternion is called unit pure quaternion provided that and . The conjugate of the above quaternion is . For any nonzero quaternion , there is an inverse . For two quaternions and , the dot product of and is defined as , and if , i.e., . We use to denote of the dimension of a subspace of , which is considered as a right quaternion vector space, and we use to symbolize the subspace spanned by . Given a quaternion vector , the norm on is denoted by [31]. For a set of quaternion vectors {}, we say they are orthonormal if , where is the Kronecker delta, i.e., if , and if . For more details about quaternion algebra, we propose that the readers read the latest book about quaternions [31].
Similarly, we can use this expression to denote a quaternion matrix , where each . The conjugate transpose of quaternion matrix is . The Kronecker product for two matrices and is denoted by , which is the quaternion matrix with the following structure:
In this paper, we focus on third-order quaternion tensors, which only have three dimensions. A third-order quaternion tensor with elements can be denoted by , where , , . For a third-order quaternion tensor , its Frobenius norm is denoted as . For a third-order quaternion tensor , the i-th frontal slice is referred to as in this paper, which can also be represented by using MATLAB R2022a notation to describe algorithms. Additionally, we will introduce the following operators related to the quaternion third-order tensor that are frequently used in the following sections, i.e., , [23,32]:
where is the i-th frontal slice of tensor with a size of , . It is noteworthy that and .
A quaternion discrete Fourier transform matrix has the following structure [33]:
where , and is a unit pure quaternion. According to [33], the quaternion discrete Fourier transform matrix is a unitary matrix satisfying
where
Next, we give some basic definitions about third-order quaternion tensors that will be utilized in the subsequent sections:
Definition 1
(T-product [23,32]). Let and , then we call the following expression the t-product of and :
Definition 2
(F-square tensor [34]). A tensor is referred to as an F-square tensor provided that each of its frontal slices are square matrices.
Definition 3
(Identity tensor [23]). We call a third-order tensor an identity tensor if its first frontal slice is an identity matrix with the rest being zero matrices.
Definition 4
(Conjugate transpose of a third-order quaternion tensor [23]). Given , the conjugate transpose of is represented by , which is obtained by conjugating and transposing every frontal slice of , then reversing the order from 2 to .
Definition 5
(Right T-eigenvalue and T-eigentensor). Given , the right T-eigenvalue is a quaternion number satisfying that
where is a nonzero quaternion tensor named T-eigentensor of corresponding to . We use to represent the set containing all the right T-eigenvalues of .
It is clear that for each right T-eigenvalue of , we have the following observations:
that is to say, the right T-eigenvalues of clearly correspond to the right eigenvalues belonging to the quaternion matrix , and the relationship holds in the reverse direction as well.
Definition 6
(Hermitian quaternion tensors). A quaternion tensor is called a Hermitian tensor provided that .
3. The Right T-Eigenvalues of Third-Order Quaternion Tensors
In this section, we consider the right T-eigenvalues of third-order quaternion tensor . The following is a list of several useful lemmas:
Lemma 1
([35]). Given four quaternion matrices , , and of appropriate dimensions, then the following properties of the Kronecker product hold:
- 1.
- ;
- 2.
- .
where “⊗” denotes the Kronecker product.
Lemma 2
([32,34]). Given a third-order quaternion tensor , the subsequent statements are true:
- 1.
- , where .
- 2.
- .
- 3.
- .
We have the following theorems.
Lemma 3
([33]). Suppose a quaternion circulant matrix is in a three-axis system , where is any given unit pure quaternion, is a unit pure quaternion satisfying and . Then, there exists a permuted quaternion Fourier transform matrix that can block-diagonalize , that is,
where is a permutation matrix obtained by exchanging of the i-th and -th columns of a identity matrix for when m is odd or for when m is even. is of size , while the other diagonal block is of size when m is odd. In the final diagonal block for an even m, there is an additional 1-by-1 matrix, in addition to the previously mentioned diagonal blocks.
Theorem 1.
Given a quaternion circulant matrix , the matrix has the same right eigenvalues as matrix , where is a permutation matrix defined as in Lemma 3.
Proof.
Suppose is one right eigenvalue of , and is the corresponding eigenvector, i.e.,
The above equation holds true because .
Let ; it is easy to find that , and from Equation (10) we have that
That is to say, is also one right eigenvalue of , and is an eigenvector corresponding to . □
Corollary 1.
Given a quaternion F-square tensor , the matrix has the same right eigenvalues as matrix , where is a permutation matrix defined by swapping the t-th and -th columns of an identity matrix for if n is odd or for if n is even.
Theorem 2.
Assume that , where each is a quaternion matrix. Then, we have that the right eigenvalues of are the union of right eigenvalues of quaternion matrices , that is, .
Proof.
Suppose that the size of each matrix is , and is one right eigenvalue belonging to with the corresponding eigenvector . Then, we have that
Thus, it is easy to see that is one right eigenvalue of with the correlated eigenvector , and the right eigenvalues of the block-diagonal quaternion matrix consist of the right eigenvalues of each diagonal block , . □
Theorem 3.
Given an F-square tensor is in a three-axis system , where is any given unit pure quaternion, is a unit pure quaternion satisfying and . Thus, the right T-eigenvalues of are composed of right eigenvalues of the diagonal block matrices of , where is a permutation matrix by swapping i-th and -th columns of a identity matrix for if n is odd and for if n is even; is the quaternion discrete Fourier transform matrix.
Proof.
It is shown by Ng et al. [33] that a permuted quaternion discrete Fourier transform matrix can transform a quaternion circulant matrix into a block-diagonal form, and further it is extended to the following case:
Given a third-order F-square tensor , then according to [33], we have that
where if n is even, if n is odd. is a permutation matrix by swapping the i-th and the -th columns of an identity matrix for if n is odd or for if n is even. It is worth noting that is a block-diagonal quaternion matrix with being while other diagonal blocks are if n is odd, and in the final diagonal block for an even m, there is an additional matrix, in addition to the previously mentioned diagonal blocks.
It is noted that the proofs for both the even and odd cases bear similarities. For the sake of simplicity, only the odd case will be considered here.
Suppose that is one right eigenvalue of diagonal block matrix with the corresponding nonzero eigenvector . Then by Theorem 2, we have that is also one right eigenvalue of with the corresponding eigenvector , that is,
After left-multiplying both sides of Equation (13) by matrix , we can determine that
Let , then it is easy to see that . Thus we have that is one right T-eigenvalue belonging to , and the corresponding T-eigentensor is . This can be proven by the combination of the proof of Theorems 1 and 2, that is, □
Theorem 4.
Given a right T-eigenvalue of the quaternion tensor with a T-eigentensor related to , then for every nonzero quaternion number , is again a right T-eigenvalue of with the corresponding T-eigentensor .
Proof.
Note that , thus we have that
□
Regarding a Hermitian quaternion tensor , the following theorems hold.
Theorem 5.
Given , then is a Hermitian tensor .
Theorem 6.
The right T-eigenvalues of a quaternion Hermitian tensor all belong to the real number field.
Proof.
It is evident that if from Lemma 2, then is a quaternion Hermitian matrix. Suppose that is one right T-eigenvalue belonging to with the corresponding eigentensor , i.e., . That is,
Let , and from the above equation it is easy to see that
Due to the fact that , we have
We multiply from the right side of the above equation, then we obtain this equation:
and one step closer, we have
i.e.,
Then, we have . □
Proposition 1.
Given a Hermitian quaternion third-order tensor , then each diagonal block in Equation (12) is a Hermitian matrix.
Proof.
According to Theorem 3, it is easy to see that
which means that is a Hermitian matrix, i.e., .
Then, we have . □
Very recently, Wu et al. [36] proposed a complex representation matrix (CRM) of third-order quaternion tensors under Qt-product, which provides a way to map quaternion operators to their complex counterparts, providing a promising avenue for generalizing classical tensor algorithms to the quaternion case. By this, the computational complexity generated by extra imaginary parts of quaternions can be reduced. Inspired by [36], here we consider complex representation matrix to compute right T-eigenvalues of third-order quaternion tensors. First, we revisit the complex representation operator for a quaternion matrix.
Definition 7
(Complex representation operator for a quaternion matrix [31]). Given a quaternion matrix in its Cayley–Dickson (CD) form , where is an operator defined as follows:
Definition 8
(Complex representation matrix of third-order quaternion tensors under t-product). Consider and the corresponding block-diagonal matrix in (12). Then, is an operator defined as where Φ is the complex representation operator for quaternion matrices.
Based on the proof of the theorems above, next we provide an algorithm for calculating the right T-eigenvalues belonging to a quaternion tensor .
Upon the constructed algorithm, next we give a numerical experiment and compare our method with the command eig in Quaternion tool box [37] for computing the right eigenvalues of , i.e., the right T-eigenvalues of . For each right T-eigenvalue and the corresponding T-eigentensor of , we define the residual by . Then, we define the error for calculating right T-eigenvalues of as follows: Error .
Example 1.
Suppose with the following structure:
By Algorithm 1, we can compute its right T-eigenvalues and the corresponding T-eigentensors as follows:
| Algorithm 1: Calculation for the right T-eigenvalues of a third-order quaternion tensor |
|
|
|
|
|
|
|
In this example, the Error of Algorithm 1 is and the CPU time is 0.0122253 s, compared with the Error and the CPU time 0.0409140 s of the method based on the command eig in Quaternion tool box [37], which means that our method for computing the right T-eigenvalues is faster while maintaining better computational accuracy.
4. Inequalities for Right T-Eigenvalues of Hermitian Quaternion Tensors
Next, we examine the inequalities for right T-eigenvalues belonging to Hermitian quaternion third-order tensor , and we assume that the right T-eigenvalues are arranged in nondecreasing order, i.e., .
Fact 1
([31]). Vectors are linearly independent over if and only if they are linearly independent over , i.e., is equal to .
Lemma 4.
Given a Hermitian matrix , let be orthonormal eigenvectors of associated with real right eigenvalues , respectively.
Assume that is spanned by the above eigenvectors, i.e., . Thus for any unit , we have
Proof.
Let , then . One step closer, we have
Since , then it is easy to determine that . □
Lemma 5
(Rayleigh–Ritz). Consider a third-order Hermitian tensor . Then,
and
Proof.
The eigenvectors of form an orthonormal basis for . By Lemma 4, it is easy to observe that
□
The following theorem yields the lower and upper bounds for right T-eigenvalues of .
Theorem 7.
Given two Hermitian tensors and of the same size , then the following hold:
- 1.
- ;
- 2.
- .
Proof.
- Let be a unit vector. Then, we haveThen,which gives the desired inequality.
- ; according to Lemma 5, we havewhich gives to .
□
Next, we extend the Weyl theorem from matrices to third-order Hermitian tensors, and only the right T-eigenvalues are considered.
Lemma 6
(Weyl [39]). Assume that and are both Hermitian matrices, and let , , be the right eigenvalues of , and , respectively. All of them are arranged in nondecreasing order, then
For each , the equality holds if and only if in the case that there exists , satisfying
Similarly, we have that
For each , the equality holds if and only if in the case that there exists such that
Theorem 8.
Given two quaternion Hermitian tensors and with the identical size , let , , be the right T-eigenvalues of , and , respectively. All of them are arranged in nondecreasing order, then
For each , the equality holds if and only if inthe case that there exists a nonzero tensor , where such that
where is a permutation matrix obtained by a series of multiplications of elementary permutation matrices like in Theorem 3, and is the discrete quaternion Fourier matrix. Similarly, we have that
For each , the equality holds if and only if in the case that there exists nonzero such that
Proof.
For simplicity, only the case where m is odd is taken into consideration and the even case can be similarly discussed.
It is not difficult to see that and are both Hermitian matrices, as and are Hermitian tensors. Then, so is , i.e., is a Hermitian tensor. According to the definition of T-eigenvalue, it is easy to see that the right T-eigenvalues of , and are right eigenvalues of Hermitian matrices , and , respectively. Then, inequalities (30) and (31) hold immediately according to Lemma 6. And the equalities in (30) and (31) hold if and only if there exists one vector such that
That is to say, is the common eigenvector of , and associated with right eigenvalues , and . From Theorem 3, we have that is the common eigenvector of , and , i.e., , and , with the corresponding right eigenvalues , and . For convenience in notation, we denote as the t-th diagonal block of .
Suppose that has the following partition:
where and , . Based on the fact that , and are all block-diagonal matrices with the same block structure, and according to Theorem 3, it is easy to see that must be a right eigenvalue belonging to some diagonal block in and a right eigenvalue belonging to some diagonal block in , similarly, be a right eigenvalue associated with some diagonal block in . Consequently, there exist three index sets denoted as , and , which are subsets of that satisfy the following equations:
Since is a common eigenvector of , and , we have and when . It is easy to find that is also a common eigenvector of , and when , where and are zero vectors of an appropriate size. It is worth pointing out that the column vector has the same row partition with , and . This yields that is a common eigenvector of block circulant matrices , and . Consequently, , and have a common T-eigentensor .
Conversely, suppose that , and share a common T-eigentensor of the form , which satisfies the following equations:
5. The Estimation of Right T-Eigenvalues of Quaternion Tensors
To the best of our knowledge, the disc theorem is a key result used to estimate the spectra of square matrices. This section is devoted to the localization of the right T-eigenvalues of a third-order quaternion tensor under the tensor–tensor product. Next, we extend the theorem from matrices to third-order quaternion tensors via the t-product.
Lemma 7
([28]). Given a quaternion matrix , let . For each right eigenvalue belonging to , there exists a nonzero quaternion that satisfies that (which is also a right eigenvalue) lies in the union of the balls . Specifically, if is a real number, it is located in a ball.
Theorem 9
( theorem for right T-eigenvalues of third-order quaternion tensors). Given a third-order quaternion tensor , the following hold:
- Case 1: If m is odd, let be a permutation matrix by swapping i-th and -th columns of an identity matrix for . Then, , where , when ; when . Let and , . Then, for each right T-eigenvalue of , there exists a quaternion such that (which is also a right T-eigenvalue) lies in the union of closed balls . Specifically, if is a real T-eigenvalue of , it is contained in a ball.
- Case 2: If m is even, let be a permutation matrix by swapping i-th and -th columns of an identity matrix for . Then, , where , when and ; when and . Let , and , and . Then, for each right T-eigenvalue belonging to , there exists a quaternion such that (which is also a right T-eigenvalue) lies in the union of closed balls . Specifically, if is a real T-eigenvalue of , it is contained in a ball.
Proof.
For simplicity, we only consider the odd case here as the even case can be similarly proved.
As shown in [33], a quaternion block circulant matrix can be block-diagonalized into a block-diagonal matrix with n-by-n blocks and 2n-by-2n blocks. That is, given a tensor , then we have
where , is of size , while , is of size , .
Applying Theorem 3 and Lemma 7, it is easy to obtain the desired result. □
Remark 1.
The even case can be similarly proved as the odd case, except that there exist one more n-by-n block at the right bottom of the block-diagonal matrix , which we do not elaborate further here.
Example 2.
Consider a third-order Hermitian tensor of the following structure:
By Algorithm 1, the right T-eigenvalues of are 6.7446, 11.9286, 17.3269, 6.4356, 3.5744, −2.2721, −11.2869, −9.0741 and −5.3769. According to Theorem 9, we have that the right T-eigenvalues of are contained within the union of the nine closed discs listed below:
Lemma 8
([28]). Consider a quaternion matrix , if there exists t connected balls, each of which is disjointed with others. Then, there exists at least t right eigenvalues of .
Theorem 10.
Given a third-order quaternion tensor , if there are m connected balls that are disjoint with other balls, then the connected region must contain at least m right T-eigenvalues of the third-order quaternion tensor (some of which may be counted multiple times).
Proof.
Suppose an F-square tensor is in a three-axis system , where is any given unit pure quaternion, is a unit pure quaternion satisfying and . As the cases for even n and odd n are highly similar, we consider only the odd case. By the above proofs, we know that there exists an quaternion Fourier transform matrix and a permutation matrix such that the following equation holds:
where is obtained by swapping the t-th and -th columns of a identity matrix for , and while , . From Theorem 3, we know that Employing Lemma 7 yields the conclusion that for each right T-eigenvalue of there exists a quaternion such that (which is again a right T-eigenvalue) is located in the union of those balls , where and , . The desired conclusion then can be obtained by applying the result of Lemma 8 to in Equation (35). □
6. Conclusions and Prospects
In this paper, we explore the right T-eigenvalues of third-order quaternion tensors, and we give an algorithm to compute it, along with a specific example, which involves comparison with other methods in terms of computational error and CPU time to demonstrate the better accuracy and speed of our algorithm. We prove that the right T-eigenvalues are real numbers, and give the upper and lower bounds for the right T-eigenvalues of the sum of a pair of Hermitian tensors. Moreover, we extend the Weyl theorem and theorem from matrices to third-order Hermitian quaternion tensors. However, there is still potential for progress in our research article. Recently, Miao et al. [40] have generalized the tensor–tensor product to higher-order cases, which is a flexible transform-based tensor product, i.e., Qt-product. Currently, research on the eigenvalues of higher-order quaternion tensors is relatively scarce. This finding opens new avenues for our future research. In the future, we hope to conduct more research on the eigenvalues of higher-order quaternion tensors.
Author Contributions
Conceptualization, Z.-H.H. and M.-L.D.; methodology, Z.-H.H. and M.-L.D.; software, Z.-H.H. and M.-L.D.; validation, Z.-H.H., M.-L.D. and S.-W.Y.; formal analysis, Z.-H.H. and M.-L.D.; writing—original draft preparation, Z.-H.H. and M.-L.D.; writing—review and editing, Z.-H.H., M.-L.D. and S.-W.Y.; supervision, Z.-H.H. and S.-W.Y.; funding acquisition, Z.-H.H. All authors have read and agreed to the published version of the manuscript.
Funding
This research is supported by the National Natural Science Foundation of China [grant numbers 12271338, 12371023, 12426508].
Data Availability Statement
The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.
Acknowledgments
The authors would like to thank the editor and reviewers for their valuable suggestions, comments, and the Natural Science Foundation of China under Grant Nos. 12271338, 12371023, 12426508.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Hamilton, W.R. Theory of quaternions. Proc. R. Ir. Acad. 1844, 3, 1–16. [Google Scholar]
- Pletinckx, D. Quaternion calculus as a basic tool in computer graphics. Vis. Comput. 1989, 5, 2–13. [Google Scholar] [CrossRef]
- Diao, Q.K.; Xu, D.P.; Sun, S.N.; Mandic, D.P. Optimizing beamforming in quaternion signal processing using projected gradient descent algorithm. Signal Process. 2025, 227, 109738. [Google Scholar] [CrossRef]
- Jablonski, B. Quaternion Dynamic Time Warping. IEEE Trans. Signal Process. 2012, 60, 1174–1183. [Google Scholar] [CrossRef]
- Zou, C.M.; Kou, K.I.; Dong, L.; Zheng, X.W.; Tang, Y.Y. From Grayscale to Color: Quaternion Linear Regression for Color Face Recognition. IEEE Access 2019, 7, 154131–154140. [Google Scholar] [CrossRef]
- He, Z.H.; Qin, W.L.; Tian, J.; Wang, X.X.; Zhang, Y. A new Sylvester-type quaternion matrix equation model for color image data transmission. Comput. Appl. Math. 2024, 43, 227. [Google Scholar] [CrossRef]
- Zou, C.M.; Kou, K.I.; Wang, Y.L. Quaternion Collaborative and Sparse Representation with Application to Color Face Recognition. IEEE Trans. Image Process. 2016, 25, 3287–3302. [Google Scholar] [CrossRef]
- Vo, T.; Tran, D.; Ma, W.L. Tensor decomposition and application in image classification with histogram of oriented gradients. Neurocomputing 2015, 165, 38–45. [Google Scholar] [CrossRef]
- Shashua, A.; Hazan, T. Non-negative tensor factorization with applications to statistics and computer vision. In Proceedings of the 22nd International Conference on Machine Learning, Bonn, Germany, 7–11 August 2005; pp. 792–799. [Google Scholar]
- Zhou, H.; Li, L.X.; Zhu, H.T. Tensor Regression with Applications in Neuroimaging Data Analysis. J. Am. Stat. Assoc. 2013, 108, 540–552. [Google Scholar] [CrossRef]
- De Lathauwer, L.; De Moor, B.; Vandewalle, J. A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 2000, 21, 1253–1278. [Google Scholar] [CrossRef]
- Kolda, T.G.; Bader, B.W. Tensor decompositions and applications. SIAM Rev. 2009, 51, 455–500. [Google Scholar] [CrossRef]
- Zeng, C.; Ng, M.K. Decompositions of third-order tensors: HOSVD, T-SVD, and Beyond. Numer. Linear Algebra Appl. 2020, 27, e2290. [Google Scholar] [CrossRef]
- Song, G.; Ng, M.K.; Zhang, X. Robust tensor completion using transformed tensor singular value decomposition. Numer. Linear Algebra Appl. 2020, 27, e2299. [Google Scholar] [CrossRef]
- Jin, H.; Bai, M.; Benítez, J.; Liu, X. The generalized inverses of tensors and an application to linear models. Comput. Math. Appl. 2017, 74, 385–397. [Google Scholar] [CrossRef]
- He, Z.H.; Ng, M.K.; Zeng, C. Generalized singular value decompositions for tensors and their applications. Numer. Math. Theory Methods Appl. 2021, 14, 692–713. [Google Scholar]
- Gaidhane, V.H.; Hote, Y.V.; Singh, V. An efficient approach for face recognition based on common eigenvalues. Pattern Recognit. 2014, 47, 1869–1879. [Google Scholar] [CrossRef]
- Abadpour, A.; Kasaei, S. Color PCA eigenimages and their application to compression and watermarking. Image Vis. Comput. 2008, 26, 878–890. [Google Scholar] [CrossRef]
- Xu, M.X.; Wei, C.L. Remotely Sensed Image Classification by Complex Network Eigenvalue and Connected Degree. Comput. Math. Methods Med. 2008, 2012, 143–156. [Google Scholar] [CrossRef]
- Qi, L. Eigenvalues and invariants of tensors. J. Math. Anal. Appl. 2007, 325, 1363–1377. [Google Scholar] [CrossRef]
- Li, S.G.; Chen, Z.; Li, C.Q.; Zhao, J.X. Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices. Comput. Appl. Math. 2020, 39, 217. [Google Scholar] [CrossRef]
- Einstein, A. The foundation of the general theory of relativity. In The Collected Papers of Albert Einstein 6; Kox, A.J., Klein, M.J., Schulmann, R., Eds.; Princeton University Press: Princeton, NJ, USA, 2007; pp. 146–200. [Google Scholar]
- Kilmer, M.E.; Braman, K.; Hao, N.; Hoover, R.C. Third-order tensors as operators on matrices: A theoretical and computational framework with applications in imaging. SIAM J. Matrix Anal. Appl. 2013, 34, 148–172. [Google Scholar] [CrossRef]
- He, Z.H.; Wang, X.X.; Zhao, Y.F. Eigenvalues of Quaternion Tensors with Applications to Color Video Processing. J. Sci. Comput. 2023, 94, 1. [Google Scholar] [CrossRef]
- He, Z.H.; Liu, T.T.; Wang, X.X. Eigenvalues of Quaternion Tensors: Properties, Algorithms and Applications. Adv. Appl. Clifford Algebr. 2024, 35, 4. [Google Scholar] [CrossRef]
- Liu, W.H.; Jin, X.Q. A study on T-eigenvalues of third-order tensors. Linear Algebra Appl. 2021, 612, 357–374. [Google Scholar] [CrossRef]
- Mo, C.X.; Ding, W.Y.; Wei, Y.M. Perturbation Analysis on T-Eigenvalues of Third-Order Tensors. J. Optimiz. Theory App. 2024, 202, 668–702. [Google Scholar] [CrossRef]
- Zhang, F.Z. Geršgorin type theorems for quaternionic matrices. Linear Algebra Appl. 2007, 424, 139–153. [Google Scholar] [CrossRef]
- Golub, G.H.; VanLoan, C.F. Matrix Computations, 4th ed.; Johns Hopkins University Press: Baltimore, MD, USA, 2014; pp. 357–358. [Google Scholar]
- Davis, C.; Kahan, W.M. The Rotation of Eigenvectors by a Perturbation. III. SIAM J. Numer. Anal. 1970, 7, 1–46. [Google Scholar] [CrossRef]
- Rodman, L. Topics in Quaternion Linear Algebra; Princeton University Press: Princeton, NJ, USA, 2014. [Google Scholar]
- Kilmer, M.E.; Martin, C.D. Factorization strategies for third-order tensors. Linear Algebra Appl. 2011, 435, 641–658. [Google Scholar] [CrossRef]
- Pan, J.J.; Ng, M.K. Block-Diagonalization of Quaternion Circulant Matrices with Applications. SIAM J. Matrix Anal. Appl. 2024, 45, 1429–1454. [Google Scholar] [CrossRef]
- Lund, K. The tensor t-function: A definition for functions of third-order tensors. Numer. Linear Algebr. 2020, 27, 1–17. [Google Scholar] [CrossRef]
- Zhang, F.Z. Matrix Theory: Basic Results and Techniques, 2nd ed.; Springer: New York, NY, USA, 2011; pp. 117–119. [Google Scholar]
- Wu, F.S.; Li, C.Q.; Li, Y.T.; Tang, N.S. Complex Representation Matrix of Third-Order Quaternion Tensors with Application to Video Inpainting. J. Optim. Theory Appl. 2025, 205, 27. [Google Scholar] [CrossRef]
- Sangwine, S.; Bihan, N.L. Quaternion Toolbox for Matlab. Available online: http://qtfm.sourceforge.net (accessed on 20 April 2025).
- Jiang, T.S. An algorithm for eigenvalues and eigenvectors of quaternion matrices in quaternionic quantum mechanics. J. Math. Phys. 2004, 45, 3334–3338. [Google Scholar] [CrossRef]
- Horn, R.A. Matrix Analysis, 2nd ed.; Cambridge University Press: Cambridge, UK, 2013; pp. 239–256. [Google Scholar]
- Miao, J.F.; Kou, K.I. Quaternion tensor singular value decomposition using a flexible transform-based approach. Signal Process. 2023, 206, 108910. [Google Scholar] [CrossRef]
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. |
© 2025 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/).