<?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-19T22:59:40Z</responseDate>
  <request identifier="151" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:151</identifier>
        <datestamp>2024-03-06T11:05:56Z</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>Lower Bounds and Non-Uniform Time Discretization for Approximation of Stochastic Heat Equations</dc:title>
          <dc:creator>Ritter, Klaus</dc:creator>
          <dc:creator>Müller-Gronbach, Thomas</dc:creator>
          <dc:subject>Stochastic heat equation</dc:subject>
          <dc:subject>Non-uniform time discretization</dc:subject>
          <dc:subject>minimal errors</dc:subject>
          <dc:subject>upper and lower bounds</dc:subject>
          <dc:description>We study algorithms for approximation of the mild solution &#13;
of stochastic heat equations on the spatial domain ]0,1[^d. &#13;
The error of an algorithm is  defined in L_2-sense.&#13;
We derive lower bounds for the error of every algorithm&#13;
that uses a total of N evaluations of one-dimensional components &#13;
of the driving Wiener process W. For equations with additive &#13;
noise we derive  matching upper bounds and we construct &#13;
asymptotically optimal algorithms. The error bounds depend on &#13;
N and d, and on the decay of eigenvalues of the covariance of W&#13;
in the case of nuclear noise. In the latter case the use of  &#13;
non-uniform time discretizations is crucial.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Klaus Ritter and Thomas Müller-Gronbach</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.6</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-1518</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.6</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>
