PHYS-332 / 3 credits
Withdrawal: It is not allowed to withdraw from this subject after the registration deadline.
Remark: Pas donné en 2023-2024
This course teaches the students practical skills needed for solving modern physics problems by means of computation. A number of examples illustrate the utility of numerical computations in various domains of physics.
Fourier series and transforms Introduction to the Fourier series and transforms and their application. Mathematical properties: convergence, convolution, correlation, Gibbs phenomenon and the Wiener-Khinchin theorem. Fourier transform on discrete sampled data: aliasing and sampling theorem. Discrete Fourier transform (DFT) and fast Fourier transform (FFT). Applications: spectral analysis, filters. Fourier transforms in higher dimensionality.
Linear systems Introduction and examples. Gauss-Jordan elimination, LU factorization. Iterative refinement: tridiagonal and band diagonal systems. Iterative methods and preconditioning: Jacobi, Richards and gradient methods. Conjugate gradient method. Iterative vs direct methods.
Matrix manipulation and eigenvalues problems Introduction and examples. Properties and decomposition. Poweriteration. QR decomposition and iterative procedure. Singular value decomposition (SVD).
1st and 2nd years numerical physics courses
By the end of the course, the student must be able to:
- Choose the most suitable algorithm for solving given problem
- Integrate algorithms in computer codes and evaluate their performance
- Solve actual physics problems using numerical tools
Ex cathedra presentations, exercises and work under supervision
3 reports during the semester
J. F. James, A Student's guide to Fourier transforms, CUP 2011
L. N. Trefethen and D. Bau III, Numerical linear algebra, SIAM 1997
Ressources en bibliothèque
In the programs
- Semester: Spring
- Exam form: During the semester (summer session)
- Subject examined: Computational physics III
- Lecture: 1 Hour(s) per week x 14 weeks
- Practical work: 2 Hour(s) per week x 14 weeks