Mathematics of Computation
Lecture
Main Campus
Course Description
Notions of analysis and algorithms central to modern scientific computing: continuous and discrete Fourier expansions, the fast Fourier transform, orthogonal polynomials, interpolation, quadrature, numerical differentiation, analysis and discretization of initial-value and boundary-value ODE, finite and spectral elements. Prerequisites: Math 51 and 53.
MATH 118
Units: 4
See When It's Offered opens a new window opens in a new tab
Typically Offered
Not Available
Grading Basis
Letter or Credit/No Credit
Class Level
Undergraduate
Instructional Mode
In Person
Gen Ed Requirement(s)
WAYS - Formal Reasoning (FR)