Jump to content

Markov chain approximation method

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jorge Guerra Pires (talk | contribs) at 19:14, 28 July 2014 (Created page with ' In the realm of numerical methods for stochastic differential equations, the '''markov chain approximation method''' belongs to the several numerical (s...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In the realm of numerical methods for stochastic differential equations, the markov chain approximation method belongs to the several numerical (schemes) approaches used nowadays on stochastic control theory. Regrettably the simple adaptation of the deterministic schemes for matching up to stochastic models such as the Runge-Kutta method does not work at all.

It is a powerful and widely usable set of ideas, due to the current infancy of stochastic control it might be even said 'insights.' for numerical and other approximations problems in stochastic processes [1]. See also [2]. They represent counterparts from deterministic control theory such as optimal control theory.

References

  1. ^ Harold J Kushner, Paul G Dupuis, Numerical methods for stochastic control problems in continuous time, Applications of mathematics 24, Springer- Verlag, 1992.
  2. ^ P E Kloeden, Eckhard Platen, Numerical Solutions of Stochastic Differential Equations, Applications of Mathematics 23, Stochastic Modelling and Applied probability, Springer, 1992.