Math 217 - University of Michigan



Math 227 Introduction to Linear Algebra Winter 2011

The analysis of many problems requires the use of several variables. Vectors and matrices are mathematical tools that are helpful in dealing with these problems. They are most powerful when the equations involving the variables are linear, i.e. only involve the variables multiplied by constants and added. However, even when the equations are nonlinear, vector and matrix techniques can be combined with multivariable calculus to help in their solution. This course studies the basic concepts of linear and matrix algebra and their use in various real world applications. The main topics are vector and matrix concepts and operations, the solution and manipulation of systems of linear equations, eigenvalues and eigenvectors of matrices and problems in which these arise.

Instructor: Frank Massey

Office 2075 CASL Building Phone: 313-593-5198

E-Mail: fmassey@umich.edu

Office Hours: M 12:30 – 1:30, Tu 12:30 – 1:30 & 5:30 – 6, Th 12:30–1:30, & MTuTh by appointment

My office hours are those times I will usually be in my office. However, occasionally I have to attend a meeting during one of my regularly scheduled office hours. In this case I will leave a note on my door indicating I am unavailable. In particular, if you know in advance that you are going to come see me at a particular time, it might not be a bad idea to tell me in class just in case one of those meetings arises. Please feel free to come by to see me at times other than my office hours. I will be happy to see you.

Text: Linear Algebra and Its Applications, 3th edition update, by David C. Lay, published by

Pearson, 2006. ISBN 0-321-28713-4

Website: umd.umich.edu/~fmassey/math227/. This contains copies of this course outline, the assignments, past exams and some notes. Some of the notes are on the basic material, while others are concerned with using Mathematica and MATLAB to do some of the calculations that arise in the course. Some of the notes are written using Mathematica, and to read them you either need to use a computer on which Mathematica has been installed (many of the computers on campus have Mathematica on them) or you can use the "Mathematica Player" software that can be downloaded for free from products/player/. This software allows you to read Mathematica files, but does not allow you to execute the Mathematica operations in the file. See me if you have trouble accessing any of the items in the website.

Grading: There will be 3 midterm exams and a final exam, each of which will count 100 points. In addition, there will be some assignments. You may earn up to 75 points on the assignments. There will be more than 75 points worth of problems on the assignments and you can stop doing them when your reach 75 points. The dates of the exams are on the schedule below. All exams are closed book, but a formula sheet will be provided. A copy of the formula sheet is included in this course outline. You may find that your calculator can do some of the problems on the exams. If this is so, you still need to show how to do the problem by hand, even if you use a calculator to check your work. Some examples of this are solving linear equations, finding the inverse of a matrix and calculating eigenvalues and eigenvectors. No make-up exams unless you are quite sick.

On each exam and the assignments I will look at the distribution of scores and decide what scores constitute the lowest A-, B-, C-, D-. The lowest A- on each of these items will be added up and the same for B-, C-, D-. The lowest A, B+, B, C+, D+, D will be obtained by interpolation. For example, the lowest B is 1/3 of the way between the lowest B- and the lowest A-, etc. All your points will be added up and compared with the lowest scores necessary for each grade. For example, if your total points falls between the lowest B+ and the lowest A- you would get a B+ in the course. This information is in the file YourGrade.xls which you can view by going to the website ctools.umich.edu and logging in with your kerberos password. Click on the tab for MATH 227 and then click on Resources on the left. The file should be listed there and you can download it. After each exam and assignment is graded this information will be updated and you should be able to see how you stand. You can find out what scores I have recorded for you and the total by again going to ctools.umich.edu and clicking on Gradebook on the left. Please check your grades after each exam and assignment to see that they are correct.

In the schedule below are some suggested problems for you to work on. Some of these problems are representative of what will be on the exams, while others are simply to help you fix the concepts in your mind or prepare you to do other problems. Work as many problems as time permits and ask for help (in class or out) if you can’t do them.

The University of Michigan – Dearborn values academic honesty and integrity. Each student has a responsibility to understand, accept, and comply with the University’s standards of academic conduct as set forth by the code of Academic Conduct, as well as policies established by the schools and colleges. Cheating, collusion, misconduct, fabrication, and plagiarism are considered serious offenses. Violations will not be tolerated and may result in penalties up to and including expulsion from the University.

