Math 530 - Fall, 2012
2
1. (18pts) Let
v
Exam 1
,w
3
Name: _Solutions_
2
1
, and
z
1
2
3
a. Compute w and determine if and w are parallel, perpendicular or neither.
v
v
w 2 3 1 0 so and w are not
Math 530 - Fall, 2012 Hour Exam 2 Name: _Solutions_
1. (10pt) Let A and B be n n symmetric matrices. Prove or disprove each of the following matrices is also
symmetric. Show your work in detail to sup
3.1 Spaces of Vectors
Definition: Vector Spaces:
Let V be a set of vectors. Let u + v be a vector addition and cu be a scalar multiplication for vectors u and v in
V and c a scalar. V with this vector
7.1 Linear Transformations
Definition: transformation
T is a transformation from V to W if T assigns to each vector in V a unique vector in W.
Examples:
(1) Tv 1 , v 2 v 1 v 2
(2) Tv 1 , v 2 v 1 , v 2
6.2 Diagonalizing a Square Matrix
Definition: similar matrix
Let A and B be square matrices of the same size. A and B are similar if there exists an invertible matrix
S such that B SAS 1 .
Properties:
6.1 Eigenvalues and Eigenvectors of a Square Matrix
Let A be an m n matrix. The function Tx Ax is also called a linear transformation. T transforms
a vector x in R n to a vector Ax in R m . When m n,
2.7 Transpose and Permutation Matrices
Let A be an m n matrix.
Definition: (transpose matrices)
The transpose of A = a ij , denoted as A T , is defined by A = a ji .
Note that: the rows of A T are col
5.2 Permutations and Cofactors
Let A be an n n matrix and A a ij .
Three ways to compute the determinant of A:
(1) Pivot numbers:
(a) Reduce A to U u ij an upper triangular matrix.
(b) detA 1 k detU 1
3.5 Independence, Basis and Dimension
Definition: Vectors v 1 , . . . , v n are linearly independent if the only linear combination
c 1 v 1 . . . c n v n that gives 0 is having all zero coefficients:
Math 530 - Fall, 2012 Review for Hour Exam 1
1. Vectors:
v1
v2
v1
v1
,
v2
,
v3
v2
vn
(ii) + w (iii) w
a. vector operations: (i) cv
v
v
computation and geometric interpretation of a vector operation
5.1 Determinant and Properties
Definition: Determinant:
Let A be an n n matrix and A = a ij . Let M ij be the n 1 n 1 matrix obtained from A by deleting
the ith row and the jth column and C ij = 1 i+j
5.3 Cramers Rule, Inverse Matrices and Volumns
Let A be an n n matrix and A a ij .
Cramers Rule to solve Ax b when detA 0:
Let B i be the n n matrix obtained from A by replacing the ith column of A by
3.3 The Rank and the Row Reduced Form
Let A be an m n matrix.
Definition: The rank of A, denoted as r, is the number of pivots.
the rank of A gives the true size of A.
Compute the rank of A using Gau
3.2 The Nullspace of A and Solutions of Ax 0
Let A be an m n matrix.
Definition: The nullspace of A consists of all solutions to Ax 0.
NA x in R n ; Ax 0
NA is a subspace of R n .
Vector x in NA if
3.4 The Complete Solution to Axb
Let A be an m n matrix, b be an m 1 vector.
Suppose Ax b is consistent (Ax b has a solution).
Let x be a solution of Ax b. Then x x p x N where
x p , called a particul
6.4 Symmetric Matrices
Definition: symmetric matrix
A is symmetric if A T A.
Eigen Properties of a Symmetric Matrix:
Let A be symmetric.
(1) Eigenvalues of A are real.
(2) Eigenvectors of A are linear