### Contents

### COURSE DESCRIPTION

Matrices, Gaussian elimination, vector spaces, LU-decomposition, orthogonality, Gram-Schmidt process, determinants, inner products, eigenvalue problems, diagonalization of symmetric matrices, applications to differential equations and Markov processes. Credit is not given in both MATH310 and MATH320.

### PREREQUISITES

Grade of C or better in MATH 181.

### TEXTBOOK

Linear Algebra and its Applications, Addison-Wesley 5th edition, David C. Lay, Steven R. Lay, Judy J. McDonald, ISBN 978-0-321-98261-4, 0-312-98261-4. Students may choose to use either the printed version or the ebook.

### STUDENTS WITH DISABILITIES

Students with disabilities who require special accommodations for access and participation in this course must be registered with the Office of Disability Services (ODS). Students who need exam accommodations must contact ODS in the first week of the term to arrange a meeting with a Disability Specialist. Please contact ODS at (312)-413-2183 (voice) or (312)-413-0123 (TTY).

### RELIGIOUS HOLIDAYS

Religious holidays: Students who wish to observe their religious holidays shall notify the faculty member by the tenth day of the semester of the date when they will be absent unless the religious holiday is observed on or before the tenth day of the semester. In such cases, the student shall notify the faculty member at least five days in advance of the date when he/she will be absent.

### GRADING

20% Quizzes/Homeworks (as decided by each instructor)

20% Midterm 1 (held in class)

20% Midterm 2 (held in class)

40% Final Exam

Note: The date for the final exam is set by the university. The schedule can be found here.

### GRADES

The overall scores will be converted to grades as follows:

85%+ A

70%+ B

55%+ C

40%+ D

In addition individual instructors may choose to lower these boundaries for their section if deemed necessary to ensure fairness across different sections (so, for example, 85% will always result in an A grade, but it may be that an A grade is given to some students with slightly lower scores).

### ATTENDANCE

Attendance in person at lectures, quizzes and exams is mandatory in this course. Each instructor will determine the precise policy for their section.

### CALCULATORS

Quizzes and exams are to be taken without calculators.

### SCHEDULE

MATH 310 is a semi-coordinated course. Each section will have separate midterms and final exams, but will aim to cover the following topics (the * sections may be omitted).

§ 1.1 Linear Systems

§ 1.2 Row Reduction and Echelon Forms

§ 1.3 Vector Equations

§ 1.4 The Matrix Equation Ax=b

§ 1.5 Solution Sets of Linear Systems

§ 1.6 Applications of Linear Systems

§ 1.7 Linear Independence

§ 1.8 Linear transformations

§ 1.9 Matrix of a Linear Transformation

§ 1.10* Linear Models in Business, Science, and Engineering

§ 2.1 Matrix operations

§ 2.2 Inverse of a Matrix

§ 2.3 Characterization of Invertible Matrices

§ 2.5 Matrix Factorization

§ 3.1 Introduction to Determinants

§ 3.2 Properties of Determinants

§ 3.3 Cramer's Rule, Volume and Linear Transformations

§ 4.1 Vector spaces and subspaces

§ 4.2 Null Spaces, Column Spaces, and Linear Transformations

§ 4.3 Linearly independent sets; Bases

§ 4.4 Coordinate System

§ 4.5 The Dimension of a Vector Space

§ 4.6 Rank

§ 4.7* Change of basis

§ 4.9 Applications to Markov Chains

§ 5.1 Eigenvectors and Eigenvalues

§ 5.2 The Characteristic Equation

§ 5.3 Diagonalization

§ 5.4 Eigenvectors and Linear Transformations

§ 5.5 Complex Eigenvalues

§ 5.7 Applications to Differential equations

§ 6.1 Inner product, length and orthogonality

§ 6.2 Orthogonal Sets

§ 6.3 Orthogonal Projections

§ 6.4 The Gram-Schmidt Process

§ 6.5 Least-Squares Problems

§ 6.6 Application to Linear Models

§ 6.7* Inner Product Spaces

§ 7.1* Diagonalization of Symmetric Matrices

### Homework Problems

§ 1.1: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19

§ 1.2: 1, 3, 7, 11, 13, 15, 17, 19, 21

§ 1.3: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21

§ 1.4: 1, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23

§ 1.5: 1, 5, 7, 11, 13, 15, 19, 23

§ 1.7: 1, 3, 5, 7, 9, 11, 15, 17,19, 21, 23, 25

§ 1.8: 1, 3, 5, 7, 9, 11, 19, 20

§ 1.9: 1, 3, 5, 7, 13, 15, 19, 21, 23, 25

§ 1.10: 1, 3, 5, 7, 9

§ 2.1: 1, 3, 5, 7, 9, 11, 13, 15, 19, 23, 27

§ 2.2: 1, 3, 5, 7, 9, 11, 23, 25, 26, 29, 31

§ 2.3: 1, 3, 5, 7, 11, 13, 17, 21, 33

§ 3.1: 1, 3, 5, 7, 9, 11, 13, 19, 21, 37

§ 3.2: 1, 3, 5, 7, 9, 11, 15, 17, 21, 25, 27, 29

§ 3.3: 1, 5, 7, 9, 11, 15, 19, 21, 23, 27

§ 4.1: 1, 3, 5, 7, 11, 13, 15, 17, 21, 23

§ 4.2: 1, 3, 5, 7, 9, 11, 15, 17, 23, 25

§ 4.3: 1, 3, 5, 7, 9, 13, 15, 19, 21, 25

§ 4.4: 1, 3, 5, 7, 9, 11, 13, 15, 17, 27

§ 4.5: 1, 5, 7, 9, 11, 13, 15, 17, 19, 25, 29

§ 4.6: 1, 3, 5, 7, 9, 11, 13, 15, 17, 27

§ 4.7: 1, 3, 5, 7, 9, 13, 15

§ 4.9: 1, 3 ,5, 7, 9, 11, 13

§ 5.1: 1, 3, 5, 7, 13, 15, 17, 21, 25, 27, 31

§ 5.2: 1, 3, 5, 7, 9, 13, 15, 17, 21

§ 5.3: 1, 3, 5, 7, 11, 13, 17, 21

§ 5.4: 1, 3, 4, 7, 8, 11, 13, 15, 17, 19, 21

§ 5.5: 1, 3, 5, 7, 9, 13, 15

§ 5.7: 1, 3, 5, 7, 9, 11, 13

§ 6.1: 1, 3, 5, 7, 9, 11, 13, 15, 17, 23, 25

§ 6.2: 1, 3, 5, 7, 9, 11, 13, 17, 19, 21

§ 6.3: 1, 3, 5, 7, 9, 11, 13, 15

§ 6.4: 1, 3, 5, 7, 9, 11, 13, 15

§ 6.5: 1, 3, 5, 7, 9, 11, 13

§ 6.6: 1, 3, 5, 9

§ 6.7: 1, 3, 5, 7, 9, 11 ,13, 15, 17, 19, 21, 23

§ 7.1: 1, 3, 5, 7, 9, 11 ,13, 16, 17, 19, 21, 23