Randomized response: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
 
en>Jiangmingshan
Line 1: Line 1:
Hello and welcome. My title is Figures Wunder. California  over the counter [http://www.dhspoteh.co.kr/xe/index.php?document_srl=331302&mid=Sports std testing at home] test is our beginning place. Since she was 18 she's been operating as a [http://Www.healthline.com/health/std/genital-herpes receptionist]  std home test but her promotion never comes. The preferred hobby for my children and me  over the counter std test is to perform baseball and I'm attempting to make it a profession.<br><br>My web blog - at [http://drupal.12thirty4.com/gmaps/node/4991 home std test kit] std testing ([http://faculty.jonahmancini.com/groups/solid-advice-for-dealing-with-a-candida-albicans/members/ please click faculty.jonahmancini.com])
In [[mathematics]], the '''Runge–Kutta method''' is a technique for the approximate [[numerical analysis|numerical solution]] of a [[stochastic differential equation]]. It is a generalization of the [[Runge–Kutta methods|Runge–Kutta method]] for [[ordinary differential equation]]s to stochastic differential equations.
 
Consider the [[Itō diffusion]] ''X'' satisfying the following Itō stochastic differential equation
 
:<math>{\mathrm{d} X_{t}} = a(X_{t}) \, \mathrm{d} t + b(X_{t}) \, \mathrm{d} W_{t},</math>
 
with [[initial condition]] ''X''<sub>0</sub>&nbsp;=&nbsp;''x''<sub>0</sub>, where ''W''<sub>''t''</sub> stands for the [[Wiener process]], and suppose that we wish to solve this SDE on some interval of time [0,&nbsp;''T'']. Then the '''Runge–Kutta approximation''' to the true solution ''X'' is the [[Markov chain]] ''Y'' defined as follows:
 
* partition the interval [0,&nbsp;''T''] into ''N'' equal subintervals of width ''δ''&nbsp;=&nbsp;''T''&nbsp;⁄&nbsp;''N''&nbsp;&gt;&nbsp;0:
 
:<math>0 = \tau_{0} < \tau_{1} < \dots < \tau_{N} = T;</math>
 
* set ''Y''<sub>0</sub>&nbsp;=&nbsp;''x''<sub>0</sub>;
 
* recursively define ''Y''<sub>''n''</sub> for 1&nbsp;≤&nbsp;''n''&nbsp;≤&nbsp;''N'' by
 
:<math>Y_{n + 1} = Y_{n} + a(Y_{n}) \delta + b(Y_{n}) \Delta W_{n} + \frac{1}{2} \left( b(\hat{\Upsilon}_{n}) - b(Y_{n}) \right) \left( (\Delta W_{n})^{2} - \delta \right) \delta^{-1/2},</math>
 
: where
 
:<math>\Delta W_{n} = W_{\tau_{n + 1}} - W_{\tau_{n}}</math>
 
: and
 
:<math>\hat{\Upsilon}_{n} = Y_{n} + a(Y_n) \delta + b(Y_{n}) \delta^{1/2}.</math>
 
Note that the [[random variables]] Δ''W''<sub>''n''</sub> are [[independent and identically distributed]] [[normal distribution|normal random variables]] with [[expected value]] zero and [[variance]] ''δ''.
 
This scheme has strong order 1, meaning that the approximation error of the actual solution at a fixed time scales with the time step ''δ''. It has also weak order 1, meaning that the error on the statistics of the solution scales with the time step ''δ''. See the references for complete and exact statements.  
 
The functions ''a'' and ''b'' can be time-varying without any complication. The method can be generalized to the case of several coupled equations; the principle is the same but the equations become longer. Higher-order schemes also exist, but become increasingly complex.
 
==References==
 
* {{cite book | author=Kloeden, P.E., & Platen, E. | title=Numerical Solution of Stochastic Differential Equations | publisher=Springer | location=Berlin | year=1999 | isbn=3-540-54062-8 }}
 
{{DEFAULTSORT:Runge-Kutta Method (Sde)}}
[[Category:Numerical differential equations]]
[[Category:Stochastic differential equations]]

Revision as of 22:05, 23 September 2013

In mathematics, the Runge–Kutta method is a technique for the approximate numerical solution of a stochastic differential equation. It is a generalization of the Runge–Kutta method for ordinary differential equations to stochastic differential equations.

Consider the Itō diffusion X satisfying the following Itō stochastic differential equation

with initial condition X0 = x0, where Wt stands for the Wiener process, and suppose that we wish to solve this SDE on some interval of time [0, T]. Then the Runge–Kutta approximation to the true solution X is the Markov chain Y defined as follows:

  • partition the interval [0, T] into N equal subintervals of width δ = T ⁄ N > 0:
  • set Y0 = x0;
  • recursively define Yn for 1 ≤ n ≤ N by
where
and

Note that the random variables ΔWn are independent and identically distributed normal random variables with expected value zero and variance δ.

This scheme has strong order 1, meaning that the approximation error of the actual solution at a fixed time scales with the time step δ. It has also weak order 1, meaning that the error on the statistics of the solution scales with the time step δ. See the references for complete and exact statements.

The functions a and b can be time-varying without any complication. The method can be generalized to the case of several coupled equations; the principle is the same but the equations become longer. Higher-order schemes also exist, but become increasingly complex.

References

  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534