MATH 304 – Linear Algebra FALL 2015, SECTIONS 501, 503 Instructor’s Information Instructor: Paul Skoufranis E-mail: pskoufra at math.tamu.edu Office: Blocker 525D Offices Hours: Mondays 3:00PM to 4:30PM, Wednesdays 12:15PM to 2:45PM, and by appointment Administrative Information Course Prerequisites: MATH 148, MATH 152, or MATH 172; junior or senior classification Course Webpage: http://www.math.tamu.edu/~pskoufra/F2015-MATH304.html Common Course Webpage: http://www.math.tamu.edu/courses/math304/ Lectures: Section 501 à MWF from 8:00AM to 8:50AM in Blocker 149 Section 503 à MWF from 9:10AM to 10:00AM in Blocker 149 Helps Sessions: Sundays through Thursdays from 8:00PM to 10:00PM in Blocker 160 Textbook: Linear Algebra with Applications, Eighth edition, Steven J. Leon Midterm Examination Dates: Midterm One à Friday October 9, 2015, in class Midterm Two à Friday November 13, 2015, in class Final Examination Dates: Section 501 à Friday December 11, 2015, 10:00AM to 12:00PM Section 503 à Monday December 14, 2015, 8:00AM to 10:00AM Course Description and Objectives Linear algebra is the branch of mathematics that focuses on the concepts of vector spaces, linear transformations, and matrices. Said concepts have a wide range of applications including applications in every branch of science and mathematics. Consequently, linear algebra is an essential toolkit for many mathematical applications. This course will introduce students to linear algebra and its applications to engineering and computer science. We will begin by studying how to solve systems of linear equations, which may be viewed as the origins of linear algebra and will be a necessary tool throughout the course. Subsequently we will move to studying more abstract concepts in linear algebra including vector spaces, linear independence, bases, dimension, and linear transformations. Our focus will then turn to determinants, eigenvectors, and eigenvalues, which are concepts that are essential to many applications. Finally, orthogonality, which is necessary for many geometric applications, will be discussed. This course will be different in nature to the calculus courses students have taken in the past. One may study calculus via a system of mathematical rules and computations one must perform. This is not the case in linear algebra. Although this course will focus on applications and problem solving, one cannot tackle linear algebra problems without understanding both the computational tools and the theory. Although lectures will contain significant theory and proofs, students will only be expected to perform simple proofs. Course Schedule The following is a rough outline of the chapters and schedule for the lectures of this course: 0. Fields (1 lecture) 1. Systems of Linear Equations (2 lectures) 2. Vector Spaces (8 lectures) 3. Linear Transformations (4 lectures) 4. Matrix Algebras (8 lectures) 5. Determinants (2 lectures) 6. Eigenvectors and Eigenvalues (4 lectures) 7. Orthogonality (9 lectures) 8. Spectral Theorem for Hermitian Matrices (time permitting) (Note the above is rought and there are 2 lectures not accounted for in the above outline.) Grading Scheme A student’s final grade in the course will be computed as follows: 20% Homework + 40% Midterms (20% Each) + 40% Final Examination A student’s final letter grade will be determined by the rule 90-100 for an A, 80-89 for a B, 70-79 for a C, 60-69 for a D, 0-59 for an F. To pass the course, a student must take the final examination. Homework The purpose of the homework in this course is to aid students in the comprehension of the material presented in lecture each week and to expand students’ knowledge beyond what can be covered in lectures. Thus the instructor will endeavour to provide students with a sufficient amount of time after the material is presented in lecture for completion of the homework. There will be eleven homework assignments in this course where the lowest grade will not count towards a student’s final grade. Homework will be posted on the course webpage at least one week prior to the due date. Homework will be due by noon on the due date and late homework will not be accepted, as solutions will be posted promptly. Homework may be handed in during class or at the professor’s office. Students are expected to clearly indicate their names and student ID number on their homework. Students are welcome to collaborate with each other on the homework. However, each student must write his or her solutions separately in their own words (no copying!). Regrading A student that believes there has been an error in the grading of their work should bring it to the attention of the instructor within one week from the time at which the work was returned to the class. Objections that arise after this one-week period will not be considered. Academic Integrity “An Aggie does not, lie, cheat, or steal, or tolerate those who do." Copying work done by others, either in-class or out of class, is an act of scholastic dishonesty and will be prosecuted to the full extent allowed by University policy. See http://aggiehonor.tamu.edu for more information. Make-up Policy In accordance with university regulations, make-ups for missed exams and assignments will only be allowed for a university-approved excuse in writing. Whenever possible, students should inform the instructor before an exam or assignment is missed. Students are required to notify the instructor by the end of the next working day after missing an exam or assignment. Otherwise, they forfeit their rights to a make-up. Support Services The Americans with Disabilities Act (ADA) is a federal anti-discrimination statute that provides comprehensive civil rights protection for persons with disabilities. Among other things, this legislation requires that all students with disabilities be guaranteed a learning environment that provides for reasonable accommodation of their disabilities. If you believe you have a disability requiring an accommodation, please contact Disability Services, in Cain Hall, Room B118, or call 845-1637. For additional information visit http://disability.tamu.edu.