Syllabus

In mathematics you don't understand things. You just get used to them.
-- John von Neumann, Nobel Prize winner.

Time and Place: MWF 8 a.m. at Carr 225

Instructor: Peter Saveliev

Office: Carr 239 (to the right of the main entrance)

Office Hours: Tuesday 1:30-5:00, Wednesday 1:30-3:30, Thursday 1:30-4:00, or by appointment, or any time I am there (see my complete schedule)

Office Phone: x2910

Home Phone: 337-0390 (9 a.m. - 8 p.m.)

E-mail: psavelie (put Math 320 as the subject)

Class Web-Page: http:\\saveliev.net, then go to Math 320

Mailbox: Carr Hall, Box 29

Prerequisites: excellent algebra skills, good knowledge of Euclidean geometry, Cartesian coordinates, basic functions, familiarity with multivariable calculus and/or proofs.

Text: Basic Linear Algebra by Blyth and Robertson. Chapters: 1. The algebra of matrices, 2. Some applications of matrices, 3. Systems of linear equations, 4. Invertible matrices, 5. Vector spaces, 6. Linear mappings, 7. The matrix connection, 8. Determinants, 9. Eigenvalues and eigenvectors.

Goals: fluency in solving linear systems, finding eigenvalues, etc., introduction to the definition-theorem-proof format, some "mathematical maturity".

Group Problems: due weekly (please, staple!), each Friday unless specified otherwise

Quizzes: based on the practice problems assigned daily, once or twice a week

Grade Breakdown:
    group problems + quizzes: 25% (1-2 may be dropped)
    3 exams: 15% each
    final exam: 30%

Letter Grades: A: 90-100, B: 80-89, C: 70-79, D: 60-69, F: <60

From the Catalogue:

320 Linear Algebra
A study of fields, vector spaces, linear transformations, matrices, determinants, systems of linear equations, similarity and canonical forms, characteristic values and vectors, and unitary, Hermitian, and normal matrices. This course may be applied toward the Mathematics requirement for a Computer Science major. Prerequisite: Mathematics 205 or 210.