1.2.4.

MATRIX TRANPOSITION

For any matrix

æ a11 a12 ! a1n ö
ç ÷
ç a a ! a 2n ÷
A = ç 21 22
! !!!÷
ç ÷
ç a a !a ÷
è m1 m 2 mn ø

a matrix
æ a11 a21 ! am1 ö
ç ÷
ç a a ! a m2 ÷
AT = ç 12 22 ,
! !! ! ÷
ç ÷
ç a a !a ÷
è 1n 2n mn ø

which can be obtained from matrix A by replacing its rows with the corresponding columns and the
columns by the corresponding rows. This matrix is called a transposed matrix.
To get matrix AT from a given matrix A , the first row of matrix A is written as the first
column of matrix AT , the second row of matrix A is written as the second column of matrix AT
and so on. This operation is called the transposition of matrix A .

1
 A square matrix is called symmetric, if
AT = A ,
and antisymmetric, if
AT = - A .

The elements of a symmetric matrix, placed symmetrically with respect to the main
diagonal, are equal.
The elements of an antisymmetric matrix, placed symmetrically with respect to the main
diagonal, have opposite signs and all the diagonal elements are equal to zero.

Properties of transposition operation

Let l be an arbitrary number, A , B – arbitrary matrices, for which operations of matrix

addition and multiplication on the left side, are defined. Then the operations on the right side are
defined as well and the following equations are correct:
1. (l × A)T = l × AT ;

2. ( A + B)T = AT + BT ;
3. ( A × B )T = BT × AT ;

4. (AT ) = A .
T

2
 Example 1.14. Find AT , B T , C T , for
æ 0 4 - 5ö æ1 4 5ö
æ 1 2 3ö ç ÷ ç ÷
A = çç ÷÷ , B = ç - 4 0 6 ÷ , C = ç 4 2 6÷ .
è$0 1 2ø ç 5 -6 0 ÷ ç 5 6 3÷
!#!" è ø è ø
2´ 3
o By the definition, during the transposition the first row of matrix A becomes the first
column of matrix AT , the second row becomes the second column:
æ1 0ö
ç ÷
AT = ç 2 1 ÷ .
ç 3 2÷
è$#"ø
( 3´ 2 )

Similarly we get
æ 0 -4 5 ö æ1 4 5ö
T ç ÷ T ç ÷
B =ç 4 0 - 6÷ , C = ç 4 2 6÷ .
ç-5 6 0 ÷ø ç 5 6 3÷
è è ø

As B T = - B , it means that B is antisymmetric.

As C T = C , it means that C is symmetric. n

3
 Example 1.15. Find matrices (l × A) T , l × AT , ( A + B )T , AT + B T , ( A× B )T , B T × AT , (AT ) ,
T

for
æ1 2ö æ 5 6ö
l = 2, A = çç ÷÷ , B = çç ÷÷ .
è3 4ø è7 8ø
o We have
T T
æ æ1 2öö æ 2 4ö æ 2 6ö
(2 × A) T
= çç 2 × çç ÷÷ ÷÷ = çç ÷÷ = çç ÷÷ ,
è è 3 4 øø è 6 8 ø è 4 8 ø
T T
éæ 1 2 ö æ 5 6 öù æ6 8ö æ 6 10 ö
(A + B) T
= êçç ÷÷ + çç ÷÷ú = çç ÷÷ = çç ÷÷ ,
ëè 3 4 ø è 7 8 øû è10 12 ø è 8 12 ø
T T
éæ 1 2 ö æ 5 6 öù æ 19 22 ö æ 19 43 ö
(A × B)
T
= êçç ÷÷ × çç ÷÷ú = çç ÷÷ = çç ÷÷ .
ëè 3 4 ø è 7 8 øû è 43 50 ø è 22 50 ø
Note that
T
æ1 2ö æ 1 3ö æ 2 6ö
T
2 × A = 2 × çç ÷÷ = 2 × çç ÷÷ = çç ÷÷ = (2 × A)T ,
è3 4ø è 2 4ø è 4 8ø
T T
æ1 2ö æ 5 6ö æ 1 3 ö æ 5 7 ö æ 6 10 ö
T
A + B = ççT
÷÷ + çç ÷÷ = çç ÷÷ + çç ÷÷ = çç ÷÷ = ( A + B )T ,
è3 4ø è7 8ø è 2 4 ø è 6 8 ø è 8 12 ø
T T
æ 5 6ö æ1 2ö æ 5 7 ö æ 1 3 ö æ 19 43 ö
T T
B × A = çç ÷÷ × çç ÷÷ = çç ÷÷ × çç ÷÷ = çç ÷÷ = ( A × B )T ,
è 7 8ø è3 4ø è 6 8 ø è 2 4 ø è 22 50 ø
T
æ æ 1 2 öT ö T
(A ) T T ç
= çç
çè3 4ø ÷
÷÷ ÷ æ 1 3ö
= çç
2 4
æ1 2ö
÷÷ = çç
3 4
÷÷ = A ,
è ø è ø è ø

