spin:esc202_fs2021
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
spin:esc202_fs2021 [2021/03/01 14:15] stadel [Lectures] |
spin:esc202_fs2021 [2021/04/26 14:21] (current) stadel [Lectures] |
||
|---|---|---|---|
| Line 20: | Line 20: | ||
| [[http://www.ics.uzh.ch/~stadel/krone/public_downloads/esc202|ESC202 Video downloads]] | [[http://www.ics.uzh.ch/~stadel/krone/public_downloads/esc202|ESC202 Video downloads]] | ||
| + | |||
| + | **Appologies:** due to an error there was no sound in the recording of 29. Mar. As such it was of little use and I didn't bother uploading the video. | ||
| Line 27: | Line 29: | ||
| 01. Mar. 2021: {{ :spin:fs2021_week2.pdf |Nearest Neighbor Searching}} | 01. Mar. 2021: {{ :spin:fs2021_week2.pdf |Nearest Neighbor Searching}} | ||
| + | |||
| + | 08. Mar. 2021: {{ :spin:fs2021_week3.pdf |k-Nearest Neighbor Searching and SPH intro}} | ||
| + | |||
| + | 15. Mar. 2021: {{ :spin:fs2021_week4.pdf |SPH METHOD: Equations and kernels}} | ||
| + | |||
| + | 22. Mar. 2021: {{ :spin:fs2021_week5.pdf |SPH METHOD: part 2}} //Artificial Viscosity formula corrected!// | ||
| + | |||
| + | 29. Mar. 2021: {{ :spin:fs2021_week6.pdf |Kernels and a "Wind Tunnel"}} | ||
| + | |||
| + | 12. Apr. 2021: {{ :spin:fs2021_week7_inflow.pdf |Howto: inflow/outflow BCs}} and followed by the {{ :spin:fs2021_week7.pdf |2-D Ising Model}} | ||
| + | |||
| + | 26. Apr. 2021: {{ :spin:fs2021_week8.pdf |Travelling Salesperson Problem}} | ||
| ====== Assignments ====== | ====== Assignments ====== | ||
| Line 80: | Line 94: | ||
| 2. For each particle find (count) all the neighbor particles within some ball radius (small compared to the root cell size). How long does it take? How does it scale as you increase the number of particles, N, in the domain? Explain which method of intersection tests you used in your implementation. | 2. For each particle find (count) all the neighbor particles within some ball radius (small compared to the root cell size). How long does it take? How does it scale as you increase the number of particles, N, in the domain? Explain which method of intersection tests you used in your implementation. | ||
| + | 3. For each particle calculate the "top-hat" density from the 32 nearest neighbors and plot it using a colormap. Use first a linear search priority queue to get things working and then substitute a heap algorithm to implement "replace" and "max" functions. We will need the density to implement SPH so it needs to be well tested. Also, make sure it can work with periodic boundary conditions! | ||
| + | |||
| + | 4. Now, calculate the density using the Monaghan kernel defined in the lecture. Plot and compare to the density you get from the "top-hat" kernel (the Monaghan result should be a little smoother). | ||
| + | |||
| + | 5. Using the SPH method, simulate the movement of a fluid through a "wind tunnel" that contains an overdensity in the middle as it was described in the lecture **(due between April 12th and April 19th)**! | ||
| + | |||
| + | 6. 2D Ising Model: Using the Metropolis algorithm, plot the mean magnetization of a N by N grid of spins (+1 and -1) depending on the temperature. Visualise the spin state of the grid at different temperatures **(due April 26th)**! | ||
| + | |||
| + | 7. Metropolis algorithm II: Implement the traveling merchant problem **(due May 3rd)**! | ||
spin/esc202_fs2021.1614604522.txt.gz ยท Last modified: 2021/03/01 14:15 by stadel
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
