Scribd
Upload
81 views1 page

Syllabus For MAT 280 - Numerical Analysis I

This course covers numerical analysis techniques for solving equations, interpolation, differentiation, integration, and systems of linear equations. Students will learn iterative methods, Newton's method, interpolation, numerical differentiation, Newton-Cotes integration formulas, and direct and iterative methods for solving systems of linear equations. Computational work using Python or MATLAB is required. The course aims to teach algorithms for obtaining approximate solutions to problems in mathematics and their implementation in computer programs.

Uploaded by

sagrv
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
81 views1 page

Syllabus For MAT 280 - Numerical Analysis I

This course covers numerical analysis techniques for solving equations, interpolation, differentiation, integration, and systems of linear equations. Students will learn iterative methods, Newton's method, interpolation, numerical differentiation, Newton-Cotes integration formulas, and direct and iterative methods for solving systems of linear equations. Computational work using Python or MATLAB is required. The course aims to teach algorithms for obtaining approximate solutions to problems in mathematics and their implementation in computer programs.

Uploaded by

sagrv
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Syllabus for MAT 280 Numerical Analysis I

Credits (Lec:Tut:Lab) = 3:0:1 (3 lectures and 1 two-hour lab weekly)

Prerequisites: MAT 101 Calculus I, MAT 260 Linear Algebra or equivalent. MAT 102 Calculus II or
MAT 202 Mathematical Methods can be considered in lieu of MAT 260.

Overview: Numerical Analysis takes up the problems of practical computation that arise in
various areas of mathematics. The focus is on algorithms for obtaining approximate solutions,
and their implementation by computer programs.

Detailed Syllabus:
1. Solving Equations: Iterative methods, Bisection method, Secant method, Newton-
Raphson method, Rates of convergence, Roots of polynomials.

2. Interpolation: Lagrange and Hermite interpolation, Interpolating polynomials using


difference operators.

3. Numerical Differentiation: Methods based on interpolation, methods based on finite


difference operators.

4. Numerical Integration: Newton-Cotes formula, Gauss quadrature, Chebyshevs formula.

5. Systems of Linear Equations: Direct methods (Gauss elimination, Gauss-Jordan method,


LU decomposition, Cholesky decomposition), Iterative methods (Jacobi, Seidel, and
Relaxation methods)

6. Labs: Computational work using either Python or Matlab.

Main References:
1. E. Suli and D. Mayers, Introduction to Numerical Analysis, Cambridge University Press,
2003.
2. R.L. Burden and J.D. Faires, Numerical Analysis, Cengage Learning, 9th Edition, 2010.

Other References:
1. M.K. Jain, S.R.K. Iyengar, and R.K. Jain, Numerical Methods for Scientific and Engineering
Computation, New Age International Ltd., 1999.
2. J.H. Mathews and K. Fink, Numerical Methods using Matlab, PHI Learning, 4 th Edition,
2003.

You might also like