i.e. (l × A)T = l × AT , ( A + B )T = AT + BT , ( A × B )T = BT × AT , (AT ) = A . n

T
4
 1.2.5. BLOCK MATRICES AND BLOCK MATRICES OPERATIONS

A numerical matrix A of sizes m´ n , divided by horizontal and vertical lines into blocks
(cells), which represent matrices, is called a block (cell) matrix.
The elements of a block matrix A are matriсes Aij of sizes mi ´ n j , i = 1,2,..., p , j = 1,2,..., q , so
that m1 + m2 + !+ m p = m and n1 + n2 + ! + nq = n .
The operations of addition, multiplication by a number and matrix multiplication for block
matrices are performed by the same rules as for ordinary matrices, the only difference is that
blocks are used instead of elements.
If numerical matrices A and B of same sizes are equally split into blocks A = (Aij ) and
( ) ( )
B = Bij , then their sum C = A + B can be similarly split into blocks C = Cij , so that for each block
the following equation is correct: Cij = Aij + Bij .
If a block matrix A = (Aij ) is multiplied by a number, we get matrix lA = Al = (lAij ) .
During the transposition of block matrix, we should transpose both the block structure and
the blocks, e.g.
T
æA A12 ö æ AT T ö
A21
A = çç 11
T
÷÷ = ç 11 ÷.
ç AT T ÷
è A21 A22 ø è 12 A22 ø

5
 Example 1.16. We have the following block matrices
æ 2 3 4ö æ1 1 0ö
ç ÷ æA A12 ö ç ÷ æB B12 ö
A = ç 3 4 5 ÷ = çç 11 ÷ and B = ç 2 1 2 ÷ = çç 11 ÷.
ç 4 5 6 ÷ è A21 A22 ÷ø ç 3 0 1 ÷ è B21 B22 ÷ø
è ø è ø
Find matrices C = A + B , D = 5B , B T .
o Matrices A and B have blocks of equal sizes: blocks A11 and B11 have sizes m1 ´ n1 = 1´ 2 ; blocks
A12 and B12 – m1 ´ n2 = 1´1 ; blocks A21 and B21 – m2 ´ n1 = 2 ´ 2 ; blocks A22 and B22 – m2 ´ n2 = 2 ´1 .
æC C ö
Matrix C = A + B will have blocks of the same sizes: C = çç 11 12 ÷÷ . For each block we find:
è C21 C22 ø
C11 = A11 + B11 = (2 3) + (1 1) = (3 4) ; С12 = A12 + B12 = (4) + (0) = (4) ;

æ 3 4 ö æ 2 1 ö æ 5 5ö æ 5ö æ 2ö æ 7ö
C21 = A21 + B21 = çç ÷÷ + çç ÷÷ = çç ÷÷ ;
С22 = A22 + B22 = çç ÷÷ + çç ÷÷ = çç ÷÷ .
è 4 5 ø è 3 0ø è 7 5ø è 6ø è1ø è 7ø
æ 3 4 4ö
ç ÷ æ C11 C12 ö
Hence, matrix C will have the following form: С = ç 5 5 7 ÷ = çç ÷÷ .
ç7 5 7÷ è C 21 C 22 ø
è ø
Matrix D = 5B will have blocks of the same sizes as B :
D11 = 5B11 = 5 × (1 1) = (5 5) ; D12 = 5B12 = 5 × (0) = (0) ;

