<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">467939160</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406153007.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170328e20060101xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10444-004-7631-2</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10444-004-7631-2</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Adaptive application of operators in standard representation</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Arne Barinka, Stephan Dahlke, Wolfgang Dahmen]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could be shown under the assumption that the entries in properly compressed standard representations are known or computable in average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption is justified in the context of elliptic boundary value problems.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer, 2006</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">operator equations</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">quasi-sparse matrices and vectors</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">best N -term approximation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">fast matrix/vector multiplication</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Barinka</subfield>
   <subfield code="D">Arne</subfield>
   <subfield code="u">Institut für Geometrie und Praktische Mathematik, RWTH Aachen, Templergraben 55, 52056, Aachen, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Dahlke</subfield>
   <subfield code="D">Stephan</subfield>
   <subfield code="u">Philipps-Universität Marburg, FB12 Mathematik und Informatik, Hans-Meerwein Straße, Lahnberge, 35032, Marburg, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Dahmen</subfield>
   <subfield code="D">Wolfgang</subfield>
   <subfield code="u">Institut für Geometrie und Praktische Mathematik, RWTH Aachen, Templergraben 55, 52056, Aachen, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Advances in Computational Mathematics</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">24/1-4(2006-01-01), 5-34</subfield>
   <subfield code="x">1019-7168</subfield>
   <subfield code="q">24:1-4&lt;5</subfield>
   <subfield code="1">2006</subfield>
   <subfield code="2">24</subfield>
   <subfield code="o">10444</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10444-004-7631-2</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s10444-004-7631-2</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Barinka</subfield>
   <subfield code="D">Arne</subfield>
   <subfield code="u">Institut für Geometrie und Praktische Mathematik, RWTH Aachen, Templergraben 55, 52056, Aachen, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Dahlke</subfield>
   <subfield code="D">Stephan</subfield>
   <subfield code="u">Philipps-Universität Marburg, FB12 Mathematik und Informatik, Hans-Meerwein Straße, Lahnberge, 35032, Marburg, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Dahmen</subfield>
   <subfield code="D">Wolfgang</subfield>
   <subfield code="u">Institut für Geometrie und Praktische Mathematik, RWTH Aachen, Templergraben 55, 52056, Aachen, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Advances in Computational Mathematics</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">24/1-4(2006-01-01), 5-34</subfield>
   <subfield code="x">1019-7168</subfield>
   <subfield code="q">24:1-4&lt;5</subfield>
   <subfield code="1">2006</subfield>
   <subfield code="2">24</subfield>
   <subfield code="o">10444</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
