GE 611 - Numerical Methods

• No course learning outcomes appended

• Computer Programming
• Differential equations and Laplace Transform

• Taylor series, Error propogation, Numerical Differentiation, Forward-Backward-Central difference formulations of First and Second derivatives, Richardson’s Extrpolation
• Numerical Integration: Newton-Gregory forward formula for interpolation, Trapezoidal rule, Simpson’s rules, Boole’s rule, Romberg Integration
• Root finding methods: Bisection, False position, Fixed-point iteration, Newton-Raphson, Secant, Modified Secant
• Ordinary Differential Equations: Initial Value problems, Euler’s method, Heun’s method, Runge-Kutta methods- Third order and Fourth Order, Stiff equations: Implicit Euler’s method, Adam’s solvers: Explicit and Implicit methods, Milne’s predictor-corrector methods