æ 2 1 ö æ10 5 ö æ 2 ö æ10 ö
D21 = 5B21 = 5 × çç ÷÷ = çç ÷÷ ; D22 = 5B22 = 5 × çç ÷÷ = çç ÷÷ .
è 3 0 ø è15 0 ø è1ø è 5 ø
æ5 5 0ö
ç ÷ æD D ö
Therefore matrix D will be D = ç10 5 10 ÷ = çç 11 12 ÷÷ .
ç15 0 5 ÷ è D21 D22 ø
è ø
T ö ç
æ 1 2 3ö
æ BT B21 ÷
By the rule of block matrix transposition we get B = ç 11
T ÷ = ç1 1 0÷ . n
ç BT T ÷
B22 6
è 12 ø ç0 2 1÷
è ø
 Multiplication of block matrices A and B

Block matrices A and B are called consistent, if decomposition of matrix A = ( Aik ) into
blocks by columns is equal to the decomposition of matrix B = (Bkj ) by rows, i.e. blocks Aik have
sizes mi ´ pk , and blocks Bkj have sizes pk ´ n j ( k = 1,2,! , s ). Consistent block matrices’ elements
Aik and Bkj are consistent matrices.
A product C = A × B of consistent block matrices A and B is a block matrix C = (Cij ) , which
elements are calculated by the following formula:

Cij = Ai1B1 j + Ai 2 B2 j + !+ Ais Bsj .

It means that block matrices that are divided into blocks in an appropriate way can be multiplied by
the common way. To get the block Cij of the product, we need to separate out the i -th row of
blocks of matrix A and the j -th column of blocks of matrix B . Then we should find the sum of
pairwise products of the corresponding blocks: first block of the i -th row is multiplied by the first
block of the j -th column, the second block of the i -th row is multiplied by the second block of the
j -th row and etc., the results of multiplication are summed up.

7
 Example 1.17. We have block matrices
æ 2 3 4ö æ 1 1 0ö
ç ÷ æA A12 ö ç ÷ æB B12 ö
A = ç 3 4 5 ÷ = çç 11 ÷ and B = ç 2 1 2 ÷ = çç 11 ÷.
ç 4 5 6 ÷ è A21 A22 ÷ø ç 3 0 1 ÷ è B21 B22 ÷ø
è ø è ø
Find the product C = AB .
o Matrix A is divided into blocks: A11 of size m1 ´ p1 = 1´ 2 ; A12 – m1 ´ p2 = 1´1;
A21 – m2 ´ p1 = 2 ´ 2 ; A22 – m2 ´ p2 = 2 ´1 . Matrix B is divided into blocks: B11 of sizes p1 ´ n1 = 2 ´ 2 ;
B12 – p1 ´ n2 = 2 ´1 ; B21 – p2 ´ n1 = 1´ 2 ; B22 – p2 ´ n2 = 1´1 . Block matrices A and B are consistent.
Matrix A is divided by columns into two and one (counting from the left), matrix B is divided by
rows into two and one (counting from the above). Therefore product AB is defined. Matrix C = AB
æ C11 C12 ö
will have blocks C = çç ÷÷ . For each block we get:
è C21 C22 ø
æ 1 1ö
C11 = A11B11 + A12 B21 = (2 3) × çç ÷÷ + (4) × (3 0) = (8 5) + (12 0) = (20 5) ;
è 2 1ø
æ0ö
С12 = A11B12 + A12 B22 = (2 3) × çç ÷÷ + (4) × (1) = (6) + (4) = (10) ;
è 2ø
æ3 4 ö æ 1 1ö æ 5 ö
C21 = A21B11 + A22 B21 = çç ÷×ç ÷ + ç ÷ × (3 0) =
è4 5 ÷ø çè 2 1÷ø çè 6 ÷ø
æ 11 7 ö æ15 0 ö æ 26 7 ö
= çç ÷÷ + çç ÷=ç ÷;
è14 9 ø è18 0 ÷ø çè 32 9 ÷ø
æ 3 4ö æ 0ö æ 5ö æ 8 ö æ 5 ö æ13 ö
С22 = A21B12 + A22 B22 = çç ÷÷ × çç ÷÷ + çç ÷÷ × (1) = çç ÷÷ + çç ÷÷ = çç ÷÷ .
è 4 5ø è 2ø è 6ø è10 ø è 6 ø è16 ø

