Semi-implicit Euler method: Difference between revisions

Content deleted Content added
Numsgil (talk | contribs)
m it's known by a lot of names!
Numsgil (talk | contribs)
m renaming in the article itself
Line 3:
== Setting ==
 
The Euler–Cromersemi–implicit algorithmEuler method can be applied to a pair of [[differential equation]]s of the form
 
:<math> {dx \over dt} = f(t,v) </math>
Line 19:
== The method ==
 
The Euler–Cromersemi–implicit algorithmEuler method produces an approximate [[Discrete mathematics|discrete]] solution by iterating
 
:<math> v_{n+1} = v_n + g(t_n, x_n) \, \Delta t \quad</math>
Line 39:
:<math> {dv \over dt} = -{k \over m}x. \quad</math>
 
The Euler–Cromersemi–implicit algorithmEuler for this equation is
 
:<math>v_{n+1} = v_n - {k \over m}x_n\Delta t \quad</math>