Analysis of algorithms frequently used in mathematics, engineering and the physical sciences. Topics include sources of errors in digital computers, fixed point iteration, interpolation and polynomial approximation, numerical differentiation and integration, direct and iterative methods for solving linear systems, and iterative methods for nonlinear systems. Numerical experiments will be conducted using FORTRAN, C, or another appropriate high-level language. Prerequisites: MATH 270 and CSC 121
| Distribution Area | Prerequisites | Credits |
|---|---|---|
| MATH 270 and CSC 121 or permission of instructor | 1 course |