Department of Aerospace Engineering

AE602 Mathematics for Aerospace Engineers

Solution to Assignment 3

1.
AB = C

ABB 1 = CB 1

A(BB 1 ) = CB 1

AI = CB

(Postmultiplying by B 1 )
(Using associative law of multiplying matrices)
(Since BB 1 = I)

A = CB 1

= (CB
= (B

(Since AI = A)

1 1

1 1

(Taking incerse of both sides)

1

(Since (AB)1 = B 1 A1 )

= BC 1

(Using convolution property of matrix inversion)

Similarly,
P A = LU
P AA1 = LU A1

P I = P = LU A1

(LU )1 P = (LU )1 (LU )A1 = IA1

A1 = U 1 L1 P

2. As B is the inverse of A2 ,
(A2 )1 = B

(AA)1 = B

A1 A1 = B

A(A1 A1 ) = AB
1

(AA

IA

)A

= AB

=A

= AB

Thus, A is invertible if A2 is invertible.

1

(Premultiplying by A)
(Associative law)

3. Writing the given matrices and identity matrix of same order as a single partitioned matrix and
applying the appropriate row operations:
(a).

1 0 0 1 0 0
[A1 |I] = 1 1 1 0 1 0
0 1 0 0 0 1

1 0 0 1 0 0
0 1 0 1 1 1 (R2 R2 R1 R3 )
0 1 0 0 0 1
= [I|A1
1 ]
Hence,

A1
1

1
= 1
0

0 0
1 1
0 1

(b).

2 1 0 1 0 0
[A2 |I] = 1 2 1 0 1 0
0 1 2 0 0 1

2 1 0 1 0 0
0 23 1 12 1 0 (R2 R2 + 21 R1 )
0 1 2 0 0 1

2 1 0 1 0 0
0 23 1 12 1 0 (R3 R3 + 32 R2 )
4
2
1
0 0
1
3
3
3

2 1 0 1 0 0
0 34 32 34 (R2 R2 + 43 R3 )
0 23
4
1
2
0 0
1
3
3
3

3
1
2 0 0 2 1 2
0 32 0 34 32 43 (R1 R1 + 32 R2 )
0 0 43 13 23 1

1 0 0 34 12 14
0 1 0 12 1 12 (R1 12 R1 ,R2 23 R2 , R3 43 R3 )
0 0 1 14 12 34

= [I|A1
2 ]
Hence,
3
A1
2 =

4
1
2
1
4

1
2

1
1
2

1
4
1
2
3
4

(c).

0
[A3 |I] = 0
1

1
0
0

1
0
0

0
1
1

1
1
1

1
0
0

0
1
0

1 1
1 1
0 1

0
0
1

0
1
0

1 1
1 0
0 1

0
1
1

0
0
1

1
0
0
1
1
0

(R1 R3 )

1
0
0

(R1 R1 R2 , R2 R2 R3 )

= [I|A1
3 ]
Hence,

A31

0
= 1
1

1
1
0

1
0
0

4(a).

0
0
[A1 |I] =
0
4

4
0

0
0

1
0

0
0
=
A1

0 0 1
0 2 0
3 0 0
0 0 0

1
0
0
0

0
1
0
0

0
0
1
0

0 0 0
3 0 0
0 2 0
0 0 1

0
0
0
1

0
0
1
0

0
1
0
0

0 0 0
1 0 0
0 1 0
0 0 1

0
0
0
1

0
0

1
2

0
0

1
3

0
0

0
1

1
0
(R1 R4 , R2 R3 )
0
0

1
4

0
0

[I|A1
1 ]

0
0
=
0
1

0
0

1
2

0
0

1
3

1
4

0
0

(R1 14 R1 , R2 31 R3 ,R3 12 R3 )

(b).

1
0
0 0 1 0 0 0
1
1
0 0 0 1 0 0
2

[A2 |I] =
0 2
1 0 0 0 1 0
3
0
0 34 1 0 0 0 1

1 0
0 0 1 0 0 0
0 1
0 0 12 1 0 0
(R2 R2 + 1 R1 )

2
0 2
1 0 0 0 1 0
3
3
0 0 4 1 1 0 0 0

1 0 0 0 1 0 0 0
0 1 0 0 1 1 0 0
2
2

0 0 1 0 1 2 1 0 (R3 R3 + 3 R2 )
3
3
0 0 43 1 0 0 0 1

1 0 0 0 1 0 0 0
0 1 0 0 1 1 0 0
3
2

0 0 1 0 1 2 1 0 (R4 R4 + 4 R3 )
3
3
0 0 0 1 14 12 34 1

A1

= [I|A1
2 ]

1 0 0
1 1 0
2
=
1 2 1
3
3
1
4

1
2

3
4

0
0

0
1

(c). Let,

a
B=
c


b
d


B
A3 =
O

O
B

then,


where O is appropriate null matrix. Let us take the inverse of A3 as (where appropriate C, D, E and F
are to be determined),


C D
A1
=
3
E F
Then,

B
O

O
B



C
E

 
D
I
=
F
O

O
I

Using rules of block multiplication,

BC = I

C = B 1

BD = O

D=O

BE = O

E=O

BF = I

F = B 1

Now,
B



adj(B)T
1
d b
=
=
det(B)
ad bc c a

Thus, the inverse

A1
3

d b 0
0
c a
1
0
0

0
0
d
b
ad bc
0
0 c a

5.
AT = (B + B T )T
= B T + (B T )T
= BT + B = A
Hence, A is always symmetric (irrespective of B).
K T = (B B T )T
= B T (B T )T
= BT B
= (B B T ) = K
Hence, K is always skew-symmetric (irrespective of B).
For


1 3
B=
1 1

 
 

1 3
1 1
2 4
A=
+
=
1 1
3 1
4 2

 
 

1 3
1 1
0 2
K=

=
1 1
3 1
2 0
To express B as a sum of a symmetric and a skew-symmetric matrices,
1
(B + B T ) +
2
1
1
= A+ K
2
2
1 2
=
+
2 1
| {z }

B=

symmetric

1
(B B T )
2


0 1
1 0
| {z }

skewsymmetric

6(a). For A to be invertible it should be non-singular.

det(A) = f ec 6= 0 f, c, e 6= 0

(b). Similarly,
det(A) = e(ad bc) 6= 0 e 6= 0, ad 6= bc
Same conditions can be derived by assuring pivots to be non-zero.
7(a).

1
A = 3
5

1
0
0

1
0
0

5
18
30

3 5
3 3 (R2 R2 3R1 , R3 R3 5R1 )
3 5

3 5
3 3 (R3 R3 R2 )
0 2
3
12
18

The matrix for above transformations is

1
LT = 3
5

0
1
1

0
0
1

Therefore,

1
A = LDLT = 3
5

0
1
1

1
0
0 0
0
1

1
0
0 0
0
2

0
3
0

3
1
0

5
1
1

(b).


a b
c d

a
b

b2
0 d
a
"
#
1 0
T
L = b
1
a

A=

Thus,
"

1
A = LDLT = b
a

#
a

1 0

"

0
d

b
a

1
0

b
a
1

8. Since A is a matrix of elementary row transformations its inverse is given by the inverse of this
transformation. Hence,

1
0
0
0

1
0
0

A1 =
1 1
0
0

3
3

1
1
1

1
2
2
2
9. The solution is a plane as only two columns are linearly independent. It is a subspace of R2 and
null-space of A.
10.

1 2 0 1
A = 0 1 1 0
1 2 0 1

1 2 0 1
0 1 1 0
0 0 0 0

(R3 R3 R1 )

Therefore,

1
A = LU = 0
1

0
1
0 0
1
0

0
1
0

2
1
0

1
0
0

0
1
0

The basic variables (those corresponding to non-zero pivots) are x1 and x2 and the free variables are x3
and x4 . To find the general solution of Ax = 0, we write it in the reduced form:
x1 + 2x2 + x4 = 0
x2 + x3 = 0
Solving in terms of free variables,

2
1
2x3 x4
0
x3
1

x=
x3 = x3 1 + x4 0
x4
0
1
The rank of A is equal to the number of basic variables i.e. 2.
11.


0 1 4 0
A=
0 2 8 0


0 1 4 0

0 0 0 0

(R2 R2 2R1 )

Therefore,

1
A = LU =
2


0 0
1 0
7

1
0

4
0

0
0

The basic variable (those corresponding to non-zero pivots) is x2 only and the free variables are x1 , x3
and x4 . To find the general solution of Ax = 0, we write it in the reduced form:
x2 + 4x3 = 0
Solving in terms of free variables,

x1
1
0
0
4x3
0
4
0

xh =
x3 = x1 0 + x3 1 + x4 0
x4
0
0
1
The rank of A is equal to the number of basic variables i.e. 1.
To find the condition for consistency of the non-homogeneous system, we apply same transformation
both sides:

 

 x1

0 1 4 0
x2 = b1
Ax = b
b2
0 2 8 0 x3
x4


 x1



0 1 4 0
b1
x2 =

0 0 0 0 x3
b2 2b1
x4
To be consistent
b2 2b1 = 0 b2 = 2b1
The reduced system is
x2 + 4x3 = b1 x2 = b1 4x3




0
0
x1
1
0
0
4
b1 4x3 b1
0




x = xp + xh =
x3 = 0 + x1 0 + x3 1 + x4 0
1
0
0
x4
0

is the general solution of Ax = b.

12.

0
1
A=
4
0

0
1

0
0

0
2

8
0

0
2

0
0

(R3 R3 4R2 )

The basic variable (those corresponding to non-zero pivots) is x2 and the free variable is x1 . To find the
general solution of Ax = 0, we write it in the reduced form:
x1 + 2x2 = 0
8

Solving in terms of free variables,

"

#
#
"
x1
1
1
1
xh =
= x1
x1

2
2
The rank of A is equal to the number of basic variables i.e. 1.
To find the condition for consistency of the non-homogeneous system, we apply same transformation
both sides:

b1
0 0 x1
1 2 x2 b2

Ax = b
4 8 x3 = b3
0 0 x4
b4

b1
x1
0 0
1 2 x2 b2

0 0 x3 = b3 4b2
b4
x4
0 0
To be consistent
b1 = 0
b3 = 4b2
b4 = 0
The reduced system is
x1 + 2x2 = b2 x2 =

1
1
b2 x 1
2
2
"

x1

1
x = xp + xh = 1
b2 x1
2
2

"

#
#
"
 
0
0
1
1
= 1
+ x1
+ x2
0
b2

2
2

is the general solution of Ax = b.

13(a). x1 and x3 are basic variables.
x1 + 2x2 + 3x3 + 4x + 4 = 0
x3 + 2x4 = 0
x1 = 2x2 + 2x4
x3 = 2x4

2x2 + 2x4

x2

x=
2x4
x4


2
2
1
0

x = x2
0 + x4 2
0
1

(b).
x1 + 2x2 + 3x3 + 4x + 4 = a
x3 + 2x4 = b
x1 = a 3b 2x2 + 2x4
x3 = b 2x4

a 3b 2x2 + 2x4

x2

x=

b 2x4
x4

a 3b
2
2
0
1
0

x=
b + x2 0 + x4 2
0
0
1

10