Unlock access to all the studying documents.
View Full Document
Exam
Name___________________________________
MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Find a QR factorization of the matrix A.
A =
0 1 1
1 1 0
–1–1 1
1 –1 1
Q =
0 3 14
1 2 2
–1–2 9
1 –4 7
, R =
330 0
1311
33 0
0–3
33 30
330
Q =
0 3 14
1 2 2
–1–2 9
1 –4 7
, R =
33130
011
33 –3
33
0 0 30
330
Q =
03
33 14
330
132
33 2
330
–13–2
33 9
330
13–4
33 7
330
, R =
33130
011
33 –3
33
0 0 30
330
Q =
03
33 14
330
132
33 2
330
–13–2
33 9
330
13–4
33 7
330
, R =3 1 0
011 –3
0 0 30
SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.
For f, g in C[a, b], set f, g =b
af(t) g(t) dt .
Show that f, g defines an inner product of C[a, b].
Let t0, …., tn be distinct real numbers. For p and q in n, define p, q = p(t0)q(t0) +
p(t1)q(t1) + … + p(tn)q(tn).
With the given positive numbers, show that vectors u = (u1, u2)and v = (v1, v2) define an
inner product in
2 using the 4 axioms.
Set u, v =2u1v1+2u2v2
Let V be the space C[0, 1] and let W be the subspace spanned by the polynomials p1(t) = 1,
p2(t) =1t – 1, and p3(t) = 12t2. Use the Gram–Schmidt process to find an orthogonal basis
for W.
MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Compute the dot product u · v.
Find the orthogonal projection of y onto u.
Compute the dot product u · v.
The given set is a basis for a subspace W. Use the Gram–Schmidt process to produce an orthogonal basis for W.
Let x1=4
–2
0, x2=10
–30
2
Find the distance between the two vectors.
u= (0, 0, 0) , v = (–8, –6, –2)
Determine whether the set of vectors is orthogonal.
20
40
20 , –20
0
20 , 20
20
20
Find a unit vector in the direction of the given vector.
Express the vector x as a linear combination of the u’s.
The given set is a basis for a subspace W. Use the Gram–Schmidt process to produce an orthogonal basis for W.
Let x1=
0
1
–1
1
, x2=
1
1
–1
–1
, x3=
1
0
1
1
0
1
–1
1
,
1
1
–1
–1
,
1
0
1
1
0
1
–1
1
,
1
0
0
–2
,
6
0
1
3
0
1
–1
1
,
3
2
–2
–4
,
14
2
9
7
0
1
–1
1
,
3
4
–4
–2
,
18
4
19
13
Find a QR factorization of the matrix A.
Q =6 6
–312
0 –6, R =
15
5–30
5
0 –36
6
Q =6–6
–318
0 –6, R =
–30
5 0
–36
615
5
Q =
25–16
–15–26
0 16
, R =
15
5–30
5
0 –36
6
Q =
25–16
–15–26
0 16
, R =3–6
0 –6
Find the least–squares line y =0+zx that best fits the given data.
Given: The data points (–2, 2), (–1, 5), (0, 5), (1, 2), (2, 2).
Suppose the errors in measuring the y–values of the last two data points are greater than for the
other points. Weight these data points twice as much as the rest of the data.
X =
1–2
1–1
1 0
1 1
1 2
, =1
2, y =
2
5
5
2
2
Compute the length of the given vector.
p(t) =10t2 and q(t) = t – 1, where t0= 0, t1=1
2, t2= 1
Let C[0, ] have the inner product f, g =
0f(t)g(t) dt, and let m and n be unequal positive
integers. Prove that cos(mt) and cos(nt) are orthogonal.
cos(mt), cos(nt) =
0cos(mt)cos(nt)dt
=1
2
0[cos(mt + nt) + cos(mt – nt)]dt
=1
2sin(mt + nt)
m + n +sin(mt – nt)
m – n from [0, ]
= 0.
cos(mt), cos(nt) =
0cos(mt)cos(nt)dt
=1
2
0[cos(mt + nt) – cos(mt – nt)]dt
=1
2sin(mt + nt)
m – n –sin(mt – nt)
m+ n from [0, ]
= 0.
cos(mt), cos(nt) =
0cos(mt)cos(nt)dt
=1
2
0[cos(mt + nt) + cos(mt – nt)]dt
=1
2sin(mt + nt)
m – n +sin(mt – nt)
m + n from [0, ]
= 1.
cos(mt), cos(nt) =
0cos(mt)cos(nt)dt
=
0[cos(mt + nt) + cos(mt – nt)]dt
=sin(mt – nt)
m + n +sin(mt + nt)
m – n from [0, ]
= 1.
Determine whether the set of vectors is orthogonal.
Compute the dot product u · v.
Find the distance between the two vectors.
u= (–8, 16), v= (16, –16)
Find a least–squares solution of the inconsistent system Ax = b.
A =1 2
3 4
5 9 , b =3
2
1
Let V be in 4, involving evaluation of polynomials at –6, –3, 0, 3, and 6, and view 2 by applying
the Gram–Schmidt process to the polynomials 1, t, and t2.
Find the least–squares line y =0+zx that best fits the given data.
Given: The data points (–3, 2), (–2, 5), (0, 5), (2, 2), (3, 7).
Suppose the errors in measuring the y–values of the last two data points are greater than for the
other points. Weight these data points half as much as the rest of the data.
X =
1–3
1–2
1 0
1 2
1 3
, =1
2, y =
2
5
5
2
7
Let V be in 4, involving evaluation of polynomials at –3, –1, 0, 1, and 3, and view 2 by applying
the Gram–Schmidt process to the polynomials 1, t, and t2.
Let W be the subspace spanned by the u’s. Write y as the sum of a vector in W and a vector orthogonal to W.
y =21
3
9, u1= 1
0
–1, u2=2
1
2
Find the orthogonal projection of y onto u.
Find the equation y =0+1x of the least–squares line that best fits the given data points.
Data points: (5, –3), (2, 2), (4, 3), (5, –1)
X =
1 5
1 2
1 4
1 5
, y =
–3
2
3
–1
Find the distance between the two vectors.
u= (25, 16, 21) , v= (–3, 2, 7)
Let W be the subspace spanned by the u’s. Write y as the sum of a vector in W and a vector orthogonal to W.
y =12
14
25 , u1= 2
2
–1, u2=–1
3
4
Given A and b, determine the least–squares error in the least–squares solution of Ax = b.
A =4 3
2 1
3 2 , b =4
2
1
Find the nth–order Fourier approximation to the function f(t) =4t on the interval [0, 2].
4–8cos(t) –4sin(2t) –8
3cos(3t) – … –8
ncos(nt)
4–8sin(t) –4sin(2t) –4
3sin(3t) – … –4
nsin(nt)
4–8sin(t) –4sin(2t) –8
3sin(3t) – … –8
nsin(nt)
– cos(t) – cos(2t) – cos(3t) – … –8
ncos(nt)
Find the closest point to y in the subspace W spanned by u1 and u2.
y =15
1
7, u1=1
0
–1, u2=2
1
2
Find the distance between the two vectors.
u= (–8, 2, –6) , v= (–3, 3, 4)
u= (0, 0, 0) , v= (6, 9, 9)
Compute the dot product u · v.
Find the closest point to y in the subspace W spanned by u1 and u2.
y =10
20
33 , u1= 2
2
–1, u2=–1
3
4
Find the equation y =0+1x of the least–squares line that best fits the given data points.
Data points: (2, 1), (3, 2), (7, 3), (8, 4)
X =
1 2
1 3
1 7
1 8
, y =
1
2
3
4
Compute the dot product u · v.
Find a least–squares solution of the inconsistent system Ax = b.
A =
1 1 0 0
1 1 0 0
1 0 1 0
1 0 1 0
1 0 0 1
1 0 0 1
, b =
7
8
0
2
4
1
5
4
5
–3
2
0
+x4
–1
1
1
0
5
2
5
–7
2
0
+x4
–1
1
1
1
5
2
4
–3
2
0
+x4
–1
–1
1
1
5
2
5
–3
2
0
+x4
–1
1
1
1
Express the vector x as a linear combination of the u’s.
u1=–2
0
1 , u2=3
5
6, u3=–2
6
–4, x=4
–14
33
Find the distance between the two vectors.
Compute the length of the given vector.
p(t) =4t +7 and q(t) =7t – 5, where t0= 0, t1= 1, t2= 2
Find the distance between the two vectors.
u= (14, 17, 20) , v= (1, 7, 4)
Find a unit vector in the direction of the given vector.