Hence, matrix С will be

æ 20 5 10 ö
ç ÷ æС С12 ö
С = ç 26 7 13 ÷ = çç 11 ÷. n
÷
ç 32 9 16 ÷ è С 21 С 22 ø 8
è ø
 1.2.6. GAUSS METHOD OF MATRIX REDUCTION TO ECHELON FORM

Elementary transformations of a matrix are the following transformations:

I. Swapping two columns (rows) of matrix.

II. Multiplying the elements of a column (row) by the nonzero constant.

III. Addition of the elements of a column (row), multiplied by a constant, to the elements of another column
(row).

Matrix B , which is found from the initial matrix A by a finite amount of elementary transformations, is called
an equivalent matrix. It is denoted by A ~ B .
A square matrix obtained by a finite amount of elementary transformations from an identity matrix, is called an
elementary matrix.
Echelon form of matrix:
æ0 ! 0 1 * * ! * * * ! * * * ! *ö
ç ÷
ç0 ! 0 0 1 * ! * * * ! * * * ! *÷
ç0 ! 0 0 0 0 ! 0 1 * ! * * * ! *÷
ç ÷
ç" # " " " " ! " " ! # " " " # "÷
ç ÷
ç" # " " " " ! " " ! # " * * ! *÷ .
ç0 ! 0 0 0 0 ! 0 0 0 ! 0 1 * ! *÷
(1.1)
ç ÷
ç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 height of each "step" is a row, symbol “1” denotes unity elements of a matrix, symbol “ * ” denotes
arbitrary elements, other elements are equal to zero.
Any matrix can be transformed into echelon form. It is enough to use elementary transformations of
matrix’s rows.
Remarks.
1. Matrix is also in echelon form if the elements denoted as “1” in (1.1), are arbitrary nonzero numbers. 9
2. It is considered that zero matrix is in echelon form.
 Algorithm for reducing matrix to echelon form

To bring a matrix to echelon form (1.1) we need to make the following operations:

1. Choose a nonzero element (pivot element) in the first column. If the row with the pivot
element (pivot row) is not the first, it should be placed on the first place (transformation of the I
type). If the first column has no pivot element (all elements are equal to zero), this column is
excluded and we continue the search of the pivot element in the remaining part of the matrix.
Transformations finish when all columns are excluded or all elements in the remaining part of the
matrix are equal to zero.

2. Divide the elements of the pivot row by the pivot element (II-type transformation). If the
pivot row is the last, transformation procedure should be ended.

3. All the elements of the pivot row should be multiplied by a coefficient and added to all
rows below (transformation of the III type). The value of the coefficient is chosen in order to
nullify elements below the pivot elements.

4. After the exclusion of the row and the column that have the pivot element, we return to
step 1, and all operations should be applied to the remaining part of the matrix.

10
 Example 1.18. Bring matrix to echelon form
æ 2 4ö
æ3 9ö æ 0 2 3ö ç ÷
A = çç ÷÷ , B = çç ÷÷ , C = ç 3 5÷ .
è 2 4ø è 2 4 6ø ç6 7÷
è ø
o In the first column of matrix A we choose the pivot element a11 = 3 ¹ 0 . Divide all
1 1
elements of the row by a11 = 3 (or multiply them by = ):
a11 3

æ 3 9 ö æ1 3ö
A = çç ÷÷ ~ çç ÷÷ .
è 2 4 ø è 2 4 ø
Add the first row, multiplied by (-2), to the second row:

æ 1 3ö
çç ÷÷
( -2 ) ~ æç 1 3 ö÷ .
ç 0 - 2÷
è 2 4ø è ø
The first row and the first column are now excluded from examination. There is the only
element ( -2 ) in the remaining part of the matrix, which is chosen as a pivot. Dividing of the last
row by the pivot element we get matrix in echelon form

æ1 3 ö æ 1 3ö
çç ÷÷ ~ çç ÷÷ .
è 0 -2 ø è 0 1ø

