For the following matrices, first find a basis for the column
space of the matrix. Then use the Gram-Schmidt process to find an
orthogonal basis for the column space. Finally, scale the vectors
of the orthogonal basis to find an orthonormal basis for the column
space.
(a) [1 1 1, 1 0 2, 3 1 0, 0 0 4 ] b) [?1 6 6, 3 ?8 3, 1 ?2 6, 1
?4 ?3 ]
Using dynamic programming, find an optimal parenthesization of a
matrix-chain product of 4 matrices whose dimensions are p = { 1,
10, 5, 20, 2}. Show your work.
For each of the following matrices, find a minimal spanning set
for its Column space, Row space,and Nullspace. Use Octave Online to
get matrix A into RREF.
A = [4 6 10 7 2; 11 4 15 6 1; 3 −9 −6 5 10]
Let A and b be the matrices A = 1 2 4 17
3 6 −12 3
2 3 −3 2
0 2 −2 6
and b = (17, 3, 3, 4) . (a) Explain why A does not have an LU
factorization. (b) Use partial pivoting and find the permutation
matrix P as well as the LU factors such that PA = LU. (c) Use the
information in P, L, and U to solve Ax = b
For the given matrix B=
1
1
1
3
2
-2
4
3
-1
6
5
1
a.) Find a basis for the row space of matrix B.
b.) Find a basis for the column space of matrix B.
c.)Find a basis for the null space of matrix B.
d.) Find the rank and nullity of the matrix B.
Find an optimal parenthesization of matrices whose sequence of
dimensions is: <5, 10, 12, 5, 50>. Please write out both the
m[·, ·] and s[·, ·] tables.