NUMRCL ALGORTHMS-COMPLEXITY I
Prerequisite: knowledge of a programming language. Some knowledge of differential equations and linear algebra is desirable. Modern theory and practice of computation on digitial computers. Design and analysis of numerical algorithms. Techniques for analyzing computational complexity and errors. Solutions of nonlinear equations, polynomial equations, linear systems, interpolation, approximation, eigenvalues and eigenvectors, optimization, ordinary and partial differential equations. Some of these topics are covered in the sequel, Comp. Sci. W4242.
Subject: Computer Science(COMS)
School: School of the Arts, Barnard College, Columbia College, School of General Studies, Graduate School of Arts and Sciences, School of International and Public Affairs, Continuing Education and Special Programs
Course ID: 4241