Introduction to Numerical Analysis
MTH 351 - Sec 020

MWF 09:00-09:50
STAG 132
Fall 2009


Professor:

Dr. Nathan Louis Gibson  

Office:

Kidd 312

Office Hours:

MWF 11:00-11:50

Course Website:

http://www.math.oregonstate.edu/~gibsonn/Teaching/MTH351-020F09

Text Book:

Atkinson and Han, Elementary Numerical Analysis, Third Edition, Wiley


Grades

Grades for each assignment will be posted to the Blackboard Site.

Grade Distribution

Homework 25%
Computer Assignments 25%
Midterm 25%
Final 25%
Total 100%

Grade Scale

A 93
A- 90
B+ 87
B 83
B- 80
C+ 77
C 73
C- 70
D+ 67
D 63
D- 60


Matlab

A scientific programming language is required for this course. Matlab is preferred due to the integration of computation and visualization, and the fact that the text book authors provide support. Online resources, including links to Matlab Tutorials and Matlab programs used in the text, are available at the publisher's website www.wiley.com/college/atkinson (click on Student Companion Site).

The following are options for accessing Matlab at OSU:

  1. The Mathematics Department computer lab is located in the Math Learning Center, Kidder 108. In order to use the computers there, you will need an ONID account. If you have none please visit http://onid.orst.edu and sign up as soon as possible.
  2. The computer lab in the Milne basement. Again, you will need an ONID account. Both labs may be scheduled for classes at certain times, so it is a good idea to find out in advance when they are open.
  3. You may have access to Matlab through a computer lab or network of your department. In particular, students can download from here.
  4. If you would like to have Matlab at home, consider purchasing the Matlab Student Edition.

The following are online resources for learning Matlab:

*NEW* MATLAB Tutor in the MLC Computer lab. Click here for more information.


Homework

Homework is required for this course. Assignments will consist (mostly) of problems from the text. Exam problems will (mostly) be similar to homework problems. There will be (approximately) 5 homework assignments. Only problems marked with * need to be turned in for a grade.

Students may work together, but must turn in individual copies. (If typed, the wording must differ!) If code is written, a printout must be provided. (Code must be written by each individual!)

While it may not be stated explicitly each day, students are expected to read each section to be covered before class. Questions not addressed during class time should be asked in office hours. Students are responsible for any material missed due to absence.

HW0 -- Not Due

HW1 -- Due Oct 16

HW2 -- Due Oct 28

HW3 -- Due Nov 9

HW4 -- Due Nov 25 Nov 30

HW5 -- Due Dec 2

Only problems marked with * need to be turned in for a grade.


Computer Assignments (Labs)

Computer, or programming, assignments are required for this course. Assignments will be posted on the course website and announced in class. There will be approximately 5 programming assignments.

Students should complete assignments individually. Any questions should be directed to the professor. A printout of all output must be turned in along with detailed explanations of solutions, answers to all questions asked, and supporting plots. Please upload all scripts (.m files) to the Digital Dropbox on the Blackboard Site in a single zip/tar/etc file. Your code should be written in such a way that your results should be reproducable simply by executing a script file, such as lab1prob1.m.


Links

Matlab demonstrations
testloop.m -- Section 2.1.3
compare.m -- Compares Bisection, Secant, and Newton methods (requires sample codes).
cobweb.m -- Graphical display of fixed point iterations
Integrate_GUI.m -- Publisher's GUI for numerical integration (requires Integrate_GUI.fig)
Maple demonstrations
trapsimp.mw -- Compares Mid-point, Trapezoid and Simpson's rules (requires Maple 10)

Introductory Materials from Chapter 1:
Sec 1.1
Sec 1.2
Sec 1.3

Matlab Introduction

Binary Numbers

Math Modeling

Blackboard Site


Exams

There will be one midterm and one final exam (not cummulative, thus essentially Exam 2). There will be no curve, but partial credit will be given for significant progress toward a solution. No books, notes, or calculators are allowed. Expressions which are not easily computed may be left unsimplified. Exam problems will either be similar to suggested problems from the book or will test concepts from the lecture and/or computing assignments.


Last updated: Tue Nov 24 11:08:02 PST 2009