Transformations are finished, because the last pivot element is situated in the last row. Note
that the obtained matrix is upper-triangular. 11
 In the first column of matrix B we choose the pivot element b21 = 2 ¹ 0 , swap rows and
divide elements of the pivot row by the pivot element 2 :

æ 0 2 3ö æ 2 4 6 ö æ 1 2 3 ö
B = çç ÷÷ ~ çç ÷÷ ~ çç ÷÷ .
è 2 4 6 ø è 0 2 3 ø è 0 2 3 ø

There is no need to make step 3 of the algorithm because of the zero element below the
pivot element. We exclude the first row and the first column from the examination. There is the
pivot element 2 in the remaining part. Dividing the second row by 2, we get the echelon form of the
matrix
æ1 2 3ö æ1 2 3 ö
B ~ çç ÷÷ ~ çç ÷÷ .
è 0 2 3 ø è 0 1 1,5 ø

Transformations are finished, as the pivot row is the last.

12
 In the first column of matrix С we chose the pivot element с11 = 2 ¹ 0 . The first row is the
pivot. Divide its elements by c11 = 2 and get

æ 2 4ö æ1 2ö
ç ÷ ç ÷
C =ç 3 5 ÷~ç 3 5 ÷.
ç 6 7÷ ç 6 7÷
è ø è ø

To the second and to the third row we add the first one multiplied by ( -3 ) and ( - 6 ) respectively:

æ 1 2 ö (-3) (- 6) æ1 2 ö
ç ÷ ç ÷
ç 3 5÷ ~ ç 0 -1 ÷.
ç 6 7 ÷ ç 0 -5 ÷
è ø è ø

Pay attention that the obtained matrix is not in echelon form yet, as the second step is formed by
two rows (second and third) of matrix. After the exclusion of the first row and the first column, we
search the pivot element in the remaining part. This element is ( -1 ). We divide the second row by
( -1 ), and add the pivot row, multiplied by 5, to the third row:

æ1 2 ö æ1 2 ö æ1 2ö
ç ÷ ç ÷ ç ÷
ç 0 - 1 ÷ ~ ç 0 1 ÷ ( 5) ~ ç 0 1 ÷.
ç 0 -5 ÷ ç 0 -5 ÷ ç0 0÷
è ø è ø è ø

We exclude the second row and the second column from the examination. Further transformations
are impossible because all columns are excluded. The obtained matrix is in echelon form. n 13
 Algorithm for bringing matrix to reduced echelon form

If we continue making elementary row transformations, it is possible to simplify the matrix

and bring it to reduced echelon form:

æ0 ! 0 1 0 * ! * 0 * ! * 0 * ! *ö
ç ÷
ç0 ! 0 0 1 * ! * 0 * ! * 0 * ! *÷
ç0 ! 0 0 0 0 ! 0 1 * ! * 0 * ! *÷
ç ÷
ç" # " " " " ! " " ! # " " " # "÷
ç ÷
ç" # " " " " ! " " ! # " 0 * ! *÷ .
ç0 ! 0 0 0 0 ! 0 0 0 ! 0 1 * ! *÷ (1.2)
ç ÷
ç0 ! 0 0 0 0 ! 0 0 0 ! 0 0 0 ! 0÷
ç" # " " " " # " " " # " " " # "÷
çç ÷
è0 ! 0 0 0 0 ! 0 0 0 ! 0 0 0 ! 0 ÷ø

symbol “1” denotes elements, which are equal to one,

symbol “ * ” denotes elements with arbitrary values,
other elements are equal to zero.

All the other elements in a column with “1” are equal to zero.

Any matrix can be reduced to echelon (or even reduced echelon) form by elementary
transformation of its rows.

14
 Example 1.19. Bring the matrix to reduced echelon form