The University will make reasonable accommodations for persons with documented disabilities. These students need to register with Disability Resource Services (DRS) every semester they are taking classes. DRS is located in Counseling and Support Services, 2157 UC. To be assured of having services when they are needed, student should register no later than the end of the add/drop deadline of each term..

Reminder: Wednesday, March 16 is the last day to drop the course.

TENTATIVE SCHEDULE

(L = Lay = regular text. Notes = my notes, online in the website)

|Dates |Section(s) |Topics and Suggested Problems |

|1/6, 10 |L: §1.3, 4.1 |1. Vectors and vector operations |

| |Notes: §1.1, |1.1. Types of vectors: numeric vectors vs geometric vectors, transposes |

| |1.2 |1.2. Vector operations: addition, subtraction, multiplication by a number, linear combinations, |

| | |algebraic properties |

| | |Exam 1, W10 #1 |

| | |L: §1.3 #1, 3, 33, 34 L: §4.1 #25-30 |

| | |Find the resultant of the forces (0, 3) and (3, 1). How can the resultant be doubled in magnitude|

| | |by changing (0,3) but keeping (3,1) unchanged? Answer: The resultant force is (3,4). To double |

| | |the magnitude, replace (0,3) by (3,7). |

|1/10, 11 |L: §6.1 |1.3. Linear functions |

| |Notes: §1.3, |1.4. Multiplication of vectors: row vector times a column vector, dot product of vectors, length|

| |1.4 |of a vector, distance and angle between vectors, algebraic properties |

| | |L: §6.1 #1-17 (odd), 21 |

|1/13, 18 |L: §1.4, 1.8, |2. Matrices and matrix operations |

| |1.9, 2.1 |2.1. Matrices: transpose, addition, subtraction, multiplication by a number |

| |Notes: §2.1 |L: §2.1 #1 |

| | |2.2. Linear functions, multiplication of a matrix times a vector, linear combinations, identity |

| | |matrices, associative property |

| | |L: §1.4 #1, 3, 5, 7 |

| | |L: §1.8 #1, 13, 15, 17,19, 25, 29a, b, 33, 35 |

| | |L: §1.9 #1, 3, 5, 13, 15, 17 |

|1/18, 20 |L: §2.1 2.7 |2.3. Matrix multiplication, associative property, substitution of one set of linear functions |

| |Notes: §2.3 |into another, mixtures, mappings of the plane |

| | |Ex 1, F09 #2 |

| | |Ex 1, W10 #2 |

| | |L: §2.1 #3, 5, 9, 11, 13, 14 |

| | |L: §1.9 #7, 9, 11 |

| | |L: §2.7 #2 |

| | |2.4. Algebraic properties |

| | |Ex 1, F09 #1 |

| | |Final, F09 #1a, b |

| | |Final, W10 #1a |

| | |L: §2.1 #29-33 |

|1/24 - 31 |L: §1.1 – 1.4, |3. Solving linear equations |

| |1.6, 1.10, 2.7 |3.1. Matrix interpretation, expressing a vector as a linear combination of other vectors, |

| |Notes: §3.3, 6 |Gaussian elimination and the echelon form of a matrix |

| | |Ex 1, W10 # 3 |

| | |Ex 1, F09 #3 |

| | |Ex 3, W10 #1a |

| | |Ex 3, F09 #1a |

| | |L: §1.1 #1-11 (odd), 15, 19, 29, 31 |

| | |L: §1.2 #1, 3, 7, 11, 13 |

| | |L: §1.3 #9, 11, 13, 27 |

| | |L: §1.4 #9, 11 |

| | |L: §1.6 #5 |

| | |L: §1.8 #3 |

| | |L: §1.10 #1 |

| | |3.2. Curve fitting |

| | |Ex 1, F09 #4 |

| | |L: §1.2 #33, 34 |

| | |3.3. Electric circuits |

| | |Ex 1, W10 #4 |

| | |Ex 2, W10 #3a |

| | |L: §1.10 #5 |

| | |3.4. Existence of solutions to linear equations and linear combinations, the span of a collection|

| | |of vectors and the column space of a matrix, determining if every vector can be expressed as a |

| | |linear combination of given vectors. |

