AM213: Numerical Solutions of Differential Equations

Teaches basic numerical methods for numerical linear algebra and, thus, the solution of ordinary differential equations (ODEs) and partial differential equations (PDEs). Covers LU, Cholesky, and QR decompositions; eigenvalue search methods (QR algorithm); singular value decomposition; conjugate gradient method; Runge-Kutta methods; error estimation and error control; finite differences for PDEs; stability, consistency, and convergence. Basic knowledge of computer programming is needed. Enrollment restricted to graduate students or permission of instructor.

5 credits

Year Fall Winter Spring Summer

Formerly AMS 0213

While the information on this web site is usually the most up to date, in the event of a discrepancy please contact your adviser to confirm which information is correct.