CoDaDri: Difference between revisions
| Line 60: | Line 60: | ||
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems] | |||
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems] | |||
\\ | |||
Homework: [https://drive.google.com/file/d/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-/view?usp=sharing Download] | |||
'''Friday, September 17, 2020''' | |||
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling | |||
* [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing Lecture 3]: Errors and Precision | * [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing Lecture 3]: Errors and Precision | ||
| Line 86: | Line 87: | ||
'''Friday, October 1, 2020''' | '''Friday, October 1, 2020''' | ||
[https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 6]: Importance sampling | |||
[https://drive.google.com/ | [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems] | ||
Homework 2: [https://drive.google.com/file/d/1lTgHlAvWAKhkZK13_yihmPxGzD3qo7ko/view?usp=sharing Download] | Homework 2: [https://drive.google.com/file/d/1lTgHlAvWAKhkZK13_yihmPxGzD3qo7ko/view?usp=sharing Download] | ||
| Line 96: | Line 97: | ||
'''Friday, October 5, 2020''' | '''Friday, October 5, 2020''' | ||
| Line 109: | Line 102: | ||
[https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 7]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems] | [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 7]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems] | ||
Revision as of 14:31, 2 August 2021
Computational and Data Driven Physics
Modern physics is characterized by an increasing complexity of systems under investigation, in domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate models to describe these systems and being able to make quantitative predictions from those models is extremely challenging.
Course description
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes.
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems.
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not
on programming and heavy numerics! You will have to hand in 3 homeworks.
The Team
- Alberto Rosso (Computationa Physics)
- Remy Monasson (Data Driven Physics)
- Simona Cocco & Michel Ferrero (Tutorials)
Where and When
- Lectures on Fridays: 14:00-16:00
- Tutorials on Fridays: 16:00-18:00
- ENS, 29 rue D'Ulm, salle Borel + Djebar
Computer Requirements
No previous experience in programming is required.
Programming Language: Python
For practical installation, we recommand either to use Anaconda (See Memento Python) or use google colab.
The Colaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free, all by writting a jupyter notebook that you can then share.
Grading
Homeworks (50% of the mark) + 1 MCQ (50% of the final mark)
Schedule
Friday, September 3, 2020
- Lecture 1 Introduction to Monte Carlo
- Tutorial 1 Markov Matrix
Friday, September 10, 2020
- Tutorial 2 Markov matrix problems
- Tutorial 3 Thumb rule problems
\\ Homework: Download
Friday, September 17, 2020
- Lecture 2 Basic Sampling
- Lecture 3: Errors and Precision
Friday, September 24, 2020
- Lecture 4: Ising model and phase transitions
- Tutorial 4: Ising model and phase transitions problems
Friday, October 1, 2020
Lecture 6: Importance sampling
Tutorial 6: Faster than the clock algorithms problems
Homework 2: Download
Friday, October 5, 2020
Lecture 7: Optimization & Dijkstra algorithm
Tutorial 7: Simulated annealing problems