æ0 1 1 1 1 1ö
ç ÷
ç0 0 0 1 2 1÷
A=ç .
0 0 0 0 1 0÷
ç ÷
ç0 0 0 0 0 0 ÷ø
è
o Matrix is in echelon form.
Add the third row, multiplied by (-1), to the first row, and the third row, multiplied by (-2),
to the second row:
æ0 1 1 1 1 1ö æ0 1 1 1 0 1ö
ç ÷ ç ÷
ç0 0 0 1 2 1÷ ç0 0 0 1 0 1÷
A=ç ~ç .
0 0 0 0 1 0÷ ( -2 ) ( -1 ) ç 0 0 0 0 1 0÷
ç ÷ ÷
ç0 ç0 0 0 0 0 0 ÷ø
è 0 0 0 0 0 ÷ø è

Now we will add the second row, multiplied by (-1), to the first row. As the result we will
obtain matrix in reduced echelon form (1.2):

æ0 1 1 1 0 1ö æ0 1 1 0 0 0ö
ç ÷ ç ÷
ç0 0 0 1 0 1 ÷ ( -1 ) ç0 0 0 1 0 1÷
~ ç0 .
ç0 0 0 0 1 0÷ 0 0 0 1 0÷
ç ÷ ç ÷
ç0 ç0 0 0 0 0 0 ÷ø
è 0 0 0 0 0 ÷ø è
n
15
 Algorithm for reducing matrix to the simplest form
Any matrix by the elementary transformations (of rows and columns) can be reduced to the
simplest form:
æ1 ! 0 0 ! 0ö
ç ÷
ç" # " " # "÷
ç0 ! 1 0 ! 0÷ æE Oö
ç ÷ = çç r ÷. (1.3)
ç0 ! 0 0 ! 0÷ èO O ÷ø
ç" # " " # " ÷
ç ÷
ç0 ! 0 0 ! 0 ÷ø m´n
è
The upper-left corner of the matrix is an identity matrix of order r ( 0 £ r £ min{m; n} ), other
elements are equal to zero. In is considered that zero matrix is always in the simplest form ( r = 0 ).
Any matrix can be reduced to the simplest form by the elementary transformations of its rows and
columns.
æ 1 2 3ö
Example 1.20. Bring matrix A = çç ÷÷ to the simplest form.
è 2 4 5ø
o Let’s choose the element a11 = 1 as the pivot element. Add the first row, multiplied by (- 2 ) , to
the second row:

æ 1 2 3 ö ( -2 ) æ 1 2 3 ö
A = çç ÷÷ ~ çç ÷÷ .
è 2 4 5ø è 0 0 -1ø
Then we add the first column, multiplied by (- 2 ) , to the second row and the first column, multiplied by
(- 3) , to the third row:
æ1 2 3 ö æ1 0 0 ö
çç ÷÷ ~ çç ÷÷ .
è 0 0 -1 ø è 0 0 -1ø
( -2 )
( -3 )
Multiply all elements of the last column by (- 1) and switch it with the second column.
Thus, the initial matrix A is reduced to the simplest form (1.3) by elementary transformations . n
æ1 0 0 ö æ1 0 0ö
çç ÷÷ ~ çç ÷.
è 0 0 -1ø è&0 1 0 ÷ø 16
%$
( -1 ) E2
 1.2.8. TRACE

The trace of a square matrix is a sum of the elements of its main diagonal. A trace of a
square matrix A of order n is denoted
n
tr A = å aii .
i =1
For any square matrices A , B , C of the n -th order and vectors x , y of sizes n ´1 the
following properties are correct:
1) tr (A + B) = tr A + tr B ;

2) tr A = tr AT ;

3) tr (AT B) = tr (BT A) = tr (ABT ) = tr (BAT );

4) tr (x × yT ) = xT × y ;

5) tr (AxxT ) = xT Ax ;

6) tr (ABC ) = tr (BCA) = tr (CAB) ;

åå aijbij = tr (AB T ) .
n n
7)
i =1 j =1
17
Matrix trace A is also denoted sp A .
 æ1 2ö æ 5 6ö æ9 10 ö æ1ö æ 3ö
Example 1.23. Given that A = çç ÷÷ , B = çç ÷÷ , С = çç ÷÷ and x = çç ÷÷ , y = çç ÷÷ , illustrate correctness of
è3 4ø è7 8ø è11 12 ø è 2ø è 4ø
properties of the trace of a matrix.
æ6 8ö
o 1) tr A = 1 + 4 = 5 , tr B = 5 + 8 = 13 , tr A + tr B = 18 , tr ( A + B ) = tr çç ÷÷ = 18 ;
è10 12 ø
æ1 3ö
2) tr A = 5 , tr AT = tr çç ÷÷ = 5 ;
è 2 4ø

