In this paper the rate of convergence, speed of execution and symplectic properties of the time-integrators Leap-Frog (LF2), fourth order Runge-Kutta(RK4) and Crank-Nicholson (CN2) have been studied. This was done by solving the one-dimensional model for a particle in a box (Dirichlet-conditions). The results show that RK4 is the fastest in achieving higher tolerances, while CN2 is the fastest in achieving lower tolerances. Fourth order corrections of LF (LF4)and CN (CN4) were also studied, though these showed no improvements overLF2 and CN2. All methods were shown to exhibit symplectic behavior.
Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:uu-208878 |
Date | January 2013 |
Creators | Christoffer, Zakrisson |
Publisher | Uppsala universitet, Tillämpad beräkningsvetenskap |
Source Sets | DiVA Archive at Upsalla University |
Language | Swedish |
Detected Language | English |
Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
Format | application/pdf |
Rights | info:eu-repo/semantics/openAccess |
Relation | TVE ; TVE 13010 maj |
Page generated in 0.002 seconds