<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://openelectrical.org/index.php?action=history&amp;feed=atom&amp;title=Explicit_Numerical_Integrators</id>
	<title>Explicit Numerical Integrators - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://openelectrical.org/index.php?action=history&amp;feed=atom&amp;title=Explicit_Numerical_Integrators"/>
	<link rel="alternate" type="text/html" href="http://openelectrical.org/index.php?title=Explicit_Numerical_Integrators&amp;action=history"/>
	<updated>2026-04-28T02:51:59Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.35.0</generator>
	<entry>
		<id>http://openelectrical.org/index.php?title=Explicit_Numerical_Integrators&amp;diff=138&amp;oldid=prev</id>
		<title>Jules: Created page with &quot;== Modified Euler Method ==  The modified Euler (or Heun's) method is a two-stage [http://en.wikipedia.org/wiki/Predictor%E2%80%93corrector_method predictor-corrector method]:...&quot;</title>
		<link rel="alternate" type="text/html" href="http://openelectrical.org/index.php?title=Explicit_Numerical_Integrators&amp;diff=138&amp;oldid=prev"/>
		<updated>2020-11-22T08:14:03Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;== Modified Euler Method ==  The modified Euler (or Heun&amp;#039;s) method is a two-stage [http://en.wikipedia.org/wiki/Predictor%E2%80%93corrector_method predictor-corrector method]:...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;== Modified Euler Method ==&lt;br /&gt;
&lt;br /&gt;
The modified Euler (or Heun's) method is a two-stage [http://en.wikipedia.org/wiki/Predictor%E2%80%93corrector_method predictor-corrector method]:&lt;br /&gt;
&lt;br /&gt;
Predictor stage:&lt;br /&gt;
: &amp;lt;math&amp;gt; \boldsymbol{\tilde{x}}(t + \Delta t) = \boldsymbol{x}(t) + \Delta t \boldsymbol{f}(\boldsymbol{x}(t), t) \, &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Corrector stage:&lt;br /&gt;
: &amp;lt;math&amp;gt; \boldsymbol{x}(t + \Delta t) = \boldsymbol{x}(t) + \frac{\Delta t}{2} \left[ \boldsymbol{f}(\boldsymbol{x}(t), t) + \boldsymbol{f}(\boldsymbol{\tilde{x}}(t + \Delta t), t) \right] \, &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== 4th-Order Runge Kutta Method ==&lt;br /&gt;
&lt;br /&gt;
The 4th-order Runge-Kutta algorithm is one of the most popular numerical integration methods for power systems. &lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt;\boldsymbol{k}_{1} = \Delta t \boldsymbol{f}(\boldsymbol{x}(t), t) \, &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt;\boldsymbol{k}_{2} = \Delta t \boldsymbol{f}(\boldsymbol{x}(t) + \frac{\boldsymbol{k}_{1}}{2}, t + \frac{\Delta t}{2}) \, &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt;\boldsymbol{k}_{3} = \Delta t \boldsymbol{f}(\boldsymbol{x}(t) + \frac{\boldsymbol{k}_{2}}{2}, t + \frac{\Delta t}{2}) \, &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt;\boldsymbol{k}_{4} = \Delta t \boldsymbol{f}(\boldsymbol{x}(t) + \boldsymbol{k}_{3}, t + \Delta t) \, &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt; \boldsymbol{x}(t + \Delta t) = \boldsymbol{x}(t) + \frac{1}{6} \left( \boldsymbol{k}_{1} + 2 \boldsymbol{k}_{2} + 2 \boldsymbol{k}_{3} + \boldsymbol{k}_{4} \right) \, &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Modelling / Analysis]]&lt;/div&gt;</summary>
		<author><name>Jules</name></author>
	</entry>
</feed>