Numerical Methods
mathematics
about this course
This is a course in numerical analysis for mathematics students which means that the algorithms are motivated from mathematical theorems and the convergence analysis of these algorithms converts those theorems into quantitative estimates. For example, Taylor’s theorem serves as motivation for many algorithms for solving algebraic as well as differential equations. Broadly, this course will cover floating point arithmetic and errors they produce, numerical linear algebra, root-finding, polynomial interpolation, numerical integration and differentiation, numerical solutions of ordinary differential equations, and optimization. This course will have a computational component which will involve learning a programming language (Julia) to implement the algorithms of this course.
After this course, you will know a variety of standard numerical algorithms in linear algebra, root-finding, interpolation, integration, ODEs, optimization that are relevant in applications. You will also have learnt how to implement these algorithms on a computer and be wary of errors and artifacts.
in these programmes
- computer science
elective · 4-year major, 4-year double major, 3-year major, 3-year double major, 4-year minor, 3-year minor
- mathematics
one of a choice · 4-year major, 4-year double major, 3-year major, 3-year double major
elective · 4-year minor, 3-year minor, concentration (4-year), concentration (3-year)
planning & teaching
before this
recently taught by
- Vivek TewaryAssistant Professor, Mathematics
Recorded in 2026 T2, 2025 T2, 2024 T2. Instructors may change.