3) ( ) éæ 1 3 ö æ 5 6 öù
tr AT B = tr êçç ÷÷ çç
æ 26 30 ö
÷÷ú = tr çç ÷÷ = 26 + 44 = 70 ,
êëè 2 4 ø è 7 8 øúû è 38 44 ø

( ) éæ 5 7 ö æ 1 2 öù
tr BT A = tr êçç ÷÷ çç
æ 26 38 ö
÷÷ú = tr çç ÷÷ = 26 + 44 = 70 ,
êëè 6 8 ø è 3 4 øúû è 30 44 ø

( )
éæ 1 2 ö æ 5 7 ö ù
tr ABT = tr êçç ÷÷ çç
æ17 23ö
÷÷ ú = tr çç ÷÷ = 17 + 53 = 70 ,
ëêè 3 4 ø è 6 8 ø úû è 39 53 ø

( ) éæ 5 6 ö æ 1 3 ö ù
tr BAT = tr êçç
7 8
÷÷ çç
2 4
æ17 39 ö
÷÷ ú = tr çç ÷÷ = 17 + 53 = 70 ;
ëêè øè ø ûú è 23 53 ø

4) ( ) éæ 1 ö ù
tr xyT = tr êçç ÷÷ (3 4)ú = tr çç
æ 3 4ö
÷÷ = 3 + 8 = 11 ,
æ 3ö
xT y = (1 2)çç ÷÷ = 1 × 3 + 2 × 4 = 11 ;
ëêè 2 ø ûú è6 8ø è 4ø

æ 5 10 ö
5) ( )
éæ 1 2 ö æ 1 ö
tr AxxT = tr êçç
ù éæ 1 2 ö æ 1 2 öù
÷÷ çç ÷÷ (1 2)ú = tr êçç ÷÷ çç ÷÷ú = tr ç ÷ = 27 ,
ëêè 3 4 ø è 2 ø úû ëêè 3 4 ø è 2 4 øûú è11 22 ø
æ1 2ö æ 1 ö æ5ö
x T Ax = (1 2)çç ÷÷ çç ÷÷ = (1 2)çç ÷÷ = 27 ;
è 3 4 øè ø 2 è11ø
éæ 1 2 ö æ 5 6 ö æ 9 10 öù æ 413 454 ö
6) tr ( ABС ) = tr êçç ÷÷ çç ÷÷ çç ÷÷ú = tr çç ÷÷ = 1443 ,
ëè 3 4 ø è 7 8 ø è11 12 øû è 937 1030 ø
éæ 5 6 ö æ 9 10 ö æ 1 2 öù æ 477 710 ö
tr (BCA) = tr êçç ÷÷ çç ÷÷ çç ÷÷ú = tr çç ÷÷ = 1443 ,
ëè 7 8 ø è11 12 ø è 3 4 øû è 649 966 ø

éæ 9 10 ö æ 1 2 ö æ 5 6 öù æ 601 698ö
tr (СAB) = tr êçç ÷÷ çç ÷÷ çç ÷÷ú = tr çç ÷÷ = 1443 ;
ëè 11 12 øè 3 4 øè 7 8 øû è 725 842 ø

åå aijbij = 1× 5 + 2 × 6 + 3 × 7 + 4 × 8 = 70 = tr (AB T ). n
2 2
7) 18
i =1 j =1
 INDIVIDUAL TASK

æm nö æ -n m ö
1. For A = çç ÷÷ , B = çç ÷÷ , find:
è n m ø è n + m n - m ø
a) A + 2 B ; b) 2 AT - B ; c) A × B - B × A ; d) ( A - B )2 ; e) tr (AT × B) ;
f) tr (BT × A); g) tr (A× BT ) ; h) tr ( A + B ) ; i) tr A + tr B .
2. Bring matrix to echelon form:
æ1 1 1 1ö
ç ÷
а) ç m m n n ÷ .
ç n n m m÷
è ø

19