CS 457 - Numerical Methods II

Spring 2011

Numerical Methods IICS457NM50116LEC30930 - 1045 T R  1103 Siebel Center for Comp Sci William D Gropp

Official Description

Continuation of CS 357. Orthogonalization methods for least squares, Krylov subspace methods, non-linear equations and optimization in multiple dimensions, initial and boundary value problems for ordinary and partial differential equations. Course Information: No graduate credit. Credit is not given for both CS 457 and CS 450. Prerequisite: CS 357.

Course Director

Learning Goals

Construct and analyze the numerical approximation to ordinary differential equations (1)(2)
Construct and analyze the numerical approximation to partial differential equations (1)(2)
Assess sparse matrix problems and their connection with graphs and partial differential equations (1)(6)
Attain a working knowledge of approximating solutions to a variety of differential and algebraic equations in the context of applications (1)

Use computer software to solve problems in numerical differential equations. (1)(6)

Topic List

Initial Value Problems and Finite Differences
Boundary Value Problems and Finite Differences

Numerical Linear Algebra

Required, Elective, or Selected Elective

Selected Elective.

Last updated

2/18/2019by Luke Olson