| | |Useful theorem: Let v1, …, vn be n vectors each with m components and let A be the m(n matrix |

| | |whose columns are v1, …, vn. Then the following are equivalent. |

| | |i. Every vector with m components can be written as a linear combination of v1, …, vn. |

| | |ii. The equation Ax = b has a solution x for every b. |

| | |iii. The row echelon form of A has no rows with all zeros. |

| | |In particular, these can occur only if m ( n. |

| | |Ex 3, F09 #1b |

| | |Ex 3, W10 #1a, b |

| | |L: §1.2 #15, 17 |

| | |L: §1.3 #15, 17, 19, 21, 25 |

| | |L: §1.4 #13, 15, 17, 19, 21, 25, 29, 31 |

| | |3.5. Uniqueness of solutions to linear equations. |

| | | |

| | |Useful theorem: Let v1, …, vn be n vectors each with m components and let A be the m(n matrix |

| | |whose columns are v1, …, vn. Then a solution to Ax = b is unique if and only the row echelon form|

| | |of A has no columns with all zeros. In particular, this can occur only if m ( n. |

| | |L: §1.2 #15 |

| | |L: §1.5 #1, 3 |

|2/1 – 2/14 |L: §2.2, 2.3, |4. Inverses of matrices and linear functions |

| |2.6 |4.1. Calculation of inverses |

| | |Ex 2, W10 #1 |

| | |Ex 2, F09 #1 |

| | |L: §2.2 #1, 31 |

| | |4.2. Expressing the solution of linear equations in terms of the inverse of the coefficient |

| | |matrix, interpretation of the entries of the inverse of a matrix, Leontif input-output models |

| | |Ex 2, W10 #1, 3b, c, d |

| | |Ex 2, F09 #2 |

| | |L: §2.2 #5 |

| | |L: §2.6 #1, 3 |

| | |4.3. Algebraic properties |

| | |Final, F09 #1d |

| | |L: §2.2 #13, 16, 18, 19 |

| | |L: §2.3 #13, 15 |

|2/7 | |Review. |

|2/8 | |Exam 1. |

|2/15 - 22 |L: §Ch 3 |5. Determinants |

| | |a. definition |

| | |L: §3.1 #1, 9 |

| | |b. geometric interpretation |

| | |c. algebraic properties |

| | |Ex 2, W10 #4 |

| | |Ex 2, F09 #4 |

| | |Final, W10 #1b, c |

| | |Final, F09 #2 |

| | |L: §3.2 #1, 3, 5, 7, 11, 15, 17, 19, 21, 25, 29, 31-36, 39 |

| | |d. formulas for the solution of linear equations and the inverse of a matrix |

| | |Ex 2, F09 #5 |

| | |Ex 2, W10 #5 |

| | |L: §3.3 #1, 11, 18, 19, 23, 29, 30 |

|2/24 |L: §1.5, 1.7 |6. Linear independence and dependence of vectors, the null space of a matrix and representation |

| | |of solutions to linear equations when the solution is not unique. |

| | | |

| | |Useful theorem: Let v1, …, vn be n vectors each with m components and let A be the m(n matrix |

| | |whose columns are v1, …, vn. Then the following are equivalent. |

| | |i. v1, …, vn are independent. |

| | |ii. The row echelon form of A has no columns with all zeros. |

| | |iii. A solution to Ax = b is unique. |

| | |In particular, this can occur only if m ( n. |

| | |Ex 3, W10 #1c |

| | |Ex 3, F09 #1c |

| | |L: §1.5 #5, 7, 11, 15 |

| | |L: §1.7 #1, 3, 5, 9, 17, 19, 23, 25, 31, 33, 35 |

|3/7 - 8 |L: §5.1, 5.2, |7. Eigenvalues and eigenvectors: the characteristic equation, finding the eigenvectors, |

| |5.5 |conjugate pair property of the complex eigenvalues and eigenvectors of a matrix with real entries.|

| | |Ex 3, W10 #2 |

| | |Ex 3, F09 #2 |

| | |Final, W10 #1d |

| | |Final, F09 #1c |

| | |L: §5.1 #1, 3, 9, 17, 19, 23, 25-27, 29-31 |

| | |L: §5.2 #1, 3, 9 (In #9, also find the eigenvalues. In all three also find an eigenvector for |

| | |each eigenvalue) |

| | |L: §5.5 #1, 7, 13 |

|3/14 | |Review. |

|3/15 | |Exam 2. |

|3/10 - 17 |L: §5.3, 5.4, |8. Diagonalization of matrices, matrix powers and difference equations |

| |5.6, 5.7 |a. diagonalization of matrices and matrix powers |

| | |Ex 3, W10 #4a |

| | |Ex 3, F09 #4a |

| | |Final, W10 #5 |

| | |L: §5.3 #3, 7, 27, 28 |

| | |L: §5.4 #11, 13 |

| | |b. translation of words into difference equations and matrix representation of the equations, |

| | |expressing the solution in terms of the powers of a matrix, Markov chains and their long run |

| | |behavior |

| | |Ex 3, W10 #3, 4b |

| | |Ex 3, F09 #3, 4b |

| | |L: §1.10 #9 |

| | |L: §5.6 #9 Also find An and the solution to the following difference equations and initial |

| | |conditions. |

| | |xn+1 = 1.7 xn - 0.3 yn x0 = 1 |

| | |yn+1 = - 1.2 xn + 0.8 yn y0 = 2 |

| | |c. a factored form for matrices with complex eigenvalues, application to difference equations and|

| | |matrix powers |

| | |d. the matrix exponential and solution of differential equations. |

| | |L: §5.7 #3 (also find etA). |

|3/21 - 28 |L: §6.1 – 6.3, |9. Orthogonal projections and least squares curve fitting. |

| |6.5, 6.6 |a. finding the linear combination of given vectors closest to another given vector |

| | |L: §6.2 #11 |

| | |L: §6.5 #1 |

| | |b. finding the least squares curve that fits a given set of data by translating the problem into |

| | |a problem of the type considered in a. |

| | |Final, W10 #5 |

| | |Final, F09 #3 |

| | |L: §6.6 #1, 7, 9 |

|3/29 - 31 |L: §7.1 |10. Symmetric and Orthogonal Matrices: orthogonality property of the eigenvectors of a symmetric|

| | |matrix, orthonormal bases and orthogonal matrices, diagonalization of symmetric matrices. |

| | |Final, W10 #3 |

| | |L: §7.1 #1-13 (odd) |

|3/31-4/4 |L: §7.2 |11. Quadratic forms |

| | |a. expressing a quadratic form in matrix form |

| | |Final, W10 #6a |

| | |Final, F09 #5a |

| | |L: §7.2 #1, 3, 5 |

| | |b. finding a coordinate system in which there are no cross product terms |

| | |Final, W10 #6b, c |

| | |Final, F09 #5b, c |

| | |L: §7.2 #9, 11 |

| | |c. graphing conic sections |

| | |Final, W10 #6d |

| | |Final, F09 #5d |

| | |L: §7.2 In #9 also sketch the curve 3x2 – 4xy + 6y2 = 28. In #11 also sketch the curve 2x2 + |

| | |10xy + 2y2 = 63. |

|4/5 | |Review. |

|4/7 | |Exam 3. |

|4/11 - 12 |L: §2.8, 2.9, |12. Subspaces & Bases |

| |4.1 |a. A subspace is a collection S of vectors with the following two properties |

| | |i. If you add two vectors in S their sum is in S |

| | |ii. If you multiply a vector in S by a number the product is in S. |

| | |Example #1: The set of all linear combinations of a collection of vectors = the set of vectors of |

| | |the form Ax where A is the matrix whose columns are the vectors. |

| | |Examples #2: the set of vectors x such that Ax = 0 where A is a matrix. |

| | |L: §2.8 #1, 3, 5 |

| | |L: §4.1 #1, 3, 9, 11, 15, 17 |

| | |b. Bases of subspaces and coordinate systems, dimension of subspa |

| | |L: §2.8 #15, 17, 19, 23, 25 |

| | |L: §2.9 #1, 3, 13 |

|4/14 - 18 | |13. Matrices that are not diagonalizable |

| | |L: §5.2 #5 Also find an invertible matrix P and a number ( so that A = P P-1. |

|4/19 | |Review. |

|Monday, April 25, 11:30 – 2:30, Final Exam. |

................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download