Abstract
In this paper, we investigate the minimum-norm least squares solution to a quaternion tensor system by using the Moore–Penrose inverses of block tensors. As an application, we discuss the quaternion tensor system for minimum-norm least squares reducible solutions. To illustrate the results, we present an algorithm and a numerical example.
Keywords:
quaternion tensor equation; least squares (reducible) solution; minimum norm; Moore–Penrose inverse MSC:
15A69; 15A24
1. Introduction
Previous research on the classic systems of matrix equations may go back to Cecioni [1] on
During the past few decades, a great deal of research has been done on various generalized systems of (1) over complex number field and quaternions (see, for example, [2,3]). As a natural extension of a matrix, an N-mode tensor is a multidimensional array. In this paper, we consider solutions to some quaternion tensor systems.
Recall that a quaternion, introduced by Hamilton [4], is an associative and non-commutative division algebra over a real number field and is generally represented in the form:
We refer the reader to [5,6,7,8] for quaternions and some applications. Nowadays, quaternion tensors are often used to solve problems in quantum mechanics, control theory, linear modeling, etc. [9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25].
It is well known that there are several definitions of tensor products. In this paper, we focus on the so-called “Einstein product”. Given two tensors , their Einstein product [26] is defined as
For simplicity, we will denote the above summation by . When , A and B are quaternion matrices, and their Einstein product is the usual matrix product.
Solving quaternion tensor systems has recently been explored. For example, He [27] gave the necessary and sufficient condition for their existence and the expression for the general solution to a quaternion tensor system
where are given. Since reducible matrices can be applied in many areas such as stochastic processes, random walks in graphs, and the connection of directed graphs [28,29,30], researchers have already started to investigate the reducible solutions of systems of matrix equations and tensor equations. For example, Nie et al. [2] presented the necessary and sufficient condition for a system of matrix equations to have a reducible solution and gave the representation of such a solution if it is possible. Xie and Wang [31] investigated the solvable condition and the expression of the reducible solution to the classical quaternion tensor equation
where , are given. In addition, they also derived the solvable condition and the expression of the general solution to the quaternion tensor equation
where and are given tensors with appropriate dimensions.
Motivated by above results and the applications of tensor equations, in this paper, we consider the minimum-norm least squares solution to the system of quaternion tensor equations:
where , and , are given, and the minimum-norm least squares reducible solution to the system of quaternion tensor equations:
As special cases, we also give the the minimum-norm least squares reducible solution to Equation (3) and the minimum-norm least squares solution to Equation (4).
This paper is organized as follows. In Section 2, we introduce some notation and review some results that will be used throughout the paper. In Section 3, we discuss the forms of the M–P inverses of block tensors. In Section 4, we present the minimum-norm least square solutions to systems (4) and (5). The least squares reducible solutions to systems (3) and (6) are also obtained. Finally, we develop an algorithm and calculate a numerical example to show the accuracy of our results in Section 5.
2. Preliminaries
We first recall some definitions and fix some notation. It is well known that the transpose of a tensor can be defined in many ways, according to the different partitions of its indices. To avoid potential confusion, we use different index letters to indicate the transpose of a tensor. That is, given a tensor the conjugate transpose of is defined as hereafter, where . In particular, when is a real tensor, is called the transpose of and is simply denoted by . Throughout this paper, we use the Einstein product for the tensor product and for the identity tensor with appropriate dimension. Thus, the inverse of a tensor is a tensor satisfying . Finally, the Frobenius norm of a tensor is defined as .
The Moore–Penrose inverses of tensors via the Einstein product have been discussed over the complex number field and quaternions (see, for example, [22,31,32]).
Definition 1.
Let A tensor satisfying
- (i)
- ;
- (ii)
- ;
- (iii)
- ;
- (iv)
is called a Moore–Penrose inverse of , abbreviated as the M–P inverse, denoted by .
It has been shown that the M–P inverse of a tensor exists and is unique. Two projectors about the M–P inverse are defined as: and . The following properties of quaternion tensors will be used in the following sections.
Proposition 1
(Xie and Wang [31]). Let . Then,
- (1)
- ;
- (2)
- ;
- (3)
- (4)
- and ;
- (5)
- and .
For the same reason as block matrices in matrix theory, the block techniques for tensors play important roles in tensor theory. Next, we extend the concept of row block tensors given in [22] to the quaternion case.
Definition 2.
Let . The row block tensor consisted of and is defined as
where and ,
where .
The following properties of block tensors are presented in [22] for complex tensors. It is easy to check that they also hold for quaternion tensors.
Proposition 2.
The following equalities hold:
- (1)
- ;
- (2)
- is belong to , where , and .
Using above notations for block tensors and properties, we can give the complex and real representations of a quaternion tensor as follows.
Let with . The complex vector representation of is , and its complex representation is . Furthermore, let the real part and the imaginary part of a complex tensor be denoted by and , respectively. Then, can be expressed as , and the real vector representation of is .
Different papers might use different orderings of the columns for a tensor unfolding. In this paper, we will use the transformation presented in Brazell et al. [9] and He et al. [32], which transforms a quaternion tensor into a quaternion matrix.
Definition 3.
The unfolding transformation
is defined by
Using above transformation θ, we give the definition of a permutation tensor which is similar to [31] (Definition 4).
Definition 4.
A tensor is called a θ-permutation tensor (simply called a “permutation tensor" hereafter if no confusion arises) if the unfolding of is a permutation matrix.
As [32] shows, θ is a one-to-one correspondence and preserves the Einstein tensor products, that is, . Therefore, a permutation tensor is invertible, since is invertible.
Definition 5.
A tensor is said to be -reducible if there exists a permutation tensor such that is permutationally similar to a triangular (upper or lower) block tensor, that is,
where , and .
3. The M–P Inverses of Block Tensors
The solutions of tensor equations in the next section will be given in terms of block tensors. In this section, we will discuss the M–P inverses of block tensors. First, we recall the following lemma regrading the vec operator acting on a complex representation Φ in [33].
Lemma 1.
Let , . Set
where
Then, we have
where , and .
We have obtained the following lemma about the M–P inverse of a column block tensor in [33] and will use it to prove Proposition 3.
Lemma 2.
Let Then,
where
In the following proposition, we give the general form of the M–P inverse of a tensor with three sub-blocks. We will apply it to describe the solutions in next section. One technique in this proof is using the quaternion SVD ([32]). For a tensor , the singular value decomposition (SVD) of has the following form:
where is diagonal and and are unitary tensors such that and .
Proposition 3.
Given , and , let . Then, the M–P inverse of row block tensor can be expressed as
where
Proof of Proposition 3.
Let be the right-hand side of (7). We only need to show that satisfies the conditions in Definition 1.
We start by proving the existence of and in (8). Let and . Then, we have the SVD of , where are unitary tensors and is diagonal. We write . Since the diagonal tensor has nonzero diagonal entries, we know that exists. Similarly, exists. Next, we prove that satisfies the four conditions in Definition 1.
We first prove that . It is easy to verify that , and so . For any tensor , by Proposition 1, we have
and it follows that
Therefore, by Proposition 2, we have
Since and are symmetric, we have .
Next we prove that . For any tensor , it is obvious that is idempotent. Then, we have
Based on this, we can derive that is idempotent and . Thus,
To prove that , we set . It is easy to verify that
It follows from Proposition 2 that
Finally, we prove that . By Proposition 2, we know that can be written as
Next, we need to prove that are symmetric. Set
Here, . Then,
and
Because is idempotent, using (9) and (10), we obtain
Similarly, we have
Using and (11),
Similarly to the above,
Thus, is proved.
Now we have proved that satisfies all four conditions in Definition 1. Therefore, is the M–P inverse of . □
4. The Minimum-Norm Least Squares Solutions
In the first part of this section, we consider the minimum-norm least squares solution of tensor system (5). The minimum-norm least squares solution of tensor Equation (4) will be given as a special case. For the coefficient tensors in system (5), we fix some notation as follows:
Moreover, we set
From Lemma 2, let
In general, tensor system (5) may have many solutions or no solution at all. Thus, it is useful to find the minimum-norm least squares solution of (5) such that
where
Theorem 1.
With the above notation, the minimum-norm least squares solution of (5) is determined by
where is an arbitrary real tensor with appropriate dimension.
Proof of Theorem 1.
The following calculations are based on Lemmas 1 and 2, and Proposition 3.
Using the results of the real tensor equation in [22], we have
where is an arbitrary real tensor over . A simple calculation gives
□
Using Lemma 2, we have the following solvability condition.
Corollary 1.
The quaternion tensor system (5) is solvable if and only if
where
In this case, the solution satisfies
where is an arbitrary real tensor with appropriate dimension.
Furthermore, the uniqueness of the solution of (5) can be obtained as follows.
Corollary 2.
The tensor system (5) has a unique solution , which satisfies
Proof of Corollary 2.
The solution set is a nonempty and closed convex set. Thus, it must have a unique solution . It follows that
Hence, when , is the minimum-norm least squares solution of system (5), which satisfies
□
As a special case, we give the solution of tensor Equation (4). For the coefficient tensors in (4), let
and set
Theorem 2.
With the above notation, the minimum-norm least squares solution of tensor Equation (4) is determined by
where is an arbitrary real tensor with appropriate dimension.
The minimum-norm least squares solution satisfies
As applications of the minimum-norm least squares solutions of (5) and (4), in the second part of this section we consider the minimum-norm least squares reducible solutions of system (6) and Equation (3). We write the reducible solution in the following form:
where is a permutation tensor and , , , . Next, for the coefficient tensors in (6), we denote their products in the following block tensors:
Theorem 3.
With above notation for coefficient tensors , , , , in (6), , , in (13) and permutation tensor , we have
where is an arbitrary real tensor with appropriate dimension. The tensor system (6) has the minimum-norm least squares reducible solution , which satisfies
In particular, we can obtain the minimum-norm least squares reducible solution of tensor Equation (3). Let
5. Algorithm and Numerical Example
Based on the methods discussed in Section 4, we develop the following Algorithm 1 to solve tensor system (6). We also present a numerical example to show the accuracy of our method.
| Algorithm 1: Finding the minimum-norm least squares reducible solution of system (6) |
We implemented the above algorithm in MATLAB. The codes are available upon request. The following example shows that our algorithm works well.
6. Conclusions
We obtained the minimum-norm least squares solution for system (5) by using the Moore–Penrose inverses of block tensors. In terms of applications, we derived the the minimum-norm least squares reducible solution for system (6). In addition, we used an algorithm and a numerical example to verify the main results of this paper. It is worth noting that the main results of (5) and (6) can be used for solving other quaternion tensor systems.
Author Contributions
All authors contributed equally to the conceptualization, formal analysis, investigation, methodology, software, validation, writing of the original draft, writing of the review, and editing. All authors have read and agreed to the published version of the manuscript.
Funding
This research was supported by the National Natural Science Foundation of China (11971294) and the China Scholarship Council (#202006890063).
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
- Cecioni, F. Sopra alcune operazioni algebriche sulle matrici. Ann. Scuola Norm. Sup. Pisa Sci. Fis. Mat. 1910, 11, 1–141. [Google Scholar]
- Nie, X.; Wang, Q.W.; Zhang, Y. A system of matrix equations over the quaternion algebra with applications. Algebra Colloq. 2017, 24, 233–253. [Google Scholar] [CrossRef]
- Yuan, Y.X.; Mahmoud, S.M. Least-squares solutions to the matrix equations AX = B and XC = D. Appl. Math. Comput. 2010, 216, 3120–3125. [Google Scholar]
- Hamilton, W.R. Elements of Quaternions; Longmans, Green, & Company: London, UK, 1866. [Google Scholar]
- Le Bihan, N.; Mars, J. Singular value decomposition of quaternion matrices: A new tool for vector-sensor signal processing. Signal Process. 2004, 84, 1177–1199. [Google Scholar] [CrossRef]
- Pei, S.C.; Chang, J.H.; Ding, J.J. Quaternion matrix singular value decomposition and its applications for color image processing. In Proceedings of the 2003 International Conference on Image Processing (Cat. No. 03CH37429), Barcelona, Spain, 14–17 September 2003; Volume 1, p. I-805. [Google Scholar]
- Took, C.C.; Mandic, D.P. Quaternion-valued stochastic gradient-based adaptive IIR filtering. IEEE Trans. Signal Process. 2010, 58, 3895–3901. [Google Scholar]
- Took, C.C.; Mandic, D.P. Augmented second-order statistics of quaternion random signals. Signal Process. 2011, 91, 214–224. [Google Scholar] [CrossRef]
- Brazell, M.; Li, N.; Navasca, C.; Tamon, C. Solving multilinear systems via tensor inversion. SIAM J. Matrix Anal. Appl. 2013, 54, 542–570. [Google Scholar]
- Chen, Z.; Lu, L. A projection method and Kronecker product preconditioner for solving Sylvester tensor equations. Sci. China Math. 2012, 55, 1281–1292. [Google Scholar]
- Guan, Y.; Chu, D. Numerical computation for orthogonal low-rank approximation of tensors. SIAM J. Matrix Anal. Appl. 2019, 40, 1047–1065. [Google Scholar]
- Guan, Y.; Chu, M.T.; Chu, D. SVD-based algorithms for the best rank-1 approximation of a symmetric tensor. SIAM J. Matrix Anal. 2018, 39, 1095–1115. [Google Scholar]
- Guan, Y.; Chu, M.T.; Chu, D. Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation. Linear Algebra Appl. 2018, 555, 53–69. [Google Scholar]
- Li, T.; Wang, Q.W.; Zhang, X.F. A Modified conjugate residual method and nearest kronecker product preconditioner for the generalized coupled Sylvester tensor equations. Mathematics 2022, 10, 1730. [Google Scholar] [CrossRef]
- Liu, L.S.; Wang, Q.W.; Chen, J.F.; Xie, Y.Z. An exact solution to a quaternion matrix equation with an application. Symmetry 2022, 14, 375. [Google Scholar] [CrossRef]
- Liu, L.S.; Wang, Q.W.; Mahmoud Saad, M. A Sylvester-type matrix equation over the hamilton quaternions with an application. Mathematics 2022, 10, 1758. [Google Scholar] [CrossRef]
- Mahmoud Saad, M.; Wang, Q.W. Three symmetrical systems of coupled Sylvester-like quaternion matrix equations. Symmetry 2022, 14, 550. [Google Scholar] [CrossRef]
- Qi, L. Eigenvalues of a real supersymmetric tensor. J. Symb. Comput. 2005, 40, 1302–1324. [Google Scholar] [CrossRef]
- Qi, L. Symmetric nonnegative tensors and copositive tensors. Linear Algebra Appl. 2013, 439, 228–238. [Google Scholar] [CrossRef]
- Qi, L.; Chen, H.; Chen, Y. Tensor Eigenvalues and Their Applications; Springer: Singapore, 2018. [Google Scholar]
- Qi, L.; Luo, Z. Tensor Analysis: Spectral Theory and Special Tensors; SIAM: Philadelphia, PA, USA, 2017. [Google Scholar]
- Sun, L.; Zheng, B.; Bu, C.; Wei, Y. Moore-Penrose inverse of tensors via Einstein product. Automatica 2016, 64, 686–698. [Google Scholar]
- Wang, R.N.; Wang, Q.W.; Liu, L.S. Solving a system of sylvester-like quaternion matrix equations. Symmetry 2022, 14, 1056. [Google Scholar] [CrossRef]
- Wei, M.; Li, Y.; Zhang, F.; Zhao, J. Quaternion Matrix Computations; Nova Science Publishers, Inc.: Hauppauge, NY, USA, 2018. [Google Scholar]
- Xu, Y.F.; Wang, Q.W.; Liu, L.S.; Mahmoud Saad, M. A constrained system of matrix equations. Comput. Appl. Math. 2022, 41, 1–24. [Google Scholar]
- Einstein, A. The formal foundation of the general theory of relativity. Sitzungsber. Preuss. Akad. Wiss. Berlin (Math. Phys.) 1914, 1914, 1030–1085. [Google Scholar]
- He, Z.H. The general solution to a system of coupled Sylvester-type quaternion tensor equations involving η-Hermicity. Bull. Iran. Math. Soc. 2019, 45, 1407–1430. [Google Scholar] [CrossRef]
- Kirkland, S.; Neumann, M.; Xu, J. Transition matrices for well-conditioned Markov chains. Linear Algebra Appl. 2007, 424, 118–131. [Google Scholar] [CrossRef][Green Version]
- Rivin, I. Walks on groups, counting reducible matrices, polynomials, and surface and free group automorphisms. Duke Math. J. 2008, 142, 353–379. [Google Scholar] [CrossRef][Green Version]
- Wu, C.W. On bounds of extremal eigenvalues of irreducible and m-reducible matrices. Linear Algebra Appl. 2005, 402, 29–45. [Google Scholar] [CrossRef][Green Version]
- Xie, M.; Wang, Q.W. The reducible solution to a quaternion tensor equation. Front. Math. China 2020, 15, 1047–1070. [Google Scholar] [CrossRef]
- He, Z.H.; Navasca, C.; Wang, Q.W. Tensor decompositions and tensor equations over quaternion algebra. arXiv 2017, arXiv:1710.07552. [Google Scholar]
- Wang, Q.W.; Lv, R.; Zhang, Y. The least-squares solution with the least norm to a system of tensor equations over the quaternion algebra. Linear Multilinear Algebra 2022, 70, 1942–1962. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 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/).