| Course: | Math 341/0101 [catalog #3893]: Computational Methods |
| Time/Place: | TT 10:00am-11:15am, SOND 101 |
| Instructor: | Dr. Rouben Rostamian |
| Email: | rostamian@umbc.edu |
| Office: | MP 402 |
| Phone: | 410-455-2458 |
| Office hours: | TT 11:15-12:00 and by appointment |
This course serves as an introduction to numerical analysis. Numerical analysis has a long history, going back to the 17th and 18th centuries. The invention of digital computers in the mid 20th century gave numerical analysis a predominant role in all aspects of scientific computing and gave rise to an unprecedented rush of new techniques and algorithms.
The bulk of this course deals with the issue of approximating arbitrary functions with polynomials. Estimation of errors in such approximations is the main focus of the subject. Polynomial approximations are then used to obtain algorithms for numerical differentiation, integration, and solving differential equations.
A second major topic of this course is the issue of computing solutions of system of linear equations. Several direct and iterative schemes will be discussed and approximation errors will be analyzed.
Prerequisites: Math 152 (calculus II), Math 221 (linear algebra), CMSC 201 (programming techniques).
Numerical computing, commonly called "number crunching", is an integral part of this course. Matlab is the predominant software tool for numerical computing. Following the textbook, will use Matlab for illustrations and examples throughout this course.
Kendall Atkinson and Weimnin Han: Elementary Numerical Analysis third edition, John Wiley & Sons, 2003.
Suggested reading: MATLAB: An Introduction with Applications by Amos Gilat
I will put homework assignments on this web page immediately before or after each class. Solution of problems assigned during week n are due on the Thursday of week n+1. I will have some or all of the problems graded and will return them to you on the following Tuesday.
No late homeworks will be accepted, however the two lowest homework grades will be dropped.
Exam 1 and Exam 2 will cover approximately the first third and second third of the course. They will be given in the regularly scheduled class time.
The Final Exam will be comprehensive -- it will cover the entire course -- however it will put greater emphasis on the material covered in the later parts of the course.
The Final Exam is on May 23 10:30-12:30, in SOND 101
|
Your course grade will be calculated based the weights attached to various components as shown in the adjacent table. Letter grades will be determined according to:
if { grade ≥ 85: A}
else if { grade ≥ 75: B}
else if { grade ≥ 65: C}
else if { grade ≥ 55: D}
else F
I will make and grade the exams in a fair and reasonable way, but sorry, no "curving" in this course.
|
Interpolation demos: Downloadable Maple worksheets
of classroom demos
Euler and Runge-Kutta solvers: de-solvers.mw Jacobi and Gauss-Seidel algorithms: sys-iterate.mw | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Instructions for the final exam: Bring along a calculator (of any sort). The exam will be closed-book/closed-notes. However you may bring along up to 3 crib-sheets filled on both sides with whatever you think you will need. No other reference material is allowed. The exam will cover the entire course, although lesser emphasis will be placed on the early material.
The Final Exam is on May 23 10:30-12:30, in SOND 101