MIE335H1: Algorithms & Numerical Methods

Fixed Credit Value
0.50
Hours
38.4L/12.8T/12.8P
Description

Algorithmic analysis, big-O asymptotic analysis; numerical linear algebra, solution techniques for linear and non-linear systems of equations; matrix factorization, LU and Cholesky factorization, factorization in the revised simplex method; Newton's method, Gale-Shapley method, greedy methods for combinatorial optimization, branch-and-bound search methods; graph theory and graph theoretic algorithms; design and implementation of algorithms to optimize mathematical models.

Prerequisite
Total AUs
51.20