Unformatted text preview: ' $ Set 0: Administrivia Kyle A. Gallivan
Department of Mathematics
Florida State University Foundations of Computational Mathematics 1
& 1 % ' Course $ • Time and Place : MWF 10:10 AM – 11:00 AM , 201 Love Building
• Instructor: K. A. Gallivan (5-0306, 318 Love Building,
• Ofﬁce Hours: 9:00 AM – 10:00 AM and 11:00 AM – 1:00 PM,
MWF and meetings by appointment
• Prerequisites: programming proﬁciency, linear algebra or consent of
• Text: A. Quarteroni, R. Sacco, and F. Saleri, Numerical Mathematics,
Springer Texts in Applied Mathematics 37, Second Edition.
• Grades: Programs 25%, Exam 1 20% , Exam 2 20% and
comprehensive ﬁnal 35
2 % ' $ Information Distribution
The class webpage will be used to distribute all class information:
• follow Teaching link from http://www.math.fsu.edu/˜gallivan)
• class announcements
• class notes
• programming and homework assignments and homework solutions
• exam information
& 3 % ' $ Attendance
• University-mandated ﬁrst class attendance
• Attendance for other lectures is not required but is strongly advised.
• A student absent from class bears the full responsibility for all
subject matter and procedural information discussed in class.
• No makeup exams will be given without prior approval or, if not
possible, without documentation of an excused absence. & 4 % ' $ Homework Assignments
• Homework will consist of written exercises assigned approximately
• Detailed solutions will be provided approximately one week after
• The written exercises are to assist you in understanding the material
and preparing for the exams. They do not contribute to your grade
and you are not required to turn in solutions.
• It is strongly recommended, however, that you do all assigned
problems and consult the solutions and/or the instructor for the
correct approaches to the problems.
& 5 % ' $ Programming Assignments
• Programming assignments will be graded.
• Programming assignments and are due at the time speciﬁed in the
• Programs will be accepted after the due date only with prior approval
or with documentation of an excused abscence. & 6 % ' Contents $ 1. Vector spaces, norms, inner products, and matrices
2. Factorization methods for solving linear systems
3. Conditioning and stability of numerical methods
4. Floating point arithmetic
5. Numerical Stability of Gaussian elimination
6. Basic iterative methods for solving linear systems
7. Solving linear least squares
8. Eigenvalue problems
9. Solving nonlinear equations
10. Systems of nonlinear equations
11. Unconstrained optimization
& 7 % ...
View Full Document
- Spring '11
- Numerical Analysis, Kyle A. Gallivan, A. Gallivan, K. A. Gallivan