<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-21T18:41:09Z</responseDate>
  <request identifier="142" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:142</identifier>
        <datestamp>2024-03-06T11:05:57Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Upper Error Bounds for Approximations of Stochastic Differential Equations with Markovian Switching</dc:title>
          <dc:creator>Hofmann, Norbert</dc:creator>
          <dc:subject>stochastic differential equations with Markovian switching</dc:subject>
          <dc:subject>Markov chains</dc:subject>
          <dc:subject>numerical methods</dc:subject>
          <dc:subject>Euler scheme</dc:subject>
          <dc:subject>Milstein scheme</dc:subject>
          <dc:description>We consider stochastic differential equations with&#13;
Markovian switching (SDEwMS). An SDEwMS is a&#13;
stochastic differential equation with drift and&#13;
diffusion coefficients depending not only on the&#13;
current state of the solution but also on the &#13;
current state of a right-continuous Markov chain &#13;
taking values in a finite state space. &#13;
Consequently, an SDEwMS can be viewed as the &#13;
result of a finite number of different scenarios &#13;
switching from one to the other according to the &#13;
movement of the Markov chain. The generator of the &#13;
Markov chain is given by transition probabilities &#13;
involving a parameter which controls the intensity    &#13;
of switching from one state to another. We &#13;
construct numerical schemes for the approximation &#13;
of SDE'swMS and present upper error bounds for &#13;
these schemes. Our numerical schemes are based on &#13;
a time discretization with constant step-size and &#13;
on the values of a discrete Markov chain at the &#13;
discretization points. It turns out that for the &#13;
Euler scheme a similar upper bound as in the case &#13;
of stochastic ordinary differential equations can &#13;
be obtained, while for the Milstein scheme there &#13;
is a strong connection between the power of the &#13;
step-size appearing in the upper bound and the &#13;
intensity of the switching.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Norbert Hofmann</dc:contributor>
          <dc:date>2005</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.04401.16</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-1422</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.16</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
