18.06, Fall 2004, Problem Set 10 Solutions
1. (13 pts.)
Consider the dierential equation
du
dt
= Au where u is 2-dimensional and
0 1
1 0
A=
.
(a) The characteristic polynomial of A is
det
1
1
= 2 +
18.06, Fall 2004, Problem Set 9 Solutions
1. (5 pts) P is symmetric since P = A(A T A)1 AT (where we have kept only linearly independent
columns of A if A did not have full column rank to start with).
18.06, Fall 2004, Problem Set 8 Solutions
1. (7 pts.) Let
0 1 2
A = 1 0 1 .
4 1 0
(a) Cij is given by (1)i+j det(Mij ) where Mij
column j.
1
C= 2
1
is obtained from A by removing row i and
4 1
8 4 .
2
18.06, Fall 2004, Problem Set 1 Solutions
1. (6 pts.)
(a) False. Counterexample: u = (1, 0, 0), v = (0, 1, 0) and w = (0, 0, 1).
(b) True. u (v + 2w) = u v + 2u w = 0 + 0 = 0.
(c) True. |u v|2 = (u v)
18.06, Fall 2004, Problem Set 6 Solutions
1. (12 pts.)
(a) F is N (A) where
A = [ 1 2 1 1 ].
To nd a basis of F , we can just take the special solutions for N (A) (the free variables
are x2 , x3 and x
18.06, Fall 2004, Problem Set 7 Solutions
1. (11 pts.)
(a) Let F be the subspace of all 2 2 matrices of the form:
a b
c d
,
with a + b + c + d = 0. It is clear that a1 , a2 , a3 and b1 , b2 , b3 are i
18.06, Fall 2004, Problem Set 5 Solutions
1. (10 pts.)
The (edge-node) incidence matrix of the graph is (in MATLAB output) the following 12 8
matrix:
A =
-1
-1
0
0
-1
0
0
0
0
0
0
0
1
0
0
-1
0
0
0
-1
0
18.06 - Final Exam, Monday May 16th, 2005
solutions
1. (a) We want the coordinates (ai1 , . . . , ain ) of Pi to satisfy the equation c1 x1 + . . . + cn xn = 1.
Thus the system of equations is Ac = on
18.06, Fall 2004, Problem Set 3 Solutions
1. (6 pts.)
(a) No. The set F
0
1 0 =
1
0
is not closed under scalar multiplication. For example, 0 is in F but
1
0
0 is not.
1
(b) No. For a counter-examp
Exam 3, Friday May 4th, 2005
Solutions
Question 1. (a) The characteristic polynomial of the matrix A is
3
9
1
1
+ 2 +
= ( 1)
2
16
16
4
2
3
and thus the eigenvalues of A are 1 with multiplicity one a
Exam 2, Friday April 1st, 2005
Solutions
Question 1. The vector a1 can be any non-zero positive multiple of q1 . The vector a2
can be any multiple of q1 plus any non-zero positive multiple of q2 :
a1
18.06 - Spring 2005 - Problem Set 2
Solution to the Challenge Problem
Denote by Cij the n n matrix having a 1 in the (i, j) entry, and 0s everywhere else. In terms of these matrices we may write Eij =
18.06 - Spring 2005 - Problem Set 8
Solution to the Challenge Problem
Challenge Problem: Consider the 3 3 matrix
a b c
A = 1 d e
0 1 f
Determine the entries a, b, c, d, e, f so that:
the top left 1
18.06 - Spring 2005 - Problem Set 3
Solutions to the Challenge Problems
Problem 1
a) The column space is the space of all vectors whose last m r coordinates
are zero. This is clear since the rank of t
Austin Ford
[email protected]
February 11, 2004
18.06 Linear Algebra
Professor Gilbert Strang
Recitation 8
Bianca Santoro
Problem Set 1
Problem
Find the possible failures in the column picture and the row
18.06 Spring 2006 - Problem Set 9
SOLUTIONS TO SELECTED PROBLEMS
1. Section 6.6, Problem 4
Answer: A has no repeated eigenvalues so it can be diagonalized: A = SS 1
makes it similar to .
2. Section 6.
18.06 Spring 2006 - Problem Set 7
SOLUTIONS TO SELECTED PROBLEMS
1. Section 6.1, Problem 2
Answer: A has 1 = 1 and 2 = 5 with eigenvectors x1 = (2, 1) and
x2 = (1, 1). The matrix A + I has the same ei
18.06 Spring 2006 - Problem Set 8
SOLUTIONS TO SELECTED PROBLEMS
1. Section 6.3, Problem 3
Answer:
y 0 1 y
1
. Then = 2 (5 41).
=
y
4 5
y
2. Section 6.3, Problem 23
Answer: A2 = A so A3 = A.
2
18.06 Spring 2006 - Problem Set 6
SOLUTIONS TO SELECTED PROBLEMS
1. Section 5.1, Problem 8
Answer: There are 5! = 120 permutation matrices. 5!/2 = 60 have det= +1.
A permutation matrix that needs four
18.06 Spring 2006 - Problem Set 5
SOLUTIONS TO SELECTED PROBLEMS
1. Section 4.3, Problem 12
Answer:
a) aT a = m, aT b = b1 + . . . + bm . Therefore aT a = m = b1 + . . . + bm and
x
x
x is the mean of
p i in
qoXl
~
z n
|fp
z n
|z
X|v'
~
X|v%
|p
l z cfw_n
z n
|fp
'X '
X|v'
z n
|z
~
X|v%
y i i n
q'fp
l z cfw_n
|p
gg
~
'X '
y i i n
q'fp
l z cfw_n
|p
gg
~
q'q
z n
|z
~
X|v
r ~k kp
sqan
~ cfw_ ~ p
hr
~ cfw_ p
cfw_
ax!
ax(
r
n cfw_ |p
~ cfw_ ~ p
hr
!a!
ax!
~ cfw_ p
cfw_
ax(
z k k p
s!hr
n cfw_ |p
r
!a!
z k k p
s!hr
n cfw_ |p
r
s!s
~ cfw_ p
cfw_