<?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-20T05:02:54Z</responseDate>
  <request identifier="149" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:149</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>On the Complexity of Parabolic Initial Value Problems with Variable Drift</dc:title>
          <dc:creator>Petras, Knut</dc:creator>
          <dc:creator>Ritter, Klaus</dc:creator>
          <dc:subject>Partial differential equations</dc:subject>
          <dc:subject>parabolic problems</dc:subject>
          <dc:subject>Smolyak method</dc:subject>
          <dc:subject>optimal methods</dc:subject>
          <dc:description>We consider linear parabolic initial value &#13;
problems of second order in several dimensions. &#13;
The initial condition is supposed to be fixed &#13;
and we investigate the comutational complexity if &#13;
the coefficients of the parabolic equations&#13;
may vary in certain function spaces. Using the &#13;
parametrix method (or Neumann series), we prove &#13;
that lower bounds for the error of numerical &#13;
methods are related to lower bounds for &#13;
integration problems. On the other hand, &#13;
approximating the Neumann series with Smolyak's &#13;
method, we show that the problem is not much &#13;
harder than a certain approximation problem. For &#13;
HÃƒÂ¶lder classes on compact sets, e.g., lower and &#13;
upper bounds are close together, such that we have &#13;
an almost optimal method.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Knut Petras and Klaus Ritter</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.10</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-1495</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.10</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>
