SHAW UNIVERSITY

MAT 417: NUMERICAL ANALYSIS

COURSE OUTLINE

 

Instructor:Dr. Simon Ugwuoke            Office Phone: 546-8543

Office Hours:                         e-mail: sugwuoke@shawu.edu

MWF 12N - 1PM, 2PM - 3PM                  Office Location: Graphics Rm 4

T,Th 10:50AM - 11:50AM, 1:20PM - 2:20PM

Text      

Ward Cheney & David Kincard, Numerical Mathematics and Computing,

Copyright (C) 2004 Wadsworth, a division of Thompson Learning, Inc.

Reference

Burden, Richard L. & Faires J. Douglas, Numerical Analysis, Brooks/Cole

Publishing Company, Pacific Grove, CA 93950, Sixth Edition, 1997.

 

General Description

This course is designed for students in mathematics, mathematics education, physical sciences, and pre-engineering programs. The prerequisite for this course is MAT 203-calculus III or the equivalent. A knowledge of a programming language such as Basic, QuickBasic, Visual Basic, FORTRAN, or C/C++ will be needed, although not required. Maples and graphing calculators, and any other problem-solving software will be used as appropriate. It is designed to meet the needs of students wishing to gain knowledge in the theory of computational procedures (including the use of computer and graphing calculator) involving the solution of linear systems, algebraic and transcendental equations, approximation of roots of complex equations, approximation of functions by interpolating polynomials, and numerical differentiation and integration.

Course Outline

After completing this course successfully, students should be able to do the following:

· Approximate and compute functions using Taylor Series.

· Use computer and graphics calculator to solve complex problems in

  Numerical Analysis. (NCDPI 8.4)

· Use one of the programming languages listed above to solve problems in

  Numerical Analysis, such as approximating the root of a function. (NCDPI 4.7, 8.4)

· Write a simple computer program for generating a table of iterations of roots, such

  as in the Bisection or Newton's method of estimating roots of a function. (NCDPI 4.7)

· Demonstrate an understanding of the basic sources of error in computations

  and how these errors are minimized.

· Demonstrate an understanding of computer representation of numbers and

  change of bases between binary, octal, decimal, and hexadecimal.

· Locate roots of equations using the bisection method, secant method,

  and Newton’s method.

· Interpolate functions by polynomials.

· Demonstrate an understanding of the numerical differentiation of a function.

· Demonstrate an understanding of the numerical integration of a function.

· Apply trapezoidal and Simpson’s rules in numerical integration of functions.

· Solve a system of n linear equations in n unknowns using Gaussian

  elimination, and using computer and graphing calculators.

 

TOPIC OUTLINE

1.1 Mathematical Preliminaries

    Nested Multiplication, pg.2; Absolute & Relative errors, pg.4;

     Rounding and Chopping errors, pg.4; Programming Experiment, pg.6

     [Ref. (Burden & Faires, 1.1) Rolle's Theorem, pg.4; Mean-value

     Theorem, pg.5(NCDPI 3.2, 3.4); Intermediate Value Theorem, pg.10]   

1.2 Review of Taylor Series

    Taylor Series, pg. 17

    Taylor's Theorem (NCDPI 3.2)

    Taylor and Maclaurin series

    Taylor and Maclaurin's polynomials

    Power and Binomial Series

2   Number Representation and Errors

    Errors in Numerical Analysis and Computer Arithmetic (NCDPI 3.1, 3.3)

    Machine number: mantissa and characteristic

    Computer representation of numbers

    Roundoff errors, Errors due to underflow and overflow, Other errors

    Absolute error and Relative error, Significant digits

    Base B Numbers; Conversion of Integer Parts

    Conversion of Fractional Parts

    Base Conversion: 10 <----> 8 <----> 2 <---->16

Chapter 3 Locating Roots of Equations

3.1 The Bisection Method (also called Binary-search Method) (NCDPI 3.2)

3.2 The Newton's Method     3.3 Secant Method

    Advantages and Disadvantages of each method

    Comparison of the three methods;  Convergence Analyses

    in these methods; Comparison of the methods

    Computer Algorithms related to each method

    Zeros of Polynomials; Synthetic division; Horner's method

Chapter 4: Interpolation and Numerical Differentiation

4.1 Polynomial Interpolation:

    Lagrange Form; Divided Differences (NCDPI 3.3)

    Newton's interpolatory divided difference formula

    Newton's forward-difference formula

    Newton's backward-difference formula

    Centered-difference formulas

4.2 Errors in Polynomial Interpolation

4.3 Estimating Derivatives and Richardson Extrapolation(NCDPI 3.4)

Chapter 5 Numerical Integration

5.1 Definite Integral

    Elements of Numerical Integration (NCDPI 3.4)

5.2 Trapezoidal Rule

Chapter 6 More on Numerical Integration

6.1 Simpson's Rule;    6.2 Gaussian Quadrature Formulas

    Errors of Numerical Integration

    Multiple Integrals (NCDPI 3.4, 8.4)

Chapter 7 Systems of Linear Equations

    Linear Systems of Equations (NCDPI 1.1, 1.2)

    Linear Algebra and Matrix Inversion (NCDPI 1.1, 1.2)

    The Determinant of a Matrix

Chapter 10 Ordinary Differential Equations

    The elementary Theory of Initial-Value Problems (NCDPI 3.4)

    Taylor Series Methods; Euler's Method

Chapter 12 Smoothing of Data and Method of Least Squares

    12.1 Method of Least Squares: Linear Least-Squares

 

Evaluation

Assignments/Quizzes/Class Participation  30% of final grade

Hourly Tests                             40% of final grade

Final exam                               30% of final grade

 

Attendance Policy

Regular class attendance and punctuality in this course are stressed.

More than two unexcused absences may lead to a grade of NC (an F grade).

Note that this class meets only two times a week (75 min each).

Two absences are equivalent (class time-wise) to a whole week lost!!

 

Student Classroom Decorum Expectations

To enhance the learning atmosphere of the classroom, students are expected to dress and behave in a fashion conducive to learning in the classroom. More specifically, students will refrain from disruptive classroom behavior, e.g., talking to classmates, disrespectful responses to teacher instructions; swearing; wearing clothes that impede academic learning such as but not limited to, wearing body-revealing clothing and excessively baggy pants; hats/caps, and/or headdress. Students will turn off telephones prior to entering the classroom.

Students who exhibit the behaviors described above, or similar behaviors will be immediately dismissed from class at the third documented offense. The student will be readmitted to class only following a decision by the department chair. The student may appeal the decision of the department chair to the Dean of the College offering the course, and, subsequently, to the Office of the Vice President for Academic Affairs, and then to the President of Shaw University. The decision of the President will be final. Failure to follow the procedures herein outlined will result in termination of the appeal, and revert to the decision of the department chair.

Each behavior construed by the teacher/professor as non-contributive to learning will be recorded, properly documented, and appropriately reported to the student and to the chair of the academic department offering the course. The report will be in written form with a copy provided to both the student and the department chair. The faculty member should retain a copy for his/her own records.

Additional student behavior codes may be found in Student Affairs.