Overview
Description
Numerical solution of linear systems, including linear programming; iterative solutions of non-linear equations; computation of eigenvalues and eigenvectors, matrix diagonalization. (CS 466 and MATH 466 are cross-listed; credit may be earned in one of the two.)
Requirements
Prerequisites
MATH 330
Original catalog text
Prerequisites
Prerequisite(s): MATH 330.
Units
Lecture3
Catalog Details
Offering
Offered: Every Fall
Terms
fall
Related Courses
Cross Listed With CS 466
Attributes
Standard
Learning Outcomes
- implement a numerical method to solve a nonlinear equation: e.g. bisection method, Newton’s method.
- solve linear systems using direct and iterative methods.
- construct interpolating functions.