Syllabus for Numerical Methods I

Fall Semester 2002

Course Information

Instructor:
Eric Olson
email:
ejolson@unr.edu
Office:
Ansari Business Building AB614
Tues and Thursday 10:30-11:30am
Homepage:
http://fractal.math.unr.edu/~ejolson/483/
Texts:
  1. Donald Greenspan and Vincenzo Casulli, Numerical Analysis for Applied Mathematics, Science, and Engineering, 1988, Addison-Wesley Publishing Company.
  2. Hosking, Joe, Joyce and Turner, First Steps in Numerical Analysis, 2nd Edition, 1996, Arnold.
Section:
Math (also CS) 483/683 Numerical Methods I
TR 11:00-12:15pm Ansari Business Bldg AB632

Grading

    2 Quizzes                       10 points each
   10 Homework Assignments           5 points each
    5 Programming Assignments       10 points each
    1 Midterm Exam                  50 points
    1 Final Exam                    80 points
    --------------------------------------------------
                                   250 points total

Calendar

#   Date     Greenspan   Hosking   Topic
---------------------------------------------------------------------
1   Aug 27   1.1         1-4       Floating Point Arithmetic
2   Aug 29               5-7       Bisection Method
3   Sep 3                8-10      Newton's Method
4   Sep 5    1.2-1.3     11-12     Gaussian Elimination
5   Sep 10   1.4                   Tridiagonal Systems
6   Sep 12   1.5-1.6     13        Gauss-Seidel Method
7   Sep 17               14-16     LU Decomposition and Conditioning
8   Sep 19   1.7         17        Finding Eigenvalues
9   Sep 24   2.1-2.2     18-20     Finite Differences
                                   QUIZ I 
10  Sep 26   2.3-2.4     21        Linear and Quadratic Interpolation
11  Oct 1    2.6         22-23     Newton and Lagrange Interpolation
12  Oct 3                24-25     Divided Differences
13  Oct 8    2.7         26        Least Squares
14  Oct 10               27        QR Factorization
15  Oct 15   2.5         28        Cubic Splines
16  Oct 17                         MIDTERM EXAM

17  Oct 22   3.1, 3.6    29        Numerical Differentiation
18  Oct 24   3.2-3.3     30-31     Trapeziod and Simpson's Rule
19  Oct 29   3.4-3.5     32        Gaussian and Romberg Integration
20  Oct 31   4.1-4.3               Euler's Method and Convergence
21  Nov 5    4.4-4.7     33.2      Runge Kutta Method
22  Nov 7    4.8-4.9     33.1,35   Method of Taylor Expansions            
23  Nov 12               34        Multistep Methods
24  Nov 14   4.10-4.11             Periodic Solutions
25  Nov 19   5.1-5.3               Central Difference Method
26  Nov 21   5.4                   Upwind Difference Method
27  Nov 26   5.5                   Convergence
                                   QUIZ II (postponed until Dec 5)
    Nov 28                         Thanksgiving Day (no class)
28  Dec 3    5.6                   Finite Elements
29  Dec 5    5.7                   Differential Eigenvalues

Computing Facilities

The FPK Pascal compiler and the GNU/Cygwin C and FORTRAN compilers are suitable for use in this course. These tools may be freely downloaded from the internet for use on any suitable personal computer. Maple may also be used and is available in the Mathematics Center Ansari Business Bldg AB610.

Programming Assignments

Your work should be presented in the form of a typed report using clear and properly punctuated English. Where appropriate include full program listings and output. If you choose to work in a group of two, please turn in independently prepared reports.

Final Exam

The final exam will be held on December 12 from 4:30pm to 6:30pm in Ansari Business Bldg AB635.

Equal Opportunity Statement

The Mathematics Department is committed to equal opportunity in education for all students, including those with documented physical disabilities or documented learning disabilities. University policy states that it is the responsibility of students with documented disabilities to contact instructors during the first week of each semester to discuss appropriate accommodations to ensure equity in grading, classroom experiences and outside assignments.

Academic Conduct

Bring your student identification to all exams. Work independently on all exams and quizzes. Behaviors inappropriate to test taking may disturb other students and will be considered cheating. Don't talk or pass notes with other students during an exam. Don't read notes or books while taking exams given in the classroom. You may work on the programming assignments in groups of two if desired. Homework may be discussed freely. If you are unclear as to what constitutes cheating, please consult with me.

Last updated: Tue Sep 10 10:56:43 PDT 2002