Numerical Analysis
From Errors and Approximations to PDEs and Fourier Transforms
Numerical Analysis
Theory, Implementation, and Practice Problems
This course covers everything from basic error approximations to solving Partial Differential Equations and performing Fast Fourier Transforms. Each chapter includes rigorous mathematical theory, practical code examples, and practice problems to solidify your understanding.
Course Syllabus
Methods of Approximation and Errors
Truncation and round-off errors, accuracy, and precision.
Computer Programming
Programming fundamentals required for implementing numerical methods.
Roots of Equations
Bracketing methods (Bisection, False Position), Newton-Raphson, and Linear Algebraic Equations.
System of Nonlinear Equations
Bisection, Newton’s method, and Fixed-point iteration for non-linear systems.
Numerical Differentiation
Finite difference approximation (Taylor series) and differentiation using curve fitting.
Numerical Integration
Rectangle, midpoint, Trapezoidal, Simpson’s methods, and Gauss quadrature.
Ordinary Differential Equations
Euler’s method, Runge-Kutta methods, boundary value, and eigenvalue problems.
Fourier Approximation
Introduction, Discrete Fourier Transform (DFT), and Fast Fourier Transform (FFT).