Math 322:

Syllabus 
Textbook  Introduction to Linear Algebra by G. Strang, 2nd Edition, 
WellesleyCambridge Press, ISBN # 0961408855.

Lectures  MWF 11:0011:50, CB 339. 
Office hours: MWF 2:002:50 PM or by appointment. 
Course Goal 
The language of vectors and matrix algebra has proven to be one of the most useful tools in mathematics. 
The main problem of linear algebra is solving systems of linear equations.
We shall develop several methods for solving equations and relate
the equations and their solutions to the geometry of points, lines,
planes, and their higher dimensional analogs.
The ideas in this course have application to all other areas of mathematics,
and most other sciences.
Our primary goal is help you construct a working
knowledge of this valuable subject, by all means possible. This
includes the use of Matlab in our studies.

Material  We will cover most of Chapters 1 through 7 of the text. 
The topics will include the algebra and geometry of vectors, dot product,
matrix multiplication, permutation matrices, Gaussian elimination,
elimination matrices, LU factorization, determinants, vector
spaces, subspaces, linear independence, basis, dimension, linear
transformations, QR factorization, eigenvalues and eigenvectors,
diagonalization.

Policy & Grading 
There will be weekly assignments, two exams and a final. 
They will count toward the final grade as follows:
Quizzes will be based on the weekly homework assignments. Makeup
quizzes will not be given without a written excuse based on the
Excused Absences listed in the Students Rights and
Responsibilities. Note that the list of excused absences is very
short. One quiz grade will be dropped in computing your grade. 
Exams  The exams dates will be announced two weeks before the exam. 
You will be expected to learn the material well enough so that you
are able to work problems that are different from the homework
problems. To do well on the exams and final you must be able to
apply what you have learned in new settings on new problems. 
Technology  Students are expected to have and know how to use a scientific calculator. 
Tests will be written under the assumption that
students will have a calculator available when taking them.
Time permitting, a portion of the course will involve the symbolic
computation language Matlab.

Important dates 
First day of classes: January 10. 
Martin Luther King Birthday, no classes: January 15. 

Last day to add a class for the 2001 Spring Semester. Last day to officially withdraw from the University or reduce course load and receive an 80% refund: January 17. Last day to drop a course without it appearing on the student's transcript: January 31. Last day to officially withdraw from the University or reduce course load and receive a 50% refund: February 7. Last day to withdraw from the University or reduce course load. Students can withdraw or reduce course load after this date only for urgent nonacademic reasons: March 9. Spring Break  no classes: March 1217.
Last day of classes: April 27. 
Comments  You are responsible for doing all of the assigned problems, and you cannot expect 
to do well in the course unless you develop a clear and solid
knowledge of the material through working problems. In this
course it will not be sufficient to memorize an algorithm for doing
specific types of problems. You will be expected to understand the
material well enough so you are able to do problems unlike the ones
we work in class. 
Course Outline  The following is a tentative plan for this course. 

Section  Page  Problems  
1.1  page 6  1, 2, 4, 8, 15, 17, 18, 25, 26, 27.  
1.2  page 17  1, 2, 4, 6, 7, 16, 18, 19, 21, 27.  
2.1  page 29  1, 3, 4, 5, 6, 7, 9, 10, 11, 15, 16, 17, 18, 19, 21, 22, 26.  
2.2  page 40  1, 2, 4, 5, 6, 7, 11, 12, 13, 16, 19, 21, 22, 25, 26.  
2.3  page 50  1, 2, 3, 4, 6, 7, 8, 11, 14, 15, 16, 17, 22, 23, 26.  
2.4  page 59  1, 4, 6, 7, 9, 10, 14, 17, 18, 19, 22, 24, 28, 29, 31, 34.  
2.5  page 72  1, 2, 4, 5, 6, 7, 9, 12, 14, 18, 24, 28.  
2.6  page 84  1, 3, 5, 7, 8, 9, 10, 12, 15, 16, 20, 22.  
2.7  page 95  1, 4, 8, 9, 12, 13, 17, 34.  
3.1  page 107  1, 2, 3, 4, 5, 6, 10, 12, 13, 16, 17, 18, 20, 23, 25, 28.  
3.2  page 118  1, 2, 3, 4, 9, 10, 12, 17, 18, 21, 22, 23, 28, 30, 33.  
3.3  page 128  3, 8, 9, 10, 14, 15, 20.  
3.4 
page 136 
1, 2, 3, 4, 5, 6, 9, 11, 14, 16, 17, 19, 22, 23, 25, 28, 31, 33, 34, 35.  
3.5  page 150  1, 4, 7, 10, 13, 16, 19, 22, 25, 28.  
4.1  page 171  1, 3, 4, 7, 9, 12, 15, 18, 20, 21, 23, 25.  
4.2  page 181  1, 4, 5, 6, 7, 11, 14, 17, 19, 20, 21, 22, 25, 28.  
4.3  page 192  1, 3, 9, 10, 12, 17, 18, 21.  
4.4  page 203  1, 4, 8, 9, 15, 19, 20, 23, 29, 32.  
5.1  page 213  2, 3, 7, 10, 11, 13, 17, 21.  
5.2  page 225  4, 12, 16, 19, 21.  
5.3  page 240  1, 5, 6, 10, 13, 17, 24, 31, 32.  
6.1  page 253  2, 4, 8, 9, 11, 13, 24, 25, 31.  
6.2  page 266  1, 4, 8, 15, 16, 23, 29, 31.  
6.4  page 290  5, 10, 14, 15, 24.  
6.5  page 302  3, 5, 7, 10, 14, 15, 22, 24.  
7.1  page 325  3, 10, 11, 12, 16, 17.  
7.2  page 337  11, 12, 13, 14, 15, 16, 17.  
7.3  page 345  1, 5, 6. 
