MATH 352 - Numerical Analysis

Unit(s): 4

Selected numerical and iterative processes for solving mathematical problems and their applications. Topics include finding roots with bisection and Newton’s method; solving systems of linear equations using LU decomposition and Gauss-Seidel methods; polynomial approximation using Taylor’s Theorem, Lagrange interpolations, and the theory of spline functions; numerical integration using Simpson’s rule and Gaussian integration; numerical solutions to ODEs using Euler’s and modified Euler’s method.

Prerequisite(s): Prerequisites: Grade of C- or better in MATH 241 (may take concurrently), MATH 180 or CS 115 or consent of instructor.
Typically Offered Fall Only May Be Repeated Repeatable for credit..
Grading: OPT