Honors Numerical Analysis
Formerly numbered MATH-UA 258; the content has not changed. Covers the analysis of numerical algorithms which are ubiquitously used to solve problems throughout mathematics, physics, engineering, finance, and the life sciences. Topics include: algorithms for solving nonlinear equations; optimization; finding eigenvalues/eigenvectors of matrices; computing matrix factorizations and performing linear regressions; function interpolation, approximation, and integration; basic signal processing using the Fast Fourier Transform; Monte Carlo simulation. An introduction to programming will be provided as it is an integral part of numerical analysis, but students should feel quite comfortable programming on their own (or be exceptionally willing to learn along the way). Programming experience is strongly recommended (e.g. Julia, Matlab, or NumPy), but not required (there is a programming component to this course).
Topics
- algorithms for solving nonlinear equations
- optimization
- finding eigenvalues/eigenvectors of matrices
- computing matrix factorizations and performing linear regressions
- function interpolation
- approximation
- and integration
- basic signal processing using the Fast Fourier Transform
- Monte Carlo simulation
Topics explicitly listed in official catalogue description
Sources
- Course catalogue ↗2026-2027