Solutions Manual Introduction To Linear
Solutions Manual Introduction To Linear
https://buklibry.com/download/solutions-manual-introduction-to-linear-algebra-4th-edition-by-strang-gilbert/
INTRODUCTION
TO
LINEAR
ALGEBRA
Fourth Edition
MANUAL FOR INSTRUCTORS
Gilbert Strang
Massachusetts Institute of Technology
math.mit.edu/linearalgebra
web.mit.edu/18.06
video lectures: ocw.mit.edu
math.mit.edu/gs
www.wellesleycambridge.com
email: [email protected]
2 Solutions to Exercises
50 Solutions to Exercises
" # " # " # " #" #
1 0 0 1 0 0 1 2 4
23 You can see why q 1 D 0 , q 2 D 0 , q 3 D 1 . A D 0 0 1 0 3 6 D
0 1 0 0 1 0 0 0 5
QR.
24 (a) One basis for the subspace S of solutions to x1 C x2 C x3 x4 D 0 is v1 D
.1; 1; 0; 0/, v2 D .1; 0; 1; 0/, v3 D .1; 0; 0; 1/ (b) Since S contains solutions to
.1; 1; 1; 1/T x D 0, a basis for S ? is .1; 1; 1; 1/ (c) Split .1; 1; 1; 1/ D b1 C b2
by projection on S ? and S : b2 D . 12 ; 12 ; 12 ; 12 / and b1 D . 12 ; 12 ; 12 ; 23 /.
25 This question
shows 2 by 2 formulas
QR; breakdown R22 D
for 0 when A is sin-
2 1 1 2 1 1 5 3 1 1 1 1 1
gular. D p p . Singular D p
1 1 5 1 2 5 0 1 1 1 2 1 1
1 2 2
p . The Gram-Schmidt process breaks down when ad bc D 0.
2 0 0
T
26 .q T2 C /q 2 D BT c B because q 2 D B and the extra q 1 in C is orthogonal to q 2 .
B B kB k
27 When a and b are not orthogonal, the projections onto these lines do not add to the pro-
jection onto the plane of a and b. We must use the orthogonal A and B (or orthonormal
q 1 and q 2 ) to be allowed to add 1D projections.
28 There are mn multiplications in (11) and 12 m2 n multiplications in each part of (12).
1
29 q 1 D 3
.2; 2; 1/, q 2 D 13 .2; 1; 2/, q 3 D 13 .1; 2; 2/.
1
30 The columns of the wavelet matrix W are orthonormal. Then W D W T . See
Section 7.2 for more about wavelets : a useful orthonormal basis with many zeros.
31 (a) c D 21 normalizes all the orthogonal columns to have unit length (b) The pro-
jection .aT b=aT a/a of b D .1; 1; 1; 1/ onto the first column is p1 D 12 . 1; 1; 1; 1/.
(Check e D 0.) To project onto the plane, add p2 D 21 .1; 1; 1; 1/ to get .0; 0; 1; 1/.
" #
1 0 0
1 0
32 Q1 D reflects across x axis, Q2 D 0 0 1 across plane y C z D 0.
0 1
0 1 0
33 Orthogonal and lower triangular ) ˙1 on the main diagonal and zeros elsewhere.
34 (a) Qu D .I 2uuT /u D u 2uuT u. This is u, provided that uT u equals 1
(b) Qv D .I 2uuT /v D u 2uuT v D u, provided that uT v D 0.
35 Starting from A D .1; 1; 0; 0/, the orthogonal (not orthonormal) vectors B D
.1; 1; 2; 0/ and C D .1; 1; 1; 3/ and D D .1; 1; 1; 1/ are in the directions of q 2 ; q 3 ; q 4 .
The 4 by 4 and 5 by 5 matrices with integer orthogonal columns2 (not orthogonal3rows,
2 3 1 1 1 1
6 1 1 1 17
since not orthonormal Q!) are 4 A B C D 5 D 4 and
0 2 1 15
0 0 3 1
2 3
1 1 1 1 1
6 1 1 1 1 17
6 7
6 0 2 1 1 17
4 0 0 3 1 15
0 0 0 4 1
90 Solutions to Exercises
12 When A is multiplied by a plane rotation Qij , this changes the 2n (not n2 ) entries in
1
rows i and j . Then multiplying on the right by .Qij / D .Qij /T changes the 2n
entries in columns i and j .
13 Qij A uses 4n multiplications (2 for each entry in rows i and j /. By factoring out cos ,
the entries 1 and ˙ tan need only 2n multiplications, which leads to 23 n3 for QR.
1
14 The .2; 1/ entry of Q21 A is 3
. sin C 2 cos /. This is zero if sin D 2 cos or
p p p
tan D 2. Then the 2; 1; 5 right triangle has sin D 2= 5 and cos D 1= 5.
Every 3 by 3 rotation with det Q D C1 is the product of 3 plane rotations.
15 This problem shows how elimination is more expensive (the nonzero multipliers are
counted by nnz(L) and nnz(LL)) when we spoil the tridiagonal K by a random per-
mutation.
If on the other hand we start with a poorly ordered matrix K, an improved ordering
is found by the code symamd discussed in this section.
16 The “red-black ordering” puts rows and columns 1 to 10 in the odd-even order 1; 3; 5; 7,
9; 2; 4; 6; 8; 10. When K is the 1; 2; 1 tridiagonal matrix, odd points are connected