Close Menu

MATH 579 - Complexity of Numerical Problems

Course Description: 

This course is concerned with a branch of complexity theory. It studies the intrinsic complexity of numerical problems, that is, the minimum effort required for the approximate solution of a given problem up to a given error. Based on a precise theoretical foundation, lower bounds are established, i.e. bounds that hold for all algorithms. We also study the optimality of known algorithms, and describe ways to develop new algorithms if the known ones are not optimal.

Credit: 

(3-0-3)

Prerequisite: 

[(MATH 350 with min. grade of C)]

Corequisite: 

None

Attachments: