Math 322: Algorithm Design and Optimization 2

From MathWiki
Revision as of 12:51, 6 June 2012 by Ls5 (Talk | contribs) (Prerequisites)

Jump to: navigation, search

Catalog Information

Title

Computation and Optimization 2

(Credit Hours:Lecture Hours:Lab Hours)

(3:3:1)

Offered

W

Prerequisite

Math 320; concurrent with Math 346, Math 323

Description

A treatment of algorithms used to solve dynamic programming problems and advanced computing problems. Specific topics include finite-horizon and infinite-horizon dynamic programming, discrete transforms, compressed sensing, heuristics, branch and bound, conditioning and stability.

Desired Learning Outcomes

Prerequisites

Math 320; concurrent with Math 346, Math 323

Minimal learning outcomes

Textbooks

Possible textbooks for this course include (but are not limited to):

Additional topics

Courses for which this course is prerequisite