Throughout this paper, let $R^{n\times m}$ be the set of all n £ m real matrices, $SR^{n\times m}$ be the set of all ${n\times m}$ real symmetric matrices, $OR^{n\times n}$ be the set of all ${n\times n}$ orthogonal matrices.Denote by In the identity matrix with order n. For matrix $A,{\rm{ }}{A^T},{\rm{ }}{A^ + },{\rm{ }}\left\| A \right\|$ and r(A)represent its transpose, Moore-Penrose inverse, Frobenius norm and rank, respectively. For a matrix A, the two matrices LA and RA stand for the two orthogonal projectors ${L_A}{\rm{ }} = {\rm{ }}I - {A^ + }A,{R_A}{\rm{ }} = {\rm{ }}I{\rm{ }} - {\rm{ }}A{A^ + }$ induced by A.
Definition 1 A real symmetric matrix $A=(a_{ij})\in R^{n\times n}$ is said to be a Bisymmetric matrix if $a_{ij}=a_{n+1-j,n+1-i}, i,j=1,2,\cdots,n$. The set of all $n\times n$ Bisymmetric matrices is denoted by $BSR^{n\times n}$.
In this paper, we consider the Bisymmetric extremal rank solutions of the matrix equation
where X and B are given matrices in $R^{n\times m}$. In 1972, Mitra [1] considered solutions with fixed ranks for the matrix equations $AX=B$ and $AXB=C$. In 1984, Mitra [2] gave common solutions of minimal rank of the pair of complex matrix equations $AX=C, XB=D$. In 1987, Uhlig [3] presented the extremal ranks of solutions to the matrix equation $AX=B$. In 1990, Mitra studied the minimal ranks of common solutions to the pair of matrix equations $A_{1}X_{1}B_{1}=C_{1}$ and $A_{2}X_{2}B_{2}=C_{2}$ over a general field in [4]. In 2003, Tian (see [5, 6]) investigated the extremal rank solutions to the complex matrix equation $AXB=C$ and gave some applications. Xiao et al. [7, 8] considered the symmetric and anti-symmetric minimal rank solution to equation $AX=B$. The Bisymmetric maximal and minimal rank solutions of the matrix equation (1.1), however, has not been considered yet. In this paper, we will discuss this problem.
We also consider the matrix nearness problem
where $\tilde{A}$ is a given matrix in $R^{n\times m}$ and $S_{m}$ is the minimal rank solution set of eq. (1.1).
Denote by $e_{i}$ be the $i$th column of $I_{n}$ and set $S_{n}=(e_{n},e_{n-1},\cdots,e_{1})$. It is easy to see that
Let $k=[\frac{n}{2}]$, where $[\frac{n}{2}]$ is the maximum integer which is not greater than $\frac{n}{2}$. Define $D_{n}$ as
then it is easy verified that the above matrices $D_{n}$ are orthogonal matrices.
Lemma 1 [9]Let $A\in R^{n\times n}$ and $D_{n}$ with the forms of $(2.1)$, then $A$ is the Bisymmetric matrix if and only if there exist $A_{2}\in SR^{(n-k)\times (n-k)}$ and $A_{3}\in SR^{k\times k}$, whether n is odd or even, such that
Here, we always assume $k=[\frac{n}{2}]$.
Given matrix $X_{1}, B_{1}\in R^{n\times m}$, the singular value decomposition of $X_{1}$ be
where $U_{1}=[U_{11},U_{12}]\in OR^{n\times n}$, $U_{11}\in R^{n\times r_{1}}$, $V_{1}=[V_{11},V_{12}]\in OR^{m\times m}$, $V_{11}\in R^{m\times r_{1}}$, $r_{1}=r(X_{1})$, $\Sigma_{1}={\rm diag}(\sigma_{1},\cdots,\sigma_{r_{1}})$, $\sigma_{1}\geq\cdots\geq\sigma_{r_{1}}>0$.
Let $A_{11}=U_{11}^{T}B_{1}V_{11}\Sigma_{1}^{-1}$, $A_{12}=U_{12}^{T}B_{1}V_{11}\Sigma_{1}^{-1}$, $G_{1}=A_{12}L_{A_{11}}$, the singular value decomposition of $G_{1}$ be
where $P_{1}=[P_{11},P_{12}]\in OR^{(n-r_{1})\times (n-r_{1})}$, $P_{11}\in R^{(n-r_{1})\times s_{1}}$, $Q_{1}=[Q_{11},Q_{12}]\in OR^{r_{1}\times r_{1}}$, $Q_{11}\in R^{r_{1}\times s_{1}}$, $s_{1}=r(G_{1})$, $\Gamma_{1}={\rm diag}(\gamma_{1},\cdots,\gamma_{s_{1}})$, $\gamma_{1}\geq\cdots\geq\gamma_{s_{1}}>0$.
Lemma 2 [7]Given matrices $X_{1},B_{1}\in R^{n\times m}$. Let the singular value decompositions of $X_{1}$ and $G_{1}$ be $(2.3)$, $(2.4)$, respectively. Then the matrix equation $A_{1}X_{1}=B_{1}$ has a symmetric solution $A_{1}$ if and only if
In this case, let $\Omega_{1}$ be the set of all symmetric solutions of equation $A_{1}X_{1}=B_{1}$, then the extreme ranks of $A_{1}$ are as follows:
$(1)$ The maximal rank of $A_{1}$ is
The general expression of $A_{1}$ satisfying $(2.6)$ is
where $A_{0}=B_{1}X^{+}_{1}+(B_{1}X^{+}_{1})^{+}R_{X_{1}}+R_{X_{1}}B_{1}X^{+}_{1}(X_{1}X^{+}_{1}B_{1}X^{+}_{1})^{+}(B_{1}X^{+}_{1})^{T}R_{X_{1}}$ and $N_{1}\in SR^{(n-r_{1})\times (n-r_{1})}$ is chosen such that $r(R_{G_{1}}N_{1}R_{G_{1}})=n+r(X^{T}_{1}B_{1})-r(B_{1})-r(X_{1})$.
$(2)$ The minimal rank of $A_{1}$ is
The general expression of $A_{1}$ satisfying $(2.8)$ is
where $A_{0}=B_{1}X^{+}_{1}+(B_{1}X^{+}_{1})^{+}R_{X_{1}}+R_{X_{1}}B_{1}X^{+}_{1}(X_{1}X^{+}_{1}B_{1}X^{+}_{1})^{+}(B_{1}X^{+}_{1})^{T}R_{X_{1}}$ and $M_{1}\in SR^{(n-r_{1})\times (n-r_{1})}$ is arbitrary.
Assume Dn with the form of (2.1). Let
where ${X_2} \in {R^{(n - k) \times m}},{X_3} \in {R^{k \times m}},{B_2} \in {R^{(n - k) \times m}},{B_3} \in {R^{k \times m}}$, and the singular value decomposition of matrices X2, X3 are, respectively,
where ${U_2} = \left[ {{U_{21}},{U_{22}}} \right] \in O{R^{(n - k) \times (n - k)}},{U_{21}} \in {R^{(n - k) \times r2}},{V_2} = \left[ {{V_{21}},{V_{22}}} \right] \in O{R^{m \times m}},{V_{21}} \in O{R^{m \times r2}},r2 = r({X_2}),$${\sum {} _3} = {\rm{diag}}({\alpha _1}, \cdots ,{\alpha _{r2}}),{\alpha _1} \ge \cdots \ge {\alpha _{r2}} > 0,$.
where ${U_3} = \left[ {{U_{31}},{U_{32}}} \right] \in O{R^{k \times k}},{U_{31}} \in {R^{(k \times r3}},{V_3} = \left[ {{V_{31}},{V_{32}}} \right] \in O{R^{m \times m}},$${V_{31}} \in O{R^{m \times r3}},r3 = r({X_3}),{\sum {} _3} = diang({\alpha _1}, \cdots ,{\alpha _{r2}}),{\alpha _1} \ge \cdots \ge {\alpha _{r2}} > 0,$.
Let $A_{21}=U_{21}^{T}B_{2}V_{21}\Sigma_{2}^{-1}$, $A_{22}=U_{22}^{T}B_{2}V_{21}\Sigma_{2}^{-1}$, $G_{2}=A_{22}L_{A_{21}}$, $A_{31}=U_{31}^{T}B_{3}V_{31}\Sigma_{3}^{-1}$, $A_{32}=U_{32}^{T}B_{3}V_{31}\Sigma_{3}^{-1}$, $G_{3}=A_{32}L_{A_{31}}$, the singular value decomposition of matrices $G_{2}$, $G_{3}$ are, respectively,
where $P_{2}=[P_{21},P_{22}]\in OR^{(n-k-r_{2})\times (n-k-r_{2})}$, $P_{21}\in R^{(n-k-r_{2})\times s_{2}}$, $Q_{2}=[Q_{21},Q_{22}]\in OR^{r_{2}\times r_{2}}$, $Q_{21}\in R^{r_{2}\times s_{2}}$, $s_{2}=r(G_{2})$, $\Gamma_{2}={\rm diag}(\zeta_{1},\cdots,\zeta_{s_{2}})$, $\zeta_{1}\geq\cdots\geq\zeta_{s_{2}}>0$.
where $P_{3}=[P_{31},P_{32}]\in OR^{(k-r_{3})\times (k-r_{3})}$, $P_{31}\in R^{(k-r_{3})\times s_{3}}$, $Q_{3}=[Q_{31},Q_{32}]\in OR^{r_{3}\times r_{3}}$, $Q_{31}\in R^{r_{3}\times s_{3}}$, $s_{3}=r(G_{3})$, $\Gamma_{3}={\rm diag}(\xi_{1},\cdots,\xi_{s_{3}})$, $\xi_{1}\geq\cdots\geq\xi_{s_{3}}>0$.
Now we can establish the existence theorems as follows.
Theorem 1 Let $X,B\in R^{n\times m}$ be known. Suppose $D_{n}$ with the form of $(2.1)$, $D^{T}_{n}X$, $D^{T}_{n}B$ have the partition forms of $(3.1)$, and the singular value decompositions of the matrices $X_{2}$, $X_{3}$ and $G_{2}$, $G_{3}$ are given by $(3.2)$, $(3.3)$ and $(3.4)$, $(3.5)$, respectively. Then the equation $(1.1)$ has a Bisymmetric solution $A$ if and only if
In this case, let $\Omega$ be the set of all Bisymmetric solutions of equation $(1.1)$, then the extreme ranks of $A$ are as follows:
$(1)$ The maximal rank of $A$ is
The general expression of $A$ satisfying $(3.7)$ is
where $A_{i}=B_{i}X^{+}_{i}+(B_{i}X^{+}_{i})^{+}R_{X_{i}}+R_{X_{i}}B_{i}X^{+}_{i}(X_{i}X^{+}_{i}B_{i}X^{+}_{i})^{+}(B_{i}X^{+}_{i})^{T}R_{X_{i}}, \ \ i=2,3$, and $N_{2}\in SR^{(n-k-r_{2})\times (n-k-r_{2})}$, $N_{3}\in SR^{(k-r_{3})\times (k-r_{3})}$ are chosen such that
$(2)$ The minimal rank of $A$ is
The general expression of $A$ satisfying $(3.9)$ is
where $A_{i}=B_{i}X^{+}_{i}+(B_{i}X^{+}_{i})^{+}R_{X_{i}}+R_{X_{i}}B_{i}X^{+}_{i}(X_{i}X^{+}_{i}B_{i}X^{+}_{i})^{+}(B_{i}X^{+}_{i})^{T}R_{X_{i}}, i=2,3$ and $M_{2}\in SR^{(n-k-r_{2})\times (n-k-r_{2})}$, $M_{3}\in SR^{(k-r_{3})\times (k-r_{3})}$ are arbitrary.
Proof Suppose the matrix equation (1.1) has a solution $A$ which is Bisymmetric, then it follows from Lemma 1 that there exist $A_{2} \in SR^{(n-k)\times (n-k)}$, $A_{3} \in SR^{k\times k}$ satisfying
By (3.1), that is
i.e.,
Therefore by Lemma 2, (3.6) hold, and in this case, let $\Omega$ be the set of all bisymmetric solutions of equation $(1.1)$, we have
(1) By (3.11),
By Lemma 2,
Taking (3.15) into (3.14) yields (3.7). According to the general expression of the solution in Lemma 2, it is easy to verify the rest of part in (1).
(2)The proof is very similar to that of (1) By (3.1) and Lemma 1, so we omit it.
From (3.10), when the solution set $S_{m}=\{A\mid AX=B, A\in BSR^{n\times n}, r(A)=\min\limits_{Y\in \Omega}r(Y)\}$ is nonempty, it is easy to verify that $S_{m}$ is a closed convex set, therefore there exists a unique solution $\hat{A}$ to the matrix nearness problem (1.2).
Theorem 2 Given matrix $\tilde{A}$, and the other given notations and conditions are the same as in Theorem 1. Let
and we denote
If $S_{m}$ is nonempty, then problem $(1.2)$ has a unique $\hat{A}$ which can be represented as
where $\tilde{B}_{22}$, $\tilde{C}_{22}$ are the same as in (4.2), (4.3).
Proof When $S_{m}$ is nonempty, it is easy to verify from (3.10) that $S_{m}$ is a closed convex set. Problem (1.2) has a unique solution $\hat{A}$ by [10]. By Theorem 1, for any $A\in S_{m}$, $A$ can be expressed as
where $A_{i}=B_{i}X^{+}_{i}+(B_{i}X^{+}_{i})^{+}R_{X_{i}}+R_{X_{i}}B_{i}X^{+}_{i}(X_{i}X^{+}_{i}B_{i}X^{+}_{i})^{+}(B_{i}X^{+}_{i})^{T}R_{X_{i}}, \ \ i=2,3$, and $M_{2}\in SR^{(n-k-r_{2})\times (n-k-r_{2})}$, $M_{3}\in SR^{(k-r_{3})\times (k-r_{3})}$ are arbitrary.
Using the invariance of the Frobenius norm under orthogonal transformations, and $P_{21}P_{21}^{T}+P_{22}P_{22}^{T}=I$, $P_{31}P_{31}^{T}+P_{32}P_{32}^{T}=I$, where $P_{21}P_{21}^{T}$, $P_{22}P_{22}^{T}$, $P_{31}P_{31}^{T}$, $P_{32}P_{32}^{T}$ are orthogonal projection matrices, and $P_{21}P_{21}^{T}P_{22}P_{22}^{T}=0$, $P_{31}P_{31}^{T}P_{32}P_{32}^{T}=0$, we have
Therefore, $\min\limits_{A\in S_{m}}\|\tilde{A}-A\|$ is equivalent to
Obviously, the solutions of (4.6), (4.7) can be written as
Substituting (4.8), (4.9) into (4.5), then we get that the unique solution to problem (1.2) can be expressed in (4.4). The proof is completed.