<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">38805736X</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180307125111.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">161130e199801  xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1017/S0962492900002816</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">S0962492900002816</subfield>
   <subfield code="2">pii</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)cambridge-10.1017/S0962492900002816</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">DeVore</subfield>
   <subfield code="D">Ronald A.</subfield>
   <subfield code="u">Department of Mathematics, University of South Carolina, Columbia, SC 29208, USA E-mail: devore@math.sc.edu</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Nonlinear approximation</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Ronald A. DeVore]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This is a survey of nonlinear approximation, especially that part of the subject which is important in numerical computation. Nonlinear approximation means that the approximants do not come from linear spaces but rather from nonlinear manifolds. The central question to be studied is what, if any, are the advantages of nonlinear approximation over the simpler, more established, linear methods. This question is answered by studying the rate of approximation which is the decrease in error versus the number of parameters in the approximant. The number of parameters usually correlates well with computational effort. It is shown that in many settings the rate of nonlinear approximation can be characterized by certain smoothness conditions which are significantly weaker than required in the linear theory. Emphasis in the survey will be placed on approximation by piecewise polynomials and wavelets as well as their numerical implementation. Results on highly nonlinear methods such as optimal basis selection and greedy algorithms (adaptive pursuit) are also given. Applications to image processing, statistical estimation, regularity for PDEs, and adaptive algorithms are discussed.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Copyright © Cambridge University Press 1998</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Acta Numerica</subfield>
   <subfield code="d">Cambridge University Press</subfield>
   <subfield code="g">7(1998-01), 51-150</subfield>
   <subfield code="x">0962-4929</subfield>
   <subfield code="q">7&lt;51</subfield>
   <subfield code="1">1998</subfield>
   <subfield code="2">7</subfield>
   <subfield code="o">ANU</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1017/S0962492900002816</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.1017/S0962492900002816</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">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">DeVore</subfield>
   <subfield code="D">Ronald A.</subfield>
   <subfield code="u">Department of Mathematics, University of South Carolina, Columbia, SC 29208, USA E-mail: devore@math.sc.edu</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">Acta Numerica</subfield>
   <subfield code="d">Cambridge University Press</subfield>
   <subfield code="g">7(1998-01), 51-150</subfield>
   <subfield code="x">0962-4929</subfield>
   <subfield code="q">7&lt;51</subfield>
   <subfield code="1">1998</subfield>
   <subfield code="2">7</subfield>
   <subfield code="o">ANU</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="b">CC0</subfield>
   <subfield code="u">http://creativecommons.org/publicdomain/zero/1.0</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-cambridge</subfield>
  </datafield>
 </record>
</collection>
