Zill Math CH08
Zill Math CH08
Exercises
8.1
2
6
3
0
1
3. 0
0
2
7
0
1
2
5
1. a
9
b
1
5
4. (5
5. 7 10
2 3
1 6
b and B a
b , find (a) AB,
5
4
3 2
(b) BA, (c) A2 AA, (d) B2 BB.
17. If A a
15)
1
4
4
6 3
18. If A 5 10 and B a
b,
1 3
2
8 12
find (a) AB, (b) BA.
1
5
6
0
6.
7
10
2
12
5 6
0
2 12
9
2 1
2
4
6
2. 8
1 2
6 3
0
b, B a
b , and C a
2
4
2 1
3
find (a) BC, (b) A(BC), (c) C(BA), (d) A(B C).
19. If A a
10. a
1
3
b , 3
6
5
2
5
"(2)2
2
1
8
1
5
"2
2
1
4 8. a
0
6
2 b ,a
8
b ,a
2
2
0.125
1.414
2
1
b ,a
1
2
0
b
1
1
y
12. a
x2
y
x
1
b ,a
3
3x 2 2
1
9
b ,a
5
4x
0.2
b
1
y22
b
3
1
b
5
2
3
1
2
4
1
2
1 , B 0
1
3
0
4
0
15. If A a
6
b
3
5
0
7
4 5
2
6
b and B a
b , find (a) A B,
6 9
8 10
4
5
b and B a
1
2
5 9
3
b and B a
4 6
7
T
(b) 2A B .
24. If A a
1
4
b, B a
0
1
CHAPTER 8 Matrices
1 2
2
b and B a
2 4
5
(b) 2AT BT, (c) AT (A B).
3
8
(b) BTAT.
3
6
4
1 , find (a) AB, (b) BA, (c) (BA)C,
1
22. If A a
23. If A a
2
1
14. A 2
2
1
2
3
7), B 4 ,
1
21. If A
In Problems 13 and 14, find the entries c23 and c12 for the matrix
C 2A 3B.
13. A a
1
and C 0
3
(d) (AB)C.
6
4
8 and B (2
10
(c) A BT.
1b
4
20. If A (5
3
b , find (a) A B T,
7
10
b , find (a) (AB)T,
5
11
b , find (a) AT B,
2
27. a
2
1
2
b,
4
2
1
3
1 5 1 2 2 4
1
3
5
3 2
1
ba b 2 a
4
5
2
6 7
ba b
3
2
1
28. 2
0
3
5
4
4
3
1
2
1 2 1 2 8
2
1
4
6
1
9
0
3
0
6 Aa
7
1
1
b
4
2 4
4 10
b and B a
b.
3 2
2
5
Verify the given property by computing the left and right members of the given equality.
31. (AT)T A
33. (AB)T BTAT
35.
36.
37.
38.
32. (A B)T AT BT
34. (6A)T 6AT
2 1
Suppose A 6 3 . Verify that the matrix B AAT is
2 5
symmetric.
Show that if A is an m n matrix, then AAT is symmetric.
In matrix theory, many of the familiar properties of the real
number system are not valid. If a and b are real numbers, then
ab 0 implies that a 0 or b 0. Find two matrices such
that AB 0 but A 0 and B 0.
If a, b, and c are real numbers and c 0, then ac bc implies
a b. For matrices, AC BC, C 0, does not necessarily
imply A B. Verify this for
2
A 3
1
and
1
2
3
4
5
1 , B 9
2
1
0
C 2
0
0
3
0
1
2
3
6
3 ,
7
0
4 .
0
43. Verify that the quadratic form ax2 bxy cy2 is the same
as
a
b
2
(xy) a 1
1
2b
x
b a b.
y
be written
curl F
0
0/0x
0/0y
0/0x
0
0/0x
0/0x
P
0/0x Q .
0
R
(Readers who are not familiar with the concept of the curl of
a vector field should see Section 9.7.)
45. As shown in FIGURE 8.1.1(a), a spacecraft can perform rotations called pitch, roll, and yaw about three distinct axes. To
describe the coordinates of a point P we use two coordinate
systems: a fixed three-dimensional Cartesian coordinate system in which the coordinates of P are (x, y, z) and a spacecraft
coordinate system that moves with the particular rotation. In
Figure 8.1.1(b) we have illustrated a yawthat is, a rotation around the z-axis (which is perpendicular to the plane of
the paper). The coordinates (xY, yY, zY) of the point P in the
spacecraft system after the yaw are related to the coordinates
(x, y, z) of P in the fixed coordinate system by the equations
xY x cos g y sin g
yY x sin g y cos g
zY z
where g is the angle of rotation.
(a) Verify that the foregoing system of equations can be written as the matrix equation
xY
x
yY MY y
zY
z
where
cos g
M Y sin g
0
sin g
cos g
0
0
0.
1
363
yaw
roll
x
3
4
0
7
3 2 1
2 4
1
A 1 6
3 1 5 ,B 4
2 1
0 4
6 2 3
2
5
can be written
pitch
A a
y
P(x, y, z) or P(xY, yY, zY)
xY
(b)
364
y
(a)
yY
CHAPTER 8 Matrices
A11
A21
A12
B
b ,B a 1 b ,
A22
B2
8.2
Exercises
15.
16.
17.
18.
19.
20.
x1 x2 x3 3
x1 x2 x3 1
3x1 x2 x3 5
x1 x2 2x3 1
3x1 2x2 x3 7
2x1 3x2 x3 8
x1
x3 x4 1
2x2 x3 x4 3
x1 x2
x4 1
x1 x2 x3 x4 2
2x1 x2 x3
3
3x1 x2 x3 x4 4
x1 2x2 2x3 3x4 3
4x1 5x2 2x3 x4 16
x2 x3 x4 4
x1 3x2 5x3 x4 1
x1 2x2 5x3 4x4 2
x1 4x2 6x3 2x4 6
x1 2x2
x4 0
4x1 9x2 x3 12x4 0
3x1 9x2 6x3 21x4 0
x1 3x2 x3 9x4 0
375
10 V
+
i1
27 V
+
1
0
34.
0
0
0
0
1
0
35. 1
0
1
0
0
0
0 A
1
1
37. 0
0
0
1
c
0
0 A
1
1
0
0
0
1
0 0
1
0
0
1
c
0
1
0
0
0
0
1
0
1
0
0
1
38. 1
i2
i3
1
33. 0
0
1
36. 0
0
0
1
c
0
1
0
0
0 A
c
0
0 A
1
52 V +
i2
i3
376
1
0
0
0
0
1
1
32. 0
0
1
0
0
0
c
CHAPTER 8 Matrices
8.3
Exercises
3 1
b
1
3
2. a
2 1 3
6 3 9
1 12 32
4. 1
3.
380
2 2
b
0
0
1 1 2
2 4
1 0 3
CHAPTER 8 Matrices
1 1 1
0 4
1 4 1
3 1 2 0
b
6
2 4 5
5. 1
6. a
1 2
3 6
7.
7 1
4
5
1 2 3 4
1
4 6 8
8.
0
1 0 0
2
5 6 8
0
4
9.
2
6
2 4 2 2
1 0 5 1
1 23
3 13
6 6 12 0
1 2 1 8 1
0
0 1 3 1
10. 0
0 1 3 1
0
0 0 0
0
1 2 1 8 1
vectors
1 1 6
1 1 5
2 10 8
1 1 3
1 2 6
Discussion Problems
18. Suppose the system AX B is consistent and A is a 6 3
4
1
1
3
2
1
,
v1 ,v2 ,v3
2
2
1
1
1
1
2
1
3
7
v4 ,v5
4
5
1
1
is linearly dependent or linearly independent. By Definition
7.6.3, if
c1v1 c2v2 c3v3 c4v4 c5v5 0
(4)
5.
8.4 Determinants
381
8.4
Exercises
2
4
0
2 2
3
.
1
0 1
1
1
2
CHAPTER 8 Matrices
13. a
1
4
3 5
b
1 4
12l
2
12. a 1
3
3
b
22l
14. a
1
2
b
43
3 2 l
2
4
b
52l
15. 3
0 0
3 0
0
0 2
16. 0
1 1 1
2 2
1
1
9
3 0 2
7 1
2 6 4
18. 2
4 5 3
19. 1 2 3
1 2 3
1
4
13
1
2
17. 2
2 1 4
6 1
3
4 8
20.
6 0
8 0
9 0
3
5 1
2 5
7 4 10
21. 3
22. 1
1 1 1
23. x y z
2 3 4
1
1
1
24. x
y
z
2x 3y 4z
1
1 3 0
1
5
3 2
25.
1 2
1 0
4
8
0 0
2
1 2 1
0
5
0 4
26.
1
6
1 0
5 1
1 1
3 2 0
1 1
2 2 0
0 2
0
1
4
2
3
1
1
6
0
5
27. 0
0
2 1
1 28. 1
0
2 1 1
0
0
0
4
3
2
0
1 2
3
0
0
0
0
2
0
1
0
0
1
In Problems 29 and 30, find the values of l that satisfy the given
equation.
12l
0
1
3 2 l
10
29. 2
2 0 30. 3 1
2 2 l 1 3 0
2
52l
3
3
l
387
8.5
Exercises
5
6
1
6
3. 2
22
2
2 8
6 8
1 2
3
1 2
1
5. 3 4 2
18 3 6 3 2 1
33
5 9 12
5 9 4
1 2
3
4 2
18
18 3 3 5 9 12 3
5 9 12
1 2
3
5
1
2
6
0
6
0
8
4 0
0 9
0
4
8.
3
2
1
32
6
33 0
5 8 4
0
2
0
0
0
0
3
0
0
0 0
0
0 0
4 4
0
0 3
4
4 0
a1
b1
c1 2 a1
and
2
1 5
B 4
3 8 .
0 1 0
2a1 a2 a3
12. B 6b1 3b2 3b3
2c1 c2 c3
a2
b2
c2 2 a2
a a1 a2
A b b 1 b 2 .
c c1 c2
24. Consider the matrix
a3
b3
c3 2 a3
a1 b1 c1
14. D a2 b2 c2
a3 b3 c3
392
In Problems 19 and 20, verify that det A det AT for the given
matrix A.
1 2
1
2 3
4
19. A 4 1 1
20. A 1 0
5
1 2 1
7 2 1
21. Consider the matrices
1
0
4
0
0
a1 a2 a3
3 b1 b2 b3 3 5.
c1 c2 c3
13. C
0 7
0
18. D 4 0
0
0 0 2
0
2
0
0
a3 a2 a1
11. A b3 b2 b1
c3 c2 c1
0 0 a13
16. B 0 a22 a23
a31 a32 a33
2 1
1
A 3
1 1
0
2
2
1 2 3
1 4 7
9. 3 4 5 6 3 3 2 5 8 3
7 8 9
3 6 9
1
0
10. 4
0
0
6 1
8 10
2
0 3
7
2
15. A
0 0 4
9
0 0
0 5
5 0 0
17. C 0 7 0
0 0 3
6. 3 4 2
0
2
7. 4
0
0
1 5
3 6
0 1 1
2 4
25. 4
26. 4 2
1
2
3
4 5 2
9 9
6
28.
27.
CHAPTER 8 Matrices
5
0
8 7 2
2
2 6
5
0
1
1 2
2
1 2
2 1
2
1 2 3
29.
3
4 8 1
3 11 12 2
0
2
30.
1
3
1
5
2
1
4
0
2
3
5
1
0
2
1
1
31.
2
1
2
1
32.
0
3
9
3
1
1
1
7
6
4
8
4
5
2
2
3
3
5
3 4
5 7
6 7
8 20
1 1 1
3 a b c 3 (b a)(c a)(c b).
a2 b 2 c 2
1
a
34. Evaluate 4 2
a
a3
1
b
b2
b3
1 1
c d
4 . [Hint: See Problem 33.]
c2 d 2
c3 d 3
1 2
2 1
4 2 1
35. A 1
3 0
36. A 2 3 1
2 2 3
3 4
7
4
b and B a
b . Verify that
1
2
1 5
det(A B) det A det B.
38. Suppose A is a 5 5 matrix for which det A 7. What is
the value of det(2A)?
39. An n n matrix A is said to be skew-symmetric if AT A.
If A is a 5 5 skew-symmetric matrix, show that det A 0.
40. It takes about n! multiplications to evaluate the determinant
of an n n matrix using expansion by cofactors, whereas it
takes about n3/3 arithmetic operations using the row-reduction
method. Compare the number of operations for both methods
using a 25 25 matrix.
37. Let A a
393
8.6
8.6.1
Exercises
0
4
0 1
1
0 1 1
4.
6.
8.
10.
12.
1
a
b
4
3
2p p
a
b
p
p
2 3 0
0 11 14
1 4 7
2 1
5
3
0 2
1
4
0
0 2 0
0 0 1
8 0 0
1
3
1
0
14.
3
1
2
0
1
1
1
3
2
1
1
0
0
0
8 0
b
0 12
2 3
18. a
b
2
4
16. a
1 2 3
19. 4 5 6
7 8 9
4
2 3
21. 2
1 0
1 2 0
1
3 0
23. 1 2 1
0
1 2
1 2
3
1 0
2
25.
2 1 3
1 1
2
20.
22.
24.
1
1
0
1
26.
1
0
2
2
4
8
1
0
0
1
0
0
0
0 1
2
1
1
3
4 2
2 2
10 6
2 3
1 4
0 8
0 0 0
0 1 0
0 0 1
1 0 0
1
2
12
52
3 b,B
2
1
a
2
3
13
4
3
5b
2
1
3 15
1 1
0
0 1
5 , B 1 2 0
0
1 2
11
1 1 2
4
3
If A1 a
b , what is A?
3 2
If A is nonsingular, then (AT)1 (A1)T. Verify this for
1 4
A a
b.
2 10
4 3
Find a value of x such that the matrix A a
b is its
x 4
own inverse.
sin u cos u
Find the inverse of A a
b.
cos u sin u
A nonsingular matrix A is said to be orthogonal if A1 AT.
(a) Verify that the matrix in Problem 32 is orthogonal.
28. A1
29.
30.
31.
32.
33.
0 2> "6
1> "3
1> "2
1> "6 is an
(b) Verify that A 1> "3
1> "3 1> "2
1> "6
orthogonal matrix.
34. Show that if A is an orthogonal matrix (see Problem 33), then
det A 1.
8.6 Inverse of a Matrix
401
8.6.2
CHAPTER 8 Matrices
57. The system of equations for the currents i1, i2, and i3 in the
network shown in FIGURE 8.6.1 is
i1 i2 i3 0
R1i1 R2i2
E2 E1
R2i2 R3i3 E3 E2
where Rk and Ek, k 1, 2, 3, are constants.
(a) Express the system as a matrix equation AX B.
(b) Show that the coefficient matrix A is nonsingular.
(c) Use X A1B to solve for the currents.
E1
E3
E2
i1
i2
i3
R1
R2
R3
u2 u4 100 100
4
u2
200 u3 u1 100
4
u3
200 100 u4 u2
4
u3 100 100 u1
.
4
(a) Show that the above system can be written as the matrix
equation
u4
4
1
0
1
u1
200
1 4
1
0
u
300
2
.
0
1 4
1
u3
300
1
0
1 4
u4
200
(b) Solve the system in part (a) by finding the inverse of the
coefficient matrix.
u = 200
u = 100
P2
P3
P1
P4
u = 100
u = 100
8.7
Exercises
T2
15
25
300 lb
kx2 4
400 lb
kx1 (3 k)x2 3.
For what value(s) of k is the system inconsistent?
F
x1 x 2 1
0.5 N
30
60
x1 ex2 2.
FIGURE 8.7.2 Inclined plane in Problem 14
r1
E2
r2
r1E2 r2E1
.
r1R r2R r1r2
405
8.8
Exercises
2
2
K2 a
3. A a
2
b
5
1
1
b;K 1 a
b,
2
2 2 "2
2 "2
"2
b ,K 3 a
b
2
"2
6
2
3
3
b ;K 1 a b ,
1
2
1
5
K 2 a b ,K 3 a b
0
10
412
CHAPTER 8 Matrices
2
8
0
b ;K 1 a b ,
1 2
0
2 2i
2 2i
b ,K 3 a
b
K2 a
1
1
1 2
2
0
5. A 2
1 2 ;K 1 1 ,
2
2
1
1
4
1
K 2 4 ,K 3 1
0
1
1 1
0
1
6. A 1 2
1 ;K 1 4 ,
0 3 1
3
1
3
K 2 4 ,K 3 1
3
4
4. A a
7. a
9.
11.
13.
15.
17.
19.
21.
8. a
2
2
1
10. a 1
4
12.
14.
16.
18.
20.
22.
1
a
1
7
a
0
3
0
4
1
0
0
2
5
0
0
0
0
1
b
1
1
b
1
1
b
1
0
b
13
0 0
2 0
0 1
6 0
2 1
1 2
1 0
2 4
1 2
0 0
0 0
0 1
its entries are nonnegative and the sum of the entries in each
row (or the sum of the entries in each column) add up to 1.
Stochastic matrices are important in probability theory.
(a) Verify that
2
3
0
1
2
5
1
26. A 1
4
2
0
4
1
1
5
For Discussion
27. Review the definitions of upper triangular, lower triangular,
A a
and
p
q
12p
b,0 # p # 1, 0 # q # 1,
12q
A
1
2
13
1
6
1
4
1
3
1
3
1
4
1
3
1
2
413
Exercises
8.9
11. A a
1 3
b ;m 3 4. A
2 4
8 5
a
b ;m 5
6. A
4 0
1 1 1
0 1 2 ;m 10
0 1 0
0
1 1
0 1 1 ;m 6
1
1 0
2 2 0
4 0 0 ;m 10
1 2 1
0 12
0
1
1
0 ;m 8
2
2 12 2
3. A a
5. A
7. A
8. A
9. A
10. A
5 3
b ;m 4
3
5
1
2
a
b ;m 6
0 3
2
2 1
2
1 2 ;m 5
3 6
0
13. Show that l 0 is an eigenvalue of each matrix. In this
case, the coefficient c0 in the characteristic equation (1) is 0.
Compute Am in each case. In parts (a) and (b), explain why
we do not have to solve any system for the coefficients ci in
determining Am.
12. A
(a) A a
1 1
b
3 3
(b) A a
1 1
b
1 1
2 1
1
(c) A 1 0 2
1 1
3
14. In his work Liber Abbaci, published in 1202, Leonardo Fibonacci
of Pisa, Italy, speculated on the reproduction of rabbits:
7 3
b;m 6
3 1
CHAPTER 8 Matrices
How many pairs of rabbits will be produced in a year beginning with a single pair, if every month each pair bears a new
pair which become productive from the second month on?
The answer to his question is contained in a sequence known
as a Fibonacci sequence.
Adult pairs
Baby pairs
Total pairs
1
0
1
1
1
2
2
1
3
3
2
5
5 8 13 21 . . .
3 5 8 13 . . .
8 13 21 34 . . .
8 9 10 11 12
lm2
l2
l2lm1
l2
(1 "5)m 1 2 (1 2 "5)m 1
m
m
2m 1 "5 2(1 "5) 2 2(1 2 "5)
1
2
2
2
2
lm1
l1
l1lm2
l1
(f )
0 1 0 1
3 1 0 0
1 0 0 0
2 2 1 0
18. (a) Explain why any nilpotent matrix A is singular. [Hint:
Review Section 8.5.] (b) Show that all the eigenvalues of a
nilpotent matrix A are 0. [Hint: Use (1) of Section 8.8.]
417
8.10
Exercises
1 1 1
2
0
1
2. 1
1 1 ; 1 , 1 , 1
1 1
1
1
1
1
0
0 4
0
4
1
0 4
0 ; 1 , 0 , 0
4
0 15
0
1
4
8.10 Orthogonal Matrices
423
5 13
0
5
0;
0 0 8
"2
"3
"6
2
3
6
"2
"3
"6
,
,
2
3
6
0
"3
"6
3
3
3 2 2
2
1
2
4. 2 2 0 ; 2 , 2 , 1
2 0 4
1
2
2
3. 13
1 0 0
0
1
2
0
8
0 15
0
17
17
In Problems 1118, proceed as in Example 3 to construct an
orthogonal matrix from the eigenvectors of the given symmetric
matrix. (The answers are not unique.)
1 9
b
9 1
1 3
13. a
b
3 9
1 0 1
15. 0 1 0
1 0 1
8 5 4
17. 5 3 1
4 1 0
11. a
424
7
0
1
14. a
1
0
16. 1
1
0
b
4
1
b
0
1 1
1 1
1 0
2
8 2
18. 8 4
10
2
10 7
12. a
CHAPTER 8 Matrices
19. a 4
5
a
b
b
20. a
1> "5
a
b
b
1> "5
2 2
1
0 2 ;K 1 1 ,
2 0
0
1
1
K 2 0 ,K 3 1
1
1
1 1 1 1
1
1 1 1 1
0
22. A
;K 1
,
1 1 1 1
0
1 1 1 1
1
1
1
1
0
1
1
K2
,K 3
,K 4
1
0
1
0
0
1
23. In Example 4, use the equation k1 14 k2 14 k3 and choose
two different sets of values for k2 and k3 so that the corresponding eigenvectors K1 and K2 are orthogonal.
24. Construct an orthogonal matrix from the eigenvectors of
1
2
A
0
0
2
1
0
0
0
0
1
2
0
0
.
2
1
AB is orthogonal.
8.11
Exercises
1
b
0
7
2. a
8
2
b
1
CHAPTER 8 Matrices
In Problems 36, use the power method with scaling to find the
dominant eigenvalue and a corresponding eigenvector of the
given matrix.
3. a
2
3
5
5. 4
2
4
b
13
4
5
2
4. a
2
2
2
1
2
3
6. 0
0
2
b
7
1
1
0
1
1
2
In Problems 710, use the method of deflation to find the eigenvalues of the given matrix.
7. a
3
2
2
b
6
8. a
3 1
0
2 1
0 1
3
9. 1
1
3
10.
3
b
9
0
0 4
0 4
0
4
0 15
In Problems 11 and 12, use the inverse power method to find the
eigenvalue of least magnitude for the given matrix.
1 1
0.2
0.3
b
12. a
b
3 4
0.4 0.1
13. In Example 4 of Section 3.9 we saw that the deflection curve
of a thin column under an applied load P was defined by the
boundary-value problem
d 2y
EI 2 Py 0, y(0) 0, y(L) 0.
dx
In this problem we show how to apply matrix techniques to
compute the smallest critical load.
Let the interval [0, L] be divided into n subintervals of length
h L/n, and let xi ih, i 0, 1, . . . , n. For small values of h
it follows from (6) of Section 6.5 that
11. a
yi 1 2 2yi yi2 1
d 2y
<
,
dx 2
h2
where yi y(xi).
(a) Show that the differential equation can be replaced by the
difference equation
EI( yi1 2yi yi1) Ph2yi 0, i 1, 2, . . . , n 1.
(b) Show that for n 4 the difference equation in part (a)
yields the system of linear equations
2
1
0
1
2
1
0
y1
y1
PL2
1 y2
y2 .
16EI
2
y3
y3
Note that this system has the form of the eigenvalue problem AY lY, where l PL2 /16EI.
(c) Find A1.
(d) Use the inverse power method to find, to two decimal
places, the eigenvalue of A of least magnitude.
(e) Use the result of part (d) to compute the approximate
smallest critical load. Compare your answer with that
given in Section 3.9.
14. Suppose the column in Problem 13 is tapered so that the
moment of inertia of a cross-section I varies linearly from
I(0) I0 0.002 to I(L) IL 0.001.
(a) Use the difference equation in part (a) of Problem 13 with
n 4 to set up a system of equations analogous to that
given in part (b).
(b) Proceed as in Problem 13 to find an approximation to the
smallest critical load.
2
3
1
0
1
1
8.12 Diagonalization
431
8.12
Exercises
1
2
7. a 1
6
438
1
6
1b
2
4 5
b
8 10
0 5
4. a
b
1 0
5 3
6. a
b
5 11
2. a
8. a
2 1
b
1 4
CHAPTER 8 Matrices
0
1
1
11. 0
0
1
13. 0
1
1
15. 0
0
9. a
1
b
0
0 1
1 3
0 2
1 1
1 0
1 1
3 1
2
4
0
1
1 2
b
12 1
1 2
2
12. 2 3 2
5 3
8
0 9 0
14. 1
0 0
0
0 1
1 1 0
16. 0 2 0
0 0 3
10. a
2 0
1 0
0
0 1
17. 2
0 0
1
0 3
0 1
3
18. 1
1
K1 a b
2
8 10
7 9
0
2
0
0
19.
9 9
8 9
1
1 1
2
4
0
20.
1
0
1
1
1
K1 1 , K2 0 , and K3 2 .
1
1
1
37. If A is an n n diagonalizable matrix, then D P1AP, where
23. a
5
"10
"10
b
8
22. a
3 2
b
2 0
24. a
1 2
b
2
1
0 1 0
25. 1 0 0
0 0 1
1 2
2
26. 2
1 2
2 2
1
5 2
0
27. 2
6 2
0 2
7
3 0 1
28. 0 1 0
1 0 1
1
29. 0
7
0
1
30.
0
1
0
1
0
7
0
1
1
K2 a b .
1
2 1 4
2
0 0
3
2 1
0
0 2
21. a
and
is
a11
0
D
(
0
0
a22
p
p
a m11
0
Dm
(
0
0
a m22
p
p
0
0
(
ann
0
0
.
(
a mnn
0
1
0
1
1
0
1
0
2
0
0
0
0
3
0
0
0
0
1
0
0 4
0
.
0
5
1
2
1
b , A5
0
8.13 LU-Factorization
40. A a
6
3
10
b , A10
5
439
8.13
Exercises
2
1
4
5. 4
12
2
b
2
2
1
1
2. a
6
4
1
2
3
2
b
1
3. a
1
2
3
6. 9
3
4
b
2
2
3
1
4. a
5
15
1
2
1
4
b
2
1
7. 2
7
1
9. 0
2
2
5
6
2
1
6
7
6
4
1
2
1
8.13 LU-Factorization
8.
4
4
6
1
10. 1
1
2
1
6
0
9
0
10
4
8
1
1
1
445
3
9
b
1 11
4 2
13. a
b
1 3
11. a
12. a
1
1
1
15. 3
1
4
17. 2
12
1
2
19.
1
5
1
2
1
2
12
26 4
4
56
2
1
3 2
2
4
1 1
10
b
4
0.3
b
3.5
1
2 4
2 5
10
3
1
6
16 4 20
18. 4 5
3
20 3 29
1 1
3
2
3 5
19
3
20.
2 2
3
10
1
5 5 2
16.
0
1
3
1
2
1
23. a
1
2
2 x1
1
ba b a b
2 x2
2
22. a
6
4
4 x1
15
ba b a b
2 x2
5
24. a
5
15
4
25. 4
12
2
1
1
3
26. 9
3
2
3
1
1
27. 2
7
4
28. 4
6
446
2 x1
12
ba b a b
1 x2
2
4 x1
1
ba b a b
2 x2
7
1
x1
7
2 x2 7
3
x3
28
1
x1
15
2 x2 3
1
x3
24
7
x1
109
6 x2 109
4
x3
218
2
5
6
2
1
6
10
x1
20
4 x2 14
8
x3
18
CHAPTER 8 Matrices
1
29. 0
2
1
30. 1
2
1
6
1
x1
14
2 x2 42
1
x3
7
1
x1
18
1 x2 27
1
x3
12
0
9
0
1
2
2
1
1
2 1
3
1
0
1
1
0
1
0 0
1
0
1
1
0
1
1
1
33. B 3
1
2
4
32. B 2 7
10
30
34. B 4 42
18
8.14
Exercises
3
1
5
b ; THE MONEY IS HERE
2
3
2
5
b ; PHONE HOME
3
1
4. A 1
0
2
1
1
2
5. A 1
1
5
6. A 4
5
3
2 ; MADAME X HAS THE PLANS
2
1
1
1
3
3
2
1
1 ; GO NORTH ON MAIN ST
0
0
1 ; DR JOHN IS THE SPY
2
B a
2 1
b;
1 1
46 7 13 22 18
1 10
b
23 15 14 2 18 12 5
1 0 1
9. A 0 1 0 ;
1 0 0
31 21 21 22 20 9
B 19 0 9 13 16 15
13 1 20 8 0 9
2 1
message by a 2 2 matrix:
17 16 18
5 34 0 34 20
9 5 25
b
30 31 32 10 59 0 54 35 13 6 50
Decode the message if its first two letters are DA and its last
two letters are AY.
12. (a) Using the correspondence
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
j k l n m s t u w x g h i o p q r v y z a b c d e f space
1
0
1
0
1.
1
10. A 0 0 1 ;
1 1
36 32
28 61
26
56 10 12
B 9 2 18 1 18 25 0 0
23 27
23 41
26
43 5 12
8.14 Cryptography
449
8.15
Exercises
In Problems 16, encode the given word using the parity check
code.
1. (0 1 1)
2. (1 1 1)
3. (0 0 0 1)
4. (1 0 1 0)
5. (1 0 1 0 1 0 0)
6. (0 1 1 0 1 0 1)
20. (1 1 0 0 0 0 0)
21. (1 1 0 1 1 0 1)
22. (0 1 0 1 0 1 0)
23. (1 1 1 1 1 1 1)
24. (1 1 0 0 1 1 0)
25. (0 1 1 1 0 0 1)
26. (1 0 0 1 0 0 1)
27. (1 0 1 1 0 1 1)
28. (0 0 1 0 0 1 1)
CHAPTER 8 Matrices
entries.
(b) How many 7-tuple code words are there in the Hamming
(7, 4) code?
(c) List all code words in the Hamming (7, 4) code.
W (w1 w2 w3 w4)
of length four is transformed into a code word of length
eight:
C (c1 c2 c3 w1 c4 w2 w3 w4),
where the parity check equations are
c4 w2 w3 w4 0
c3 w 1 w 3 w 4 0
c2 w 1 w 2 w 4 0
c1 c2 c3 w1 c4 w2 w3 w4 0.
455
8.16
Exercises
In Problems 16, find the least squares line for the given data.
1. (2, 1), (3, 2), (4, 3), (5, 2)
2. (0, 1), (1, 3), (2, 5), (3, 7)
3. (1, 1), (2, 1.5), (3, 3), (4, 4.5), (5, 5)
457
20
40
60
80
100
120
400
450
500
550
600
650
220
200
180
170
150
135
0.47
0.90
2.0
3.7
7.5
15
458
CHAPTER 8 Matrices
8.17
Exercises
0.2/day
90
2
60
but the small shrubs can take over an area only if preceded
by the grasses. In FIGURE 8.17.8, the transfer coefficient of 0.3
indicates that, by the end of the summer, 30% of the prior bare
space in the field becomes occupied by grasses.
(a) Find the transfer matrix T.
10
(b) Suppose X 0 and that area is measured in acres.
0
Use the recursion formula Xn1 TXn, along with a
calculator or a CAS, to determine the ground cover in
each of the next 6 years.
0.4/day
1
Bare Space
0.3/day
100
0.2/year
Small
Shrubs
Discussion Problem
in part (c) of Problems 13 in terms
5. Characterize the vector X
3
150
100
2
Grasses
0.15/year
(death)
0.2/day
0.05/year
(death)
200
0.5/day
0.3/year
0
0.5/day
0.06/hr
(respiration)
0.4/day
0.5/day
3
0
1
Phytoplankton
0.06/hr
(grazing)
0.02/hr
(uptake of dissolved tracer)
0.01/hr
2
3
Water
Zooplankton
0.05/hr
(excretion)
461
Chapter in Review
1 2
b , then A1 _____.
3 4
If A and B are n n nonsingular matrices, then A B
is necessarily nonsingular. _____
If A is a nonsingular matrix for which AB AC, then B C.
_____
If A is a 3 3 matrix such that det A 5, then det( 12 A)
_____ and det(AT) _____.
If det A 6 and det B 2, then det AB1 _____.
If A and B are n n matrices whose corresponding entries
in the third column are the same, then det(A B) _____.
Suppose A is a 3 3 matrix such that det A 2. If B 10A
and C B1, then det C _____.
Let A be an n n matrix. The eigenvalues of A are the nonzero
solutions of det(A lI) 0. _____
A nonzero scalar multiple of an eigenvector is also an eigenvector corresponding to the same eigenvalue. _____
An n 1 column vector K with all zero entries is never an
eigenvector of an n n matrix A. _____
Let A be an n n matrix with real entries. If l is a complex
eigenvalue, then l is also an eigenvalue of A. _____
An n n matrix A always possesses n linearly independent
eigenvectors.
4. If A a
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
1 1 1 2
16. The augmented matrix 0 1 0 3 3 is in reduced rowechelon form. _____
0 0 0 0
17. If a 3 3 matrix A is diagonalizable, then it possesses three
_____
1 1
b is orthogonal.
1
1
CHAPTER 8 Matrices
0 1
0 i
1
0
bsy a
bsz a
b
1 0
i
0
0 1
(b) The matrix C AB BA is said to be the commutator of the n n matrices A and B. Find the commutators of sx and sy, sy and sz, and sz and sx.
In Problems 25 and 26, solve the given system of equations by
GaussJordan elimination.
5 1 1
9
25. 2
4 0 X 27 26. x1 x2 x3 6
1
1 5
9
x1 2x2 3x3 2
2x1
3x3 3
1 1 1
1 1 1
4 0.
27. Without expanding, show that 4
a b c
bc ac ab
y x2
2 1
28. Show that 4
3 4
5 9
x
1
2
3
1
1
4 0 is the equation of a parabola
1
1
passing through the three points (1, 2), (2, 3), and (3, 5).
In Problems 29 and 30, evaluate the determinant of the given
matrix by inspection.
4
0 0
0 0 0
0 2 0
0 0 0
0
0 3
0 0 0
29.
0
0 0 1 0 0
0
0 0
0 2 0
0
0 0
0 0 5
3
4
30.
1
6
0
6
3
4
0
0
9
2
0
0
0
1
i1
E
i2
i3
i4
R1
R2
R3
"2
"3
1
X x cos u y sin u
Y x sin u y cos u
for x and y.
38. (a) Set up the system of equations for the currents in the
branches of the network given in FIGURE 8.R.1.
"3
1
"2
"3
1 0 2
0 0
0 .
2 0
4
(a) Find matrices P and P1 that orthogonally diagonalize
the matrix A.
(b) Find the diagonal matrix D by actually carrying out the
multiplication P1AP.
49. Identify the conic section x2 3xy y2 1.
50. Consider the following population data:
Year
(b) Use Cramers rule to show that
i1 E a
1
1
1
b.
R1
R2
R3
2x1 3x2 x3 6
x1 2x2
3
2x1
x3 9
by writing it as a matrix equation and finding the inverse of the
coefficient matrix.
40. Use the inverse of the matrix A to solve the system AX B,
where
1 2 3
A 2 3 0
0 1 2
1
2
and the vector B is given by (a) 1 (b) 1 .
1
3
In Problems 4146, find the eigenvalues and corresponding
eigenvectors of the given matrix.
1 2
0 0
41. a
b
42. a
b
4 3
4 0
3 2 4
7 2 0
43. 2 0 2
44. 2
6 2
4 2 3
0
2 5
2
2 3
45. 2
1 6
1 2
0
0 0 0
46. 0 0 1
2 2 1
76
92
106
123
0
1 0
In Problems 53 and 54, use the matrix A 1
1 1
1 1 2
to decode the given message. Use the correspondence (1) in
Section 8.14.
19 0 15 14 0 20
53. B 35 10 27 53 1 54
5 15 3 48 2 39
5 2 21
54. B 27 17 40
21 13 2
55. Decode the following messages using the parity check code.
(a) (1 1 0 0 1 1)
(b) (0 1 1 0 1 1 1 0)
56. Encode the word (1 0 0 1) using the Hamming (7, 4) code.
In Problems 57 and 58, solve the given system of equations
using LU-Factorization.
57. The system in Problem 26
58. The system in Problem 36
CHAPTER 8 in Review
463