MATH 527 / CSCE 561


Numerical Analysis

Spring 2009



Meeting times: MWF  10:10 - 11:00 AM  at  LeConte (LC) 303B.


Instructor: Dr. Peter G. Binev


phones:   576-6269 (at LC 425)   or   576-6304 (at SUM 206H)

Office hours:  MWF  11:00 - 12:00 AM  at LeConte 425/Sumwalt 206, or by appointment.



Text: Numerical Mathematics and Computing by Ward Cheney and David Kincaid, Sixth Edition, Brooks/Cole: Cengage Learning 2008 ( The course will cover the material considered in chapters 1-6 and 9-14.


Description: Numerical Analysis studies the algorithms for the problems of continuous mathematics. Its knowledge is a step towards achieving the necessary qualification for the best profession (according to and Wall Street Journal from January 6, 2009,) which is described as follows: Applies mathematical theories and formulas to teach or solve problems in a business, educational, or industrial climate. The course will give an introduction to general ideas in Numerical Analysis and will discuss different aspects of the performance of the numerical procedures involved. In addition to the theoretical material, some numerical implementations in MATLAB will be considered on an elementary level. Topics include (not necessarily in the order they will be considered):

- number representations and loss of significance;

- polynomial interpolation;

- numerical differentiation;

- numerical integration;

- spline functions;

- method of least squares;

- numerical methods for ordinary differential equations;

- Monte Carlo methods.


Prerequisites: MATH 242 or MATH 520.


Learning Outcomes: At the end of this course students will be able to read, interpret, and use vocabulary, symbolism, and basic definitions from Numerical Analysis. The students will be able to use facts, formulas, and techniques learned in this course to apply algorithms and theorems to find numerical solutions and bounds on their errors to various types of problems including root finding, polynomial and spline approximation, numerical differentiation and integration, numerical solutions of ODEs.


Attendance: Regular class attendance is important. A grade penalty will be applied to any student missing five or more classes (10%) during the semester. The "10 percent rule" stated above applies to both excused and unexcused absences. Students who anticipate potential excessive absences due to participation in permissible events as described in the USC Academic Bulletins ( atten.) should receive prior approval from the instructor to potentially avoid such penalty.


Cell Phones: All cell phones must be turned off during the class.


Homework: A few homework problems will be assigned each class. Be sure to solve and write these problems before the next class. Some solutions will be collected (with or without preliminary notice).


Projects: Every student has to choose a project motivated by the computational or theoretical problems discussed in the course. Several possible themes for the projects will be suggested by the instructor in the length of the course. The project in a form of a poster, slides, or a short paper should be submitted on or before April 20, 2009.


Graduate Students: The graduate students attending the class will be given some additional homework problems. Their projects will be larger and should contain two parts, theoretical and computational. They should also prepare a 15-minute oral presentation which they should present during the class on April 22, 2009.


Discussions: The homework and the projects will be discussed in class. The participation in the discussions will be taken into account as part of the homework grade.


Midterm Exam: There will be a midterm exam in a form of a test. The tentative date of the exam is February 16, 2009. The problems on the test will be similar to the ones from the homework and the discussions in class.


Final Exam: The final exam in a form of a test will take place on Thursday, April 30 at 9:00 AM.


Grading: The final grade will be determined from the homework (30%), the midterm exam (20%), the project (20%), and the final (30%).


Academic Dishonesty: Cheating and plagiarism will not be allowed. The University of South Carolina has clearly articulated its policy governing academic integrity and students are encouraged to carefully review the policy on the Honor Code in the Carolina Community (see


ADA: If you have special needs as addressed by the Americans with Disabilities Act and need any assistance, please notify the instructor immediately.


Web Materials: The authors of the textbook maintain a webpage In particular, they make available free software codes on the variety of programming languages under the link Sample Codes.


Important Dates:         January 16 Last  day to drop without W

                                    February 16 Midterm Exam

                                    February 23 Last  day to drop without WF

                                    April 4/5 33rd SIAM Southeastern-Atlantic Section Conference

                                    April 20 Deadline to submit the projects

                                    April 22 Graduate students presentations

                                    April 30 Final Exam at 9:00 AM