CS 3513
Numerical
Methods for Digital Computers
Spring 2008
Instructor:
Office: North Hall 324
Office Hours: MWR 3:00 pm – 4:30 pm, or
by appointment
Phone: (918) 594-8554
Fax: (918) 594-8281
Email: cdebao@okstate.edu, cdebao@osu-tulsa.okstate.edu
Web: http://www.cs.okstate.edu/~cdebao
Teaching Assistant:
Mr. Suresh Venkatesan
Email:
svenka@cs.okstate.edu
Required text:
Ward Cheney and David
Kincaid: Numerical Mathematics and Computing, 5th
Edition
Reference book:
L. F. Shampine, R. C. Allen, Jr, & S.
Pruess: Fundamentals of Numerical Computing
Prerequisites:
Digital computer approximate
solution of algebraic and transcendental equations, solutions of linear and
nonlinear equations, functional approximations, least squares curvefitting and
applied topics. Practical programming experience in
applications of these techniques.
Material to be covered:
1. Chapter 1, Introduction
2. Chapter
2, Number Representation and Errors
3. Chapter 3, Locating Roots of
Equations
4. Chapter 4, Interpolation and
Numerical Differentiation
5. Chapter 5, Numerical
Integration
6. Chapter 6,More on Numerical
Integration
7. Chapter 7, Systems of Linear
Equations
8. Chapter 9, Approximation by Spline Functions
9. If time permits, more
material will be covered
Attendance policy:
Attendance is usually has a correction with how well
you perform in a course. Students should talk with the instructor about any
absences. Attendance is not required, but strongly encouraged. Students are
responsible for any material covered in class, including material that does not
appear in the text. If a student misses the class too many times, at the instructor’s
judgement, the instructor may give him/her an oral examination to evaluate
his/her understanding of the missing classes.
Homework:
1. Homework will be assigned on
every class time, with a few possible exceptions.
2. Homework will be collected
on every Wednesday class time, unless the instructor notifies otherwise.
3. If, for whatever reason, you
cannot attend a class, with my permission, you may email your homework to the
TA before the class begins.
4. Homework assignments will be
posted on the web on Thursday after each Lecture.
5. Late homework will not be
accepted.
Programming Assignment:
There will be some programming assignments.
We may use some software
available
free of charge at ftp and web addresses such as
http://archives.math.utk.edu:80/
ftp ftp.wiley.com/public/college/math/sapcodes
(software
in C, C++, FORTRAN 77, Fortran 90, and Matlab)
Grading:
1. Homework: 30%
2. Programming Assignment 10%
3. Mid-term: 25%
4. Final: 35%
Grade scale:
1. 90-100% A
2. 80-89% B
3. 70-79% C
4. 60-69% D
5. Below 60% F
Collaboration policy:
1. Homework: Discussion of concepts, ideas, and techniques is allowed and is encouraged. After discussion, each student must write up his/her own solutions. Copying another person’s work is not allowed. Giving your work to another student is considered cheating as well.
2. Examinations: Any kind of
communication among students is not allowed.
3. Any case of academic
dishonesty would result in a reduction of one letter grade. All cases of
academic dishonesty would be reported to university administration.
Special accommodation for
disabled students:
If any student feels that he/she has a
disability and need special accommodation of any nature whatsoever, the
instructor will work with you and the University Services to provide reasonable
accommodation to ensure that all students have a fair opportunity to perform in
this class. Please advise the instructor of any such disability and the desired
accommodations as soon as possible.
Syllabus attachment
Syllabus attachment of OSU can be
viewed on http://osu.okstate.edu/acadaffr/aa/syllabusattachment-Spr.htm.
Syllabus
attachment of OSU-Tulsa is attached.
01/11/2008