User Tools

Site Tools


spin:esc202_fs2021

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
spin:esc202_fs2021 [2021/03/15 14:06]
sebastian [List of assignments]
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 29: Line 31:
  
 08. Mar. 2021: {{ :​spin:​fs2021_week3.pdf |k-Nearest Neighbor Searching and SPH intro}} 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 84: Line 96:
 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! 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 (it should be a little smoother).+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.1615813583.txt.gz · Last modified: 2021/03/15 14:06 by sebastian