In this paper, by {\it selecting inverse image index method}, an efficient characterization formula from set ${\mathbb{A}}_{1}=\{\alpha:\alpha=(I_s,\eta^{\rm T})^{\rm T}\in \Bbb C^{n\times s}_s\}$ onto set ${\mathbb{B}}_1=\{\beta:\beta=\alpha(\alpha^*\alpha)^{-1}\alpha^*, \alpha\in{\mathbb{A}}_1\}$ is given. Besides, it is shown that each element of $I\{2,3\}_s$ is permutation similar to an element of ${\mathbb{B}}_1$. Then efficient characterization formulas for $I\{2,3\}$ and $M\{2,3\}$ are obtained respectively. An interesting thing is ${\mathbb{B}}_1$ is a dense subset of $I\{2,3\}_s$. The fact that $I\{2,3\}_s=I\{2,4\}_s=I\{2,3,4\}_s$ enables us to obtain the efficient characterization formulas for $M\{2,4\}$ and $M\{2,3,4\}$ fluently. Algorithm 3.1 may be used to compute elements of $I\{2,3\}_s$ and to avoid the repeated computation work.
ZHENG Dao-Sheng
. Effcient characterization for M{2,3},M{2,4} and M{2,3,4}and Mf2;3;4g [J]. Journal of East China Normal University(Natural Science), 2016
, 2016(2)
: 9
-19
.
DOI: 2016.02.002
[1]BEN-ISRAEL A, GREVILLE T N E. Generalized Inverse: Theory andApplications (2nd Edition) [M]. New York: Springer-Verlag, 2003.
[2]BUSINGER P A, GOLUB G H. Algorithm 358, singular value decompositionof a complex matrix [F1,4,5] [J]. Comm Assoc Comp Mach, 1969,12(10): 564-565.
[3]GOLUB G H, VAN LOAN C F. Matrix Computations (3rd Edition) [M].Baltimore: Johns Hopkins University Press, 1996.
[4]GOLUB G H, KAHAN W. Calculating the singular value andpseudo-inverse of a matrix [J]. SIAM J Num Anal Ser, 1965, 2(2):205-224.
[5]HORN R A, JOHNSON C R. Matrix Analysis [M]. Cambridge:Cambridge University Press, 1990.
[6]ZHENG D S. Efficient characterization for $I\{2\]$ and $M\{2\] [J].J East China Normal University, 2015, 179(1): 42-50.