|MATH 527/CSCE 561
Numerical Analysis - Spring 2006
Professor Robert Sharpley
Office: LeConte 313 D
Office Hours: TTh 11-11:50
W 9-10 (in Sumwalt 206)
and by Appt.
| Starting values for Newton's interation method
(for solving z3=1)
are colored according their numerical limit, an appropriate cube root
of unity, and the number of iterations required.
Course Announcements for Thursday, May 4, 2006
Grades have been posted on VIP.
Have a good and productive summer.
Description: This course will emphasize the development of numerical algorithms to provide solutions to common problems formulated in science and engineering. The primary objective of the course is to develop the basic understanding of the construction of numerical algorithms, and perhaps more importantly, the applicability and limits of their appropriate use. The emphasis of the course will be the thorough study of numerical algorithms to understand (i) the guaranteed accuracy that various methods provide, (2) the efficiency and scalability for large scale systems. and (3) issues of stability. Topics include the standard algorithms for numerical computation:
Text: Numerical Mathematics and Computing (5th Edition), by E. Ward Cheney and David R. Kincaid, Brooks/Cole Publishers (2004), 690 pages. [ISBN 0534389937]
Grading scheme: Two tests (25 %), HW and Computer Experiments (25 %) , Final Exam (25%) Graduate students will a term paper on a topic negotiated between the instructor and student in an area of the student's interest. In addition, for graduate students there will typically be an extra problem on each HW set and exam.
Attendance: Classroom attendance is required according to official university 10% policy. Make-up tests are not normally given for missed examinations.
Important Course Dates:
Prerequisites: Math 242 or 520.
Homework Assignments and Additional Materials
Tests and Samples
|This page maintained by Robert Sharpley
and last updated February 21, 2006.
This page ©2006-2007, The Board of Trustees of the University of South Carolina.
Return to Sharpley's Home Page