44 Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual

Chapter 8 Matrix algebra

Exercises 8.3
1. (a)  
  −1
1 4 = (1)(−1) + (4)(4) = 15
4
(b)  
  3
3 7 = (3)(3) + (7)(−4) = 9 − 28 = −19
−4
(c)     
5 2 9 47
=
1 3 1 12

(d)     
1 4 5 2 −7 18
=
−1 3 −3 4 −14 10

(e)     
5 1 6 −1 1 0
=
29 6 −29 5 0 1

(f)–(j) not provided

2. (a) A + D not possible

 
−8 0
C −A =
−3 0
D−E not possible

(b)

3
AB = DA not possible
10
BA not possible  DB not possible 
−4 −3 6 4 2
CA = BD =
 12 16  3 2 1
−7 5
AC = EB not possible
−21 19
BE not
 possible 
3 5 3
AE =
10 17 8

 
−49 7
(c)
0 28

( −9 −6 −3 )
 
2k 3k 4k
k 2k −k

Pearson
c Education Limited 2001
Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual 45

3. (a)      
1 2 2
M v1 = , M v2 = , M v3 =
0 0 −3

(b)      
0 0 3
M v1 = , M v2 = , M v3 =
1 2 2

(c)      
0 0 −3
M v1 = , M v2 = , M v3 =
1 2 2

4.  
7 17 23
AB =  −1 10 19 
24 10 4
 
8 16 17
BA =  17 4 8 
23 8 9

5.     
4 2 4 2 18 14
A2 = =
1 3 1 3 7 11
 
86 78
A3 =
39 47

6.
   
−10 16 2 −5 15
AB = A =
 −20 18   −10 10 
0 10 0 7
BA = B2 =
 −14 8
 −28 21
3 4
A+B =
 −6 9 
2 −15 48
(A + B) =
−72 57

 
−15 48
A2 + AB + BA + B 2 = = (A + B)2
−72 57

(A + B)2 = A2 + 2AB + B 2 because AB = BA

Pearson
c Education Limited 2001
46 Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual

  
1 5
 −2   5 
7. (a)   (b)  
1 −2
1 1

8.  
  1 2  
1 3 6 3  46 29
−5 =
2 −5 7 29 78
6 7

     
37 8 10
9. (a)  13  (b)  36  (c)  31 
−6 19 18

 
  31
11  33 
(d) (e)  
28 38
18

Exercises 8.5
1.
 
T 3 2
(a) A =
1 6
 
−1 3
(b) B T =
4 8
(c)     
3 1 −1 4 0 20
AB = =
2 6 3 8 16 56
 
0 16
(d) (AB)T =
20 56
 
T T 0 16
(e) B A =
20 56
 
x
2. Ix =  y .
z

3.
 
a b
A =
c d
  
a b a c
AAT =
c d b d
 
a2 + b2 ac + bd
= which is symmetric
ac + bd c2 + d2

Pearson
c Education Limited 2001
Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual 47

 
2 4 −1
4. AT =  1 2 3 
3 1 2
 
1 0 3
B T =  −7 2 4 
0 5 5
 
11 0 20
AB =  7 −20 15 
5 21 25
 
11 7 5
(AB)T =  0 −20 21 
20 15 25
 
11 7 5
B T AT =  0 −20 21  as required.
20 15 25

5. If two diagonal matrices are multiplied together the result is also diagonal,
    
1 0 0 2 0 0 2 0 0
e.g.  0 3 0   0 −1 0  =  0 −3 0 
0 0 5 0 0 3 0 0 15

 
a b
6. A = .
c d

If A is skew symmetric, AT = −A, i.e.

   
a c −a −b
=
b d −c −d

Thus
a = −a ⇒ a=0
d = −d ⇒ a=0
 
T 1 15
7. (a) A =
13 7
(b) (AT )T = A.
8.
     
T 9 4 9 3 18 7
(a) A + A = + = which is symmetric.
3 2 4 2 7 4
 
0 1
(b) A − AT = which is skew symmetric.
−1 0

9. (a) tr(A) = 7 + 5 = 12, (b) 0, (c) 3, (d) 5.

Pearson
c Education Limited 2001
48 Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual

Exercises 8.6
 
