4.0

Average Course Rating

This course offers a broad introduction to the area of numerical computation in the mathematical sciences. Topics include but may not be limited to: floating point numbers, linear systems, LU factorization, vector and matrix norms, conditioning of linear systems, QR factorizations, the root finding problem, fixed point iterations, Newton’s method in one variable and for nonlinear systems, interpolation, cubic splines, finite differences, numerical integration, initial-value problems for ODEs, Euler’s method, systems of differential equations, Runge-Kutta methods, eigenvalue and singular value decomposition of matrices, polynomial approximation, shooting methods for boundary-value problems; time permitting: basic finite-difference methods for the solution of PDEs. The prerequisites are linear algebra, multivariable calculus, and differential equations; however, the latter may be taken concurrently.