COMS W4241y - Numerical Algorithms and Complexity

Institution:

Barnard College

Subject:

Description:

Modern theory and practice of computation on digital computers. Introduction to concepts of computational complexity. Design and analysis of numerical algorithms. Applications to computational finance, computational science, and computational engineering. - J. Traub Prerequisites: Knowledge of a programming language. Some knowledge of scientific computation is desirable. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect: 3. 3 pts.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.barnard.edu

Phone Number:

(212) 854-5262

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.