International Journal of Basic & Applied Sciences IJBAS-IJENS Vol:10 No:02 58

Operation properties of Adjoint Matrix of Hermitian

Block Matrices
Sohana Jahan , Imtiaz Ahmed

Chengmao Han [1] , in his paper, discussed operation

Abstract -- In this paper operation properties of adjoint
matrices of a kind of complex block matrices specially
properties of adjoint matrices of real block matrices.
Hemitian matrices has been discussed. In this paper, We have considered a special type of block
matrices whih is secondary diagonal block matrices. We
have established some operation properties involving
Index Term-- Adjoint Matrix, Block Matrix. Hermitian
Matrix. adjoint and transpose of adjoint of block Hermitian
secondary diagonal matrices.
I. INTRODUCTION

A Block matrix [4],[5],[6],[7] is a partition of II. SOME B ASIC PROPERTIES OF ADJOINT MATRICES
a matrix into rectangular smaller matrices called blocks.
Block matrix [8] makes matrix operations more Some basic properties [1],[2],[3] of determinants,
convenient. By partitioning a matrix into small blocks the adjoints, transpose and inverse of a matrix are as follows:
computational complexity becomes smaller then the case
when operating with the matrix without subdivision in Proposition 2.1: If A* be the adjoint matrix of a square
blocks or cells. matrix A of order n, then AA* = A*A = D(A) I, where
D(A) represents the determinant of A. And if D(A) ≠ 0,
A block diagonal matrix, also called a diagonal block then A* = D(A)A-1.
matrix, is a square diagonal matrix in which the diagonal
elements are square matrices of any size and the off- Proposition 2.2: If A is a square matrix of order n, D(A*)
diagonal elements are 0. = (D (A))n-1.
A secondary block diagonal matrix is a block matrix in Proposition 2.3: If A is a nonsingular square matrix of
which the blocks of the secondary diagonal are square order n, (A-1 )* = (A*)-1 = .
matrices and the off diagonal elements are the zero
matrices. Proposition 2.4: If A is a square matrix of order n,
Let A be an m order block matrix such that A has nonzero ( (A-1 )T)* = ((A*)T)-1 = .
sub- blocks on secondary diagonals while the others are
zero matrices, that is Proposition 2.5: If A is a complex square matrix of order
0 0 . . . 0 A1 n , ̅ is conjugate of A and B = AH = ̅ ,
Then B* = (AH)* = ( ̅ )* = ( ̅̅̅ ) T = (A*)H .
A= 0 0 . . . A2 0
... ... . . . ... ... Proposition 2.6: If A is a complex square matrix of order
Ak 0 . . . 0 0 n , ̅ is conjugate of A and B = AH = ̅ ,
Then BT = (AH)T = ̅ = ̅.
Where , i = 1,2,…, k is a square matrix of order n. A
is called secondary diagonal matrix. Proposition 2.7: If A is a complex square matrix of order
n , ̅ is conjugate of A and B = AH = ̅ ,
Sohana Jahan is with the Department of Mathematics, University of Then D(B) = D(AH) = D ( ̅ ) = ̅̅̅̅̅̅̅ .
Information Technology and Sciences, Dhaka, Bangladesh
(Mobile: +88 - 01918922083, e-mail:sohana_math@yahoo.com)
Proposition 2.8: If A is a complex square matrix of order
Imtiaz Ahmed is with the Department of Applied Physics Electronics n , ̅ is conjugate of A and B = AH = ̅ , and if |z|
and Communication Engineering, University of Dhaka, Bangladesh represents the modulus of complex number z
(Mobile: +88 - 01912025741, e-mail:imtiaz@univdhaka.edu)
Then = ̅̅̅̅̅̅̅ = |D(A)|2.

106702-5454 IJBAS-IJENS © April 2010 IJENS

IJENS
 International Journal of Basic & Applied Sciences IJBAS-IJENS Vol:10 No:02 59

III. SOME OPERATION PROPERTIES OF HERMITIAN

BLOCK MATRICES
Proposition 3.3: Let A and B be square block matrix
Hermitian Matrix: A Hermitian matrix [11],[12] where B = AH = ̅
(or self-adjoint matrix) is a
square matrix with complex entries so that the matrix is ( ) ( )
equal to its own conjugate transpose - that is, if the ̅̅̅̅̅̅
element in the ith row and jth column is equal to
the complex conjugate of the element in the jth row Proof:
and ith column, for all indices i and j.In case the
matrix has only real entries, a matrix is Hermitian if and ( ) ( )
only if it is symmetric with respect to the (top left to
bottom right) diagonal of the matrix.
Since
A complex matrix A is Hermitian if
AH = ̅ = A. and

For example A = [ ] is Hermitian. | | | |

By Proposition 2.1, A* = D(A) A-1, we have

Note that main diagonal entries of a Hermitian matrix [9],
[10] must be real number.
( ) | |( )
Proposition 3.1: If A be an m order Hermitian Block
matrix where
( )
0 0 . . . 0 A1
A= 0 0 . . . A2 0
( )
... ... . . ... ...
Ak 0 . . . 0 0
( )
Then Ak = A1 = ̅̅̅ . In general Ak+1-i = AiH = ̅ ,
H

( )
̅̅̅̅̅̅
i = 1,2,…[k], where [k] = {
The result can be generalized to the case of having more
sub – blocks on secondary diagonal, such as
Proposition 3.2: If A is invertible matrix then

0 0 . . . 0 Ak-1 ( )
-1 -1
A = 0 0 . . . Ak-1 0
... ... . . . ... ...
A1 -1
0 . . . 0 0 ( )
̅̅̅̅̅̅̅̅
And
0 0 0 A1 * 0 0 0
0 0 A2 0 = 0 0 0
0 A3 0 0 0 ̅̅̅̅̅̅̅̅ 0 0
A4 0 0 0 ̅̅̅̅̅̅̅̅ 0 0 0

106702-5454 IJBAS-IJENS © April 2010 IJENS

IJENS
 International Journal of Basic & Applied Sciences IJBAS-IJENS Vol:10 No:02 60

In general if k is even
0 0 . . . 0 A1 *
0 0 . . . A2 0
... ... . . ... ...
Ak 0 . . . 0 0
0 0 … 0 0 0 | ( )|

0 0 … 0 0 … | ( )| 0
…. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. … … … … …. …. ….. …..
= 0 0 … | ( )| ( )( ) ….. 0 0
̅̅̅̅̅̅̅̅̅
0 0 … | ( )| ( ) 0 ….. 0 0
…. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. … … … … ….
0 ̅̅̅̅̅̅̅̅ | ( )| …… 0 0 .… 0 0

̅̅̅̅̅̅̅̅ | ( )| 0 …… 0 0 ..… 0 0
If k is odd then
0 0 . . . 0 A1 *
0 0 . . . A2 0
... ... . . ... ...
Ak 0 . . . 0 0

0 0 … 0 … 0 | ( )| ( )

0 0 … 0 … | ( )| ( ) 0
= …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. ….
0 0 | ( )| ( ) ….. 0 0
…. …. …. …. …. …. …. …. . …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. ….
0 ̅̅̅̅̅̅̅̅ | ( )| ( ) …… 0 …… 0 0

̅̅̅̅̅̅̅̅ | ( )| ( ) 0 …… 0 …… 0 0

In determining the adjoint of a complex Hermitian block with matrices have to be considered.. Thus the
matrix with blocks in secondary diagonal, we have to
computational complexity reduces in case of Hermitian
compute matrix operations with fewer blocks. In
block matrix. The higher the order of the blocks, the more
proposition 3.3, since B = AH = ̅ implies D(B) = ̅̅̅̅̅̅̅ computational complexity reduces. In proposition 3.3, if the
and also B* = (A*)H , matrix operations with only one matrices A and B are of order 2, 5 steps are needed to
block A needed to be calculated in determining the adjoint calculate the four co – factors and to take the transpose of
of the Hermitian block matrix with two blocks on its the matrix constructed by the co-factors to determine the
secondary diagonal . Thus using conjugate of complex adjoint of B. But if we use Hermitian conjugate of the
number and the Hermitian conjugate of a complex matrix, adjoint matrix of A then only 2 steps are needed to find the
computational complexity can be reduced. Again, if the conjugate of each entry of the adjoint of A and to take the
matrix has 3 blocks in secondary diagonal then only two transpose of the resultant matrix. Thus the number of
blocks have to be considered. In case of a matrix with 4 required steps reduces by three. So in general if A and B are
blocks, determinant and adjoint of two matrices have to be
of order n, then steps are needed to find the adjoint
calculated to determine the adjoint of the original matrix. In of B and 2 steps are needed to find the Hermitian conjugate
general if the matrix has k blocks, then only matrices, of A. Thus the reduction in step number is
their determinants, conjugate of determinants, adjoints and Also determination of conjugate of determinant of A
Hermitian conjugate of their adjoint matrices have to be is easier then finding the determinant of the matrix B. Thus
considered if k is even. If k is odd then above operations the adjoint of a secondary diagonal Hermitian block matrix
of any size can be obtained very easily.

106702-5454 IJBAS-IJENS © April 2010 IJENS

IJENS
 International Journal of Basic & Applied Sciences IJBAS-IJENS Vol:10 No:02 61

Example 3.1: ( ) , ( ) ,
Consider the Hermitian matrix P of order 8.
( ) , ( )
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
P= 0 0 0 0 0 0 ( )
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0 =( )
0 0 0 0 0 0

Let us name the matrices A1 = ( ) ,

A2 = ( ) , A3 = ( ) , A4 = ( ) ( )

Thus P is the block matrix

( )

0 0 0 A1
̅̅̅̅̅̅̅
P= 0 0 A2 0
0 A3 0 0
( )
A4 0 0 0
Now, ( )
0 0 0
P*= 0 0 0
̅̅̅̅̅̅̅̅
0 ̅̅̅̅̅̅̅̅ 0 0

̅̅̅̅̅̅̅̅ 0 0 0 ( )

, ,
=( )
,

Thus
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
P*= 0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0

The adjoint of a invertible block secondary diagonal matrix is still a block secondary diagonal matrix. In fact the adjoint of an
invertible block secondary diagonal Hermitian matrix is a block secondary diagonal Hermitian matrix.

Example 3.2
Suppose P is a matrix of order 10, where
106702-5454 IJBAS-IJENS © April 2010 IJENS
IJENS
 International Journal of Basic & Applied Sciences IJBAS-IJENS Vol:10 No:02 62

0 0 0 0 0 0 0 0 ( ), ( ) ,
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 ( ) , ( ), ( )
0 0 0 0 0 0 0 0
P= 0 0 0 0 2 0 0 0 0
0 0 0 0 5 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 ( )
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
=( )

Let A1 = ( ), A2 = ( ),

A3 = ( ) , A4 = ( ) , ( )

( )
A5 = ( )

Then

( )
0 0 0 0 A1
P= 0 0 0 A2 0
( )
0 0 A3 0 0
0 A4 0 0 0
A5 0 0 0 0 ̅̅̅̅̅̅̅̅

( )
Now,
( )
0 0 0 0
0 0 0 0
̅̅̅̅̅̅̅̅
P*= 0 0 0 0

0 ̅̅̅̅̅̅̅̅ 0 0 0 ( )
̅̅̅̅̅̅̅̅ 0 0 0 0
=( )
, ,
,

Thus

0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
P*= 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0

Proposition 3.4: Let A and B be n order invertible matrices ̅̅̅̅̅̅̅

(( ) ) (( )) ( )
of a hermitian block matrix , Then ̅̅̅
106702-5454 IJBAS-IJENS © April 2010 IJENS
IJENS
 International Journal of Basic & Applied Sciences IJBAS-IJENS Vol:10 No:02 63

Proof: Since By proposition 2.6 and proposition 2.7 ,

B* = (AH)* = ( ̅ )* = ( ̅̅̅ ) T = (A*)H .

( ) ( )
(B* )T = ((A*)H )T = (( ̅̅̅ ) T )T = ̅̅̅
Then
Therefore
(( ) ) (( )) ( ) ̅̅̅̅̅̅̅
(( ) ) (( )) ( )
̅̅̅

( )

In general if , i = 1,2,…, k is a square matrix of order n then if k is even

0 0 . . . 0 A1 * T
0 0 . . . A2 0
... ... . . ... ... =
Ak 0 . . . 0 0

0 0 … … 0 0 … 0 ̅̅̅̅̅̅̅̅ | ( )|

0 0 … 0 0 … ̅̅̅̅̅̅̅̅ | ( )| 0
…. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. … … … … …. …
̅̅̅̅̅̅̅̅̅
0 0 … 0 | ( )| ( )( ) ….. 0 0

0 0 … | ( )| ( ) ̅̅̅̅̅ 0 ….. 0 0
…. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. … … …. …
0 | ( )| ̅̅̅̅̅ …. 0 0 …… ….. 0 0

| ( )| ̅̅̅̅̅ 0 …… 0 0 …… ….. 0 0

If k is odd then
0 0 . . . 0 A1 * T
0 0 . . . A2 0
... ... . . ... ... =
Ak 0 . . . 0 0

0 0 … 0 … 0 ̅̅̅̅̅̅̅̅ | ( )| ( )

0 0 … 0 … ̅̅̅̅̅̅̅̅ | ( )| ( ) 0
…. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. …. ….
0 0 | ( )| ( ) ….. 0 0
…. …. …. …. …. …. …. …. . …. …. …. …. …. …. …. …. …. …. …. …. . …. …. …. …. …. ….
0 | ( )| ( ) ̅̅̅̅̅ …. 0 ….. 0 0

| ( )| ( ) ̅̅̅̅̅ 0 .… 0 ….. 0 0
Transpose of adjoint of Hermitian secondary diagonal since properties of conjugate of complex numbers reduces
block matrix can be determined using less matrix operations computational complexity.
106702-5454 IJBAS-IJENS © April 2010 IJENS
IJENS
 International Journal of Basic & Applied Sciences IJBAS-IJENS Vol:10 No:02 64

Example 3.3
( ),
Let P be a block matrix of order 9, where

0 0 0 0 0 0
0 0 0 0 0 0 ( )
0 0 0 0 0 0
0 0 0 0 0 0
P= 0 0 0 4 0 0 0 ̅̅̅̅̅ ( )
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0
5 0 0 0 0 0 0
̅̅̅̅̅̅̅̅̅

Let ( ), ( )

( ), ( ) =( )

Thus ( ).

√ ( )
Now (( ))

=( )
Now,

0 0 ̅̅̅̅̅̅̅̅̅
P*= 0 0
̅̅̅̅ 0 0 ̅̅̅̅̅

( )
, , √

( )

Hence (( ))

0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
P*= 0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0

106702-5454 IJBAS-IJENS © April 2010 IJENS

IJENS
 International Journal of Basic & Applied Sciences IJBAS-IJENS Vol:10 No:02 65

IV. CONCLUSION
It is well established fact that partitioning a matrix into
small blocks results in significant reduction in
computational complexity compared with the case when
operating with the matrix without subdivision in blocks or
cells. In this paper we have considered secondary diagonal
Hermitian block matrix. In case of finding the adjoint for a
matrix of order m with k blocks in secondary diagonal
(Proposition 3.3). we have to compute determinants and
adjoint matrix of blocks if k is even and blocks if k
is odd. Thus computational complexity reduces more in
case of Hermitian block matrices since in this case Ak+1-i =
AiH (Proposition 3.1). We have verified our propositions
considering several secondary diagonal Hermitian block
matrices of higher order.

In this paper we have considered all the blocks of the

secondary diagonal of same order. An extension of this
work can be done in future considering a secondary
diagonal block matrix whose blocks are not of same order.

REFERENCES
[1] Chengmao Han, “Some operation properties of Adjoint Matrices for
Block Matrices”, Journal of Mathematical research, 1( 2),
(2009),119 - 123.
[2] Chen, Jing Liang & Chen, Xiang Hui. (2001). Special matrix,
Beijing, Tsinghua university press.
[3] Lin, Lei (2004). The adjoint matrix of square matrix. Studies in
college Mathematics, (6), 21 – 23
[4] Roger A. Horn, Charles R. Johnson, “Matrix Analysis”, Cambridge
University Press,(1990) New York, page 167 - 244.
[5] Thomas S. Shores, “Applied Linear Algebra and Matrix Analysis”,
(2000), 76 – 80,
[6] P. Lancster and M. Tismenersky, “The Theory of Matrices”
Academic Press, Orlando, Florida, 1985.
[7] Carl D. Meyer, “Matrix Analysis and Applied Linear Algebra”,
(2000), 475-480
[8] Miroslav Fiedler, Vlastimil Ptak “Diagonal Blocks of two Mutually
Inverse Positive Definite Block Matrices”, (1997), Czechoslovak
Mathematical Journal, Vol 47, No.122, 127 – 134.
[9] Tamer Oraby, “”The Spectral Laws of Hermitian Block Matrices with
Large Random Blocks, Electronic Communication on Vol 12, (2007)
, 455 - 476.
[10] L S Cederbaum , J Schirmer and H -D Meyer, “Block
Diagonalization of Hermitian Matrices”, Journal of physics A:
Mathematical and General, (1989),Vol 22, No 13.
[11] Chi- Kwong Li, Yin – Tung Poon, Principal Submatrices of a
Hermitian Matrix”, Linear and Multilinear Algebra, Taylor and
Francis, June 2003, Vol 51, Issue 2, pp 199 – 208.
[12] N. N Chang, Man Kam Kwong , “Hermitian Matrix
Inequalities and Conjecture”, The American Mathematical Monthly,
Vol 92, Issue 8, 1985, pp. 533 -541

106702-5454 IJBAS-IJENS © April 2010 IJENS

IJENS