−1 1 d −b
1. Use A = to obtain
ad−bc −c a
 
−1 1 8 −6
A =
64 4 5

2. not provided

3.
 
21 24
AB = |AB| = −132
 9 4 
13 32
BA = |BA| = −132
9 12

4.
 
ae + bg af + bh
AB =
ce + dg cf + dh
|A| = ad − bc |B| = eh − f g
|AB| = (ae + bg)(cf + dh) − (af + bh)(ce + dg)
= aedh + bgcf − dgaf − cebh
= |A| |B|

5.    
1 4 −2 −2 1
A−1 = − =
2 −3 1 3
2 − 12

     
1 2 −2 1 1 0
+a =b
3 4 3
2 − 12 0 1

hence 1 − 2a = b (1)
2+a = 0 (2)
3
3+ a = 0 (3)
2
1
4− a = b (4)
2

From (2) or (3) a = −2.

From (1) or (4) b = 5.

Pearson
c Education Limited 2001
Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual 49

6.
 
1 4
AB =
−3 9
 
1 9 −4
(AB)−1 =
21 3 1
 
1 3 −1
B −1 =
7 1 2
 
1 3 −1
A−1 =
3 0 1
 
1 9 −4
B −1 A−1 =
21 3 1

7. Since M is orthogonal then M −1 is the same as the transpose of M.

 
cos ωt sin ωt 0
M −1 =  − sin ωt cos ωt 0
0 0 1

 
a b
8. The inverse of A = is
c d  
1 d −b
ad − bc −c a
 
ka kb
Now kA = and its inverse is then
kc kd
   
−11 kd −kb 1 1 d −b 1
(kA) = 2 = = A−1
k ad − k 2 bc −kc ka k ad − bc −c a k
     
1 1 0 1 0 3
(b) The inverse of A = is . The inverse of 13 A is 3A−1 , i.e. .
1 0 1 −1 3 −3

Exercises 8.7

1.  
 4 6 
 = 32 − 12 = 20
 2 8 
 
 1 3 4       
   0   2 0   2 1 
 2 1 0  = 1 1 − 3  + 4  = −1 + 6 + 28 = 33
   5 −1  3 −1  3 5 
 3 5 −1 
 
 6 7 2 

 1 4 3  = 39

 −1 1 4

2. cos2 ωt + sin2 ωt = 1 (trig. identity).

 
5 0 0
 
3.  6 3 2  = 55
4 5 7

Pearson
c Education Limited 2001
50 Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual

 
9 0 0 

0 7 0  = 504

0 0 8

4. |A| = −164 = |AT |.

 
 0 −3 1 
 
 10 4 1 

 −1 −2 −1 
5. (a) x =   = −43 = 1
2 −3 1  −43
 
5 4 1 
 
 2 −2 −1 

 
2 0 1 

5 10 1 

2 −1 −1  −43
y= = =1
−43 −43

 
2 −3 0 

5 4 10 

2 −2 −1  −43
z= = =1
−43 −43

hence x = y = z = 1.

 
 −1 1 0 

 −1 −1 1 
 
 16 5 −7  −25
(b) x =   = = −1

3 1 0  25
 2 −1 1 
 
 5 5 −7 

 
 3 −1 0 

 2 −1 1 

 5 −16 −7  50
y= = =2
25 25
 
3 1 −1 

 2 −1 −1 
 
 5 5 −16  75
z= = =3
25 25

hence x = −1, y = 2, z = 3.

Pearson
c Education Limited 2001
Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual 51

(c)–(d) not provided

6. (a) |A| = −133.

(b) cofactor of −2 is 47
cofactor of 1 is −39
cofactor of 0 is 22.

(c) −2(47) + 1(−39) + 0(22) = −133 = |A|.

7.  
 i j k 
 
 7 11 −2  = 5i − 19j − 87k
 
 6 −3 1 

8. not provided

Exercises 8.8

1. (a)
 
−2 −5 −7
adj (A) =  7 −4 3 
−18 −2 23
|A| = −43
adj (A)
A−1 =
|A|

(b)
 
2 7 1
adj (A) =  19 −21 −3 
15 −10 −5
|A| = 25
adj (A)
A−1 =
|A|

(c)
 
−16 7 −1
adj (A) =  32 −14 2 
16 −7 1
|A| = 0

No inverse exists.

Pearson
c Education Limited 2001
52 Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual

2.
 
71 52 55
adj (P ) =  52 64 50 
55 50 75
|P | = 230
adj (P )
P −1 =
|P |

Exercises 8.9
1. not provided

2. (a)
 
−1 1 2 −3
A = −
3 −5 6
        
x 1 2 −3 12 1 −3 1
= − =− =
y 3 −5 6 9 3 −6 2

(b)
 
1 3 −4
A−1 =
8 −1 4
    
x 1 3 −4 20
=
y 8 −1 4 11
 
1 16
=
8 24
 
2
=
3

(c)
 
1 2 1
A−1 =
7 −3 2
    
x 1 2 1 −4
=
y 7 −3 2 1
 
1 −7
=
7 14
 
−1
=
2

(d)
|A| = −40
 
−9 −2 7
 −10 20 −10 
2 −4 −6
A−1 =
−40

Pearson
c Education Limited 2001
Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual 53

    
x −9 −2 7 20
 y  = − 1  −10 20 −10   20 
40
z 2 −4 −6 20
 
2
= 0
4

   
x 1
(e)  y  =  2  using the same inverse as part (d).
z 3

   
x 0
(f)  y  =  0  using the same inverse as part (d).
z 0

Exercises 8.10
1. A variety of combinations of row operations are possible; we simply quote here the answers.
(a) x = 7, y = −6
(b) x = 3, y = −5, z = 2
(c) x = 1 − µ, y = 2µ, z = µ
(d) x = −3, y = 1, z = 4
(e) equations are inconsistent.
2. x = 2, y = 1, z = 4.
3. (a)
 
2/5 −1/5
−3/5 4/5

(b)
 
1/3 −1/3 1/3
 −4/15 13/15 −16/15 
1/5 −2/5 4/5

(c)
 
−3/8 1/4 −1/8
 −37/24 11/12 1/24 
11/24 −1/12 1/24

Exercises 8.11.1
not provided

Exercises 8.11.2
not provided

Pearson
c Education Limited 2001
54 Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual

Exercises 8.11.3
not provided
Exercises 8.13
(a) Jacobi’s method

1
x(n+1) = (−1 − y (n) − z (n) )
4
1
y (n+1) = (−2z (n) − x(n) )
6
1
z (n+1) = (1 − x(n) − 2y (n) )
4

With x(0) = y (0) = z (0) = 0 we obtain

x(1) = −0.25, y (1) = 0, z (1) = 0.25

x(2) = −0.3125, y (2) = −0.0417, z (2) = 0.3125
x(3) = −0.3177, y (3) = −0.0521, z (3) = 0.3490

Gauss–Seidel method

1
x(n+1) = (−1 − y (n) − z (n) )
4
1
y (n+1) = (−2z (n) − x(n+1) )
6
1
z (n+1) = (1 − x(n+1) − 2y (n+1) )
4

With x(0) = y (0) = z (0) = 0 we obtain

x(1) = −0.25, y (1) = 0.0417, z (1) = 0.2917

x(2) = −0.3333, y (2) = −0.0417, z (2) = 0.3542

x(3) = −0.3281, y (3) = −0.0634, z (3) = 0.3637

(b) Jacobi’s method

1
x(n+1) = (4 − y (n) + z (n) )
5
1
y (n+1) = − (−4 − z (n) − x(n) )
4
1
z (n+1) = − (−6 − 2x(n) − 2y (n) )
4

With x(0) = y (0) = z (0) = 0 we obtain

x(1) = 0.8000, y (1) = 1, z (1) = 1.5

Pearson
c Education Limited 2001
Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual 55

x(2) = 0.9000, y (2) = 1.5750, z (2) = 2.4000

x(3) = 0.9650, y (3) = 1.8250, z (3) = 2.7375

Gauss–Seidel method

1
x(n+1) = (4 − y (n) + z (n) )
5
1
y (n+1) = − (−4 − z (n) − x(n+1) )
4
1
z (n+1) = − (−6 − 2x(n+1) − 2y (n+1) )
4

With x(0) = y (0) = z (0) = 0 we obtain

x(1) = 0.8000, y (1) = 1.2000, z (1) = 2.5000

x(2) = 1.0600, y (2) = 1.8900, z (2) = 2.9750
x(3) = 1.0170, y (3) = 1.9980, z (3) = 3.0075

(c) Jacobi’s method

1
x(n+1) = (17 − y (n) − z (n) )
4
1
y (n+1) = (9 + z (n) − x(n) )
3
1
z (n+1) = (1 − 2x(n) + y (n) )
5
With x(0) = y (0) = z (0) = 0 we obtain

x(1) = 4.2500, y (1) = 3, z (1) = 0.2000

x(2) = 3.4500, y (2) = 1.6500, z (2) = −0.9000

x(3) = 4.0625, y (3) = 1.5500, z (3) = −0.8500

Gauss–Seidel method
1
x(n+1) = (17 − y (n) − z (n) )
4
1
y (n+1) = (9 + z (n) − x(n+1) )
3
1
z (n+1) = (1 − 2x(n+1) + y (n+1) )
5

With x(0) = y (0) = z (0) = 0 we obtain

x(1) = 4.2500, y (1) = 1.5833, z (1) = −1.1833

x(2) = 4.1500, y (2) = 1.2222, z (2) = −1.2156

x(3) = 4.2484, y (3) = 1.1787, z (3) = −1.2636

Pearson
c Education Limited 2001
56 Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual

Review Exercises 8
1. not provided
2. cosh2 θ − sinh2 θ = 1.
3. |A| = −6.
 
0 −3 0
adj(A) =  0 −3 6 
−2 2 −4

Hence
 
0 1/2 0
A−1 = 0 1/2 −1 
1/3 −1/3 2/3
 
7 −3 0
A2 =  0 4 6 
−2 2 3

It follows that A2 + 6A−1 − 7I = 0.

4. (a) |A| = −8.
(b)
 
0 −8 0
adj(A) =  0 −4 4 
−2 3 1

(c)

adj(A)
A−1 =
|A|

5. |A| = 21.
 
−7 6 −10
adj(A) =  −14 3 −5 
7 0 7

adj(A)
A−1 =
|A|
   
x 1
 y  =  −1 
z 2

6.  
1 2 −3 2 2
 2 5 −8 6 5 
3 4 −5 2 4

Pearson
c Education Limited 2001
Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual 57

R2 → R2 − 2R1 and R3 → R3 − 3R1 give

 
1 2 −3 2 2
 0 1 −2 2 1 
0 −2 4 −4 −2

R3 → 2R2 + R3 gives

 
1 2 −3 2 2
 0 1 −2 2 1 
0 0 0 0 0
so that z and w are free variables. Let z = λ and w = µ and thus y = 1 + 2λ − 2µ and x = 2µ − λ.

7. Writing

1
x(n+1) = (1 − y (n) )
10
1
y (n+1) = (2 − x(n) − z (n) )
10
1
z (n+1) = (1 − y (n) )
10

we find that an initial guess of x = y = z = 0 yields

0.1000, 0.2000, 0.1000
0.0800, 0.1800, 0.0800
0.0820, 0.1840, 0.0820
0.0816, 0.1836, 0.0816
0.0816, 0.1837, 0.0816
and so on. To 3dp x = 0.082, y = 0.184, z = 0.082.

8. |A| = −26.

 
−11 −7 1
adj(A) =  3 9 −5 
7 −5 −3

adj(A)
A−1 =
|A|

     
x 19/13 1.462
 y  =  −4/13  =  −0.3077 
z −5/13 −0.3846
9–14. not provided

Pearson
c Education Limited 2001
58 Croft,Davison and Hargreaves,Engineering Mathematics,Solutions Manual

15. a)  
 3−λ 2 
|A − λI| =  =0
−3 −4 − λ 
i.e.
λ2 + λ − 6 = 0
(b) Solving the quadratic gives λ = −3, 2.
 
1
(c) With λ = −3 the eigenvectors are multiples of . With λ = 2 the eigenvectors are multiples of
  −3
1
.
−0.5
 
1 1
(d) Take M = .
−3 −0.5
 
−1 −3 0
(e) It follows that M AM = .
0 2

Pearson
c Education Limited 2001