<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>4269</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2013-10-11</completedDate>
    <publishedDate>2013-10-11</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Reducing Memory Requirements in Scientific Computing and Optimal Control</title>
    <abstract language="eng">In high accuracy numerical simulations and optimal control of time-dependent processes, often both many time steps and fine spatial discretizations are needed. Adjoint gradient computation, or post-processing of simulation results, requires the storage of the solution trajectories over the whole time, if necessary together with the adaptively refined spatial grids. In this paper we discuss various techniques to reduce the memory requirements, focusing first on the storage of the solution data, which typically are double precision floating point values. We highlight advantages and disadvantages of the different approaches. Moreover, we present an algorithm for the efficient storage of adaptively refined, hierarchic grids, and the integration with the compressed storage of solution data.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-42695</identifier>
    <enrichment key="SourceTitle">submitted to "Multiple Shooting and Time Domain Decomposition Methods", Springer Series "Contributions in Mathematical and Computational Sciences"</enrichment>
    <author>Sebastian Götschel</author>
    <submitter>Sebastian Götschel</submitter>
    <author>Christoph von Tycowicz</author>
    <author>Konrad Polthier</author>
    <author>Martin Weiser</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-64</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>optimal control</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>trajectory storage</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>mesh compression</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>compression</value>
    </subject>
    <collection role="msc" number="65M60">Finite elements, Rayleigh-Ritz and Galerkin methods, finite methods</collection>
    <collection role="msc" number="68P05">Data structures</collection>
    <collection role="msc" number="68P30">Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) [See also 94Axx]</collection>
    <collection role="msc" number="94A29">Source coding [See also 68P30]</collection>
    <collection role="institutes" number="num">Numerical Mathematics</collection>
    <collection role="institutes" number="compmed">Computational Medicine</collection>
    <collection role="persons" number="weiser">Weiser, Martin</collection>
    <collection role="projects" number="MATHEON-F9">MATHEON-F9</collection>
    <collection role="projects" number="ZIB-Kaskade7">ZIB-Kaskade7</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/4269/ZR13-64.pdf</file>
  </doc>
</export-example>
