Semi-implicit Euler method: Difference between revisions

Content deleted Content added
light copyedit - needs more work; I'll ask the author for some clarifications
Added references
Line 18:
 
where <math> \Delta t </math> is the timestep.
 
Note the difference from the Euler method: <math>x_{n+1}</math> depends on <math>v_{n+1}</math> rather than <math>v_n</math>.
 
== See also ===
* [[Numerical ordinary differential equations]]
 
== References ==
 
{{cite book |last= Giordano
|first= Nicholas J.
|coauthors= Hisao Nakanishi
|title= Computational Physics
|edition= 2nd
|publisher= Benjamin Cummings
|year= 2005
|month= July
|language= English
|isbn= 0-1314-6990-8 }}
 
{{cite web
| last = James
| first = MacDonald
| authorlink = http://www.physics.udel.edu/~jim
| title = The Euler-Cromer method
| publisher = [[University of Delaware]]
| url = http://www.physics.udel.edu/~jim/Ordinary%20Differential%20Equations/Euler-Cromer%20Method.htm
| accessdate = 2007-03-03}}