EE 202 COURSE DEFINITION FORM.doc

**COURSE INFORMATION**

The Newton’s method for root approximations, interpolation by Newton’s divided differences, interpolation by trigonometric functions, curve fitting by the least squares algorithm, series representation of functions (Fourier Series), solution of differential equations; Euler’s method, the Runge Kutta 4th degree method, the method of finite differences (FD), the finite element method (FEM), solution of integral equations; method of moments, optimization; convexity and convergence, the steepest descent method, the Gauss-Newton method, other algorithms than gradients such as the genetic algorithm.