Assignment 2

Total points: 40
1 −2 1
−1 3 0
1. [10 points] Consider the set of vectors 𝐵 = {[ ] , [ ] , [ ]}.
2 1 7
3 −2 7
a. Show that the vectors in B are linearly dependent using Gaussian Elimination. In class
we talked about two ways to doing this.
i. Put the vectors as columns of a matrix A and find the solution to Ax = 0. If only
the trivial solution exists then the vectors are linearly independent, otherwise
dependent.
ii. Put the vectors as rows of a matrix A and compute the Row Echelon Form (REF)
of the matrix A. If the REF contains one or more rows of all zeros, then the
vectors are dependent. Express the dependent vector as a linear combination of
the independent ones.
1 2 5 8
2. [10 points] Consider the set of vectors 𝑆 = {[2] , [1] , [4]} and the vector 𝑦 = [−9].
3 0 3 6
a. Are the vectors in S linearly independent?
b. Can we express y as a linear combination of the vectors in S? If we can, find the
coefficients using Gaussian Elimination. If we cannot, why not?
3. Use the Naïve Gaussian Elimination with back-substitution code in slide deck “Review of
GaussianElimination_LU” to find the solution to the following system of linear equations:
𝑥+𝑦+𝑧 = 3
𝑥 + 2𝑦 + 3𝑧 = 0
𝑥 + 3𝑦 + 2𝑧 = 3
4. [10 points] Update the Naïve Gaussian Elimination so that it can output whether a set of vectors
are linearly independent or not using the 2nd method outlined in question 1(a). Run your code
on the set of vectors in questions 1 and 2.
5. [10 points] Write the Matlab/Octave code to solve problems 2 and 3 in Lab worksheet 2.
6. Run the codes given in problem 4 in lab worksheet 2.

Submission instruction:

Solve problems 1 and 2 by hand, take images and paste them in a word doc. For problems 4 and 5 the
codes, the plot in the doc (if applicable) and write down results.
Convert the doc to a pdf and upload to assignment submission page in google classroom.
The filename must follow the format: your_id-assign1.pdf
(For example, if your id is 177007007 then the file name should be 177007007-assign1.pdf)