Provides fundamental numerical algorithms including linear computations,
Fourier transform, ordinary differential equations, finite element
method, random numbers, digital filtering, and digital image processing.
Students will write programs on these topics to understand and to use
practically the algorithms. (Dept. Mechanical Eng. / Robotics, B3)
|
1st | 4/13 | Introduction: Analytical solution, Numerical solution |
| 2nd | 4/20 | MATLAB: vectors and matrices, matrix manipulation, graphs |
| 3rd | 4/27 | ODE: canonical forms of ordinary differential equations, Euler/Heun/Runge-Kutta methods |
| 4th | 5/ 9 | ODE: Runge-Kutta-Fehlberg method, holonomic constraints, constraint stabilization method (CSM) |
| 5th | 5/11 | Linear equations: LU decomposition, pivot selection, solving linear equations |
| 6th | 5/18 | Linear equations: properties of triangular matrices, determinants and inverse matrices, Cholesky decomposition |
| 7th | 5/25 | (1st quiz) ODE, Linear equations |
| 8th | 6/ 6 | Projection: least square meth, projection matrix, Gram-Schmidt orthogonalization, QR decomposition |
| 9th | 6/ 8 | Interpolation: piecewise linear interpolation, spline interpolation |
| 10th | 6/15 | FEM: shape functions, stiffness matrix, static deformation of beam |
| 11th | 6/22 | FEM: inertia matrix, dynamic deformation of beam |
| 12th | 6/29 | (2nd quiz) Projection, Interpolation, FEM |
| 13th | 7/ 6 | Probabilistic algorithm: random numbers, Monte Carlo method |
| 14th | 7/13 | Fourier transform: discrete Fourier transform (DFT), fast Fourier transform (FFT) |
| 15th | 7/20 | Fourier transform: matched filter, phase-only correlation method |
