Scribd
Upload
9 views

Syllabus

Students will learn basic concepts, problems and methods used in numerical computing. A knowledge of some high level programming language such as FORTRAN, C, or MATLAB is required. Two mini-exams during the semester (October 11, Monday; and November 22, Monday) and a final exam (December 15, Wednesday).

Uploaded by

Preet Singh
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

Syllabus

Students will learn basic concepts, problems and methods used in numerical computing. A knowledge of some high level programming language such as FORTRAN, C, or MATLAB is required. Two mini-exams during the semester (October 11, Monday; and November 22, Monday) and a final exam (December 15, Wednesday).

Uploaded by

Preet Singh
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CS 321-002, Introduction to Numerical Methods, Fall 2010 MWF 2:00am-2:50pm, C226-OHR. www.cs.uky.edu/jzhang/CS321/cs321.html INSTRUCTOR: Dr.

Jun Zhang, 763F PF Anderson Tower, e-mail: [email protected] phone: 257-3892, oce hours: WF 1:002:00pm and by appointment. Learning Outcomes Students will learn basic concepts, problems and methods used in numerical computing. Specically students will be able to: 1. estimate computed errors; 2. select/propose methods that yield small errors (if possible); 3. understand important properties for a number of basic methods (e.g., Gaussian elimination, Lagrange and spline interpolation, Trapezoidal and Simpsons quadratures, Newtons iteration, Runge-Kutta methods); 4. modify problems for better algorithm performance; 5. analyze results computed in -arithmetic. TEXT: W. Cheney and D. Kincaid, Numerical Mathematics and Computing (5th Ed., other editions are OK). TOPICS: 1. Number representation and errors, Ch. 2, 2. Locating roots of equations, Ch. 3, 3. Interpolation and numerical dierentiation, Ch. 4, 4. Numerical integration, Ch. 5, 5. Numerical solution of systems of linear equations, Ch. 7, 6. Approximation by spline functions, Ch. 9, 7. Smoothing of data and least squares, Ch. 12. PREREQUISITE: MA 213 and CS 221 or equivalent. A knowledge of some high level programming language such as FORTRAN, C, or MATLAB is required. HOMEWORK: Homeworks assigned in sheets will be collected within one week, will consist of theoretical problems or computer projects. Altogether there will be 5 or 6 collected homework assignments. Late submissions will not be accepted. Homework assignments are to be worked out independently. EXAMINATIONS: Two mini-exams during the semester (October 11, Monday; and November 22, Monday) and a nal exam (December 15, Wednesday). In case of legitimate reasons (see Student Rights and Responsibilities), students must inform the instructor in advance to schedule an exam that will take place before the exam for the whole class. Make-up exams after that will only be given in cases of unforeseen (legitimate) reasons and documented evidences for such reasons are required.

CHEATING: Students have to do the work by themselves. They can help each other with general concepts; however, direct assistance with a particular solution will be considered as cheating. Please refer to Student Rights and Responsibilities for more details concerning cheating; let me only remind that the minimum penalty for cheating is an E-grade. GRADE COMPOSITION: Homework 30%, Two mini-exams (25% each) 25%, Final 20% FINAL GRADE: Assigned according to the following scale A=90100%, B=8089%, C=7079%, D=6069%, E=059%

You might also like