<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">605496862</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100538.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150901xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10543-014-0522-0</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10543-014-0522-0</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Levin</subfield>
   <subfield code="D">David</subfield>
   <subfield code="u">School of Mathematical Sciences, Tel-Aviv University, 69978, Tel Aviv, Israel</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Between moving least-squares and moving least- $$\ell _1$$ ℓ 1</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[David Levin]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Given function values at scattered points in $${\mathbb {R}}^d$$ R d , possibly with noise, one of the ways of generating approximation to the function is by the method of moving least-squares (MLS). The method consists of computing local polynomials which approximate the data in a locally weighted least-squares sense. The resulting approximation is smooth, and is well approximating if the underlying function is smooth. Yet, as any least-squares based method it is quite sensitive to outliers in the data. It is well known that least- $$\ell _1$$ ℓ 1 approximations are not sensitive to outliers. However, due to the nature of the $$\ell _1$$ ℓ 1 norm, using it in the framework of a &quot;moving” approximation will not give a smooth, or even a continuous approximation. This paper suggests an error measure which is between the $$\ell _1$$ ℓ 1 and the $$\ell _2$$ ℓ 2 norms, with the advantages of both. Namely, yielding smooth approximations which are not too sensitive to outliers. A fast iterative method for computing the approximation is demonstrated and analyzed. It is shown that for a scattered data taken from a smooth function, with few outliers, the new approximation gives an $$O(h)$$ O ( h ) approximation error to the function.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media Dordrecht, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Moving least-squares</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Outliers</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Multivariate approximation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">BIT Numerical Mathematics</subfield>
   <subfield code="d">Springer Netherlands</subfield>
   <subfield code="g">55/3(2015-09-01), 781-796</subfield>
   <subfield code="x">0006-3835</subfield>
   <subfield code="q">55:3&lt;781</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">55</subfield>
   <subfield code="o">10543</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10543-014-0522-0</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</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="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="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</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/s10543-014-0522-0</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">Levin</subfield>
   <subfield code="D">David</subfield>
   <subfield code="u">School of Mathematical Sciences, Tel-Aviv University, 69978, Tel Aviv, Israel</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">BIT Numerical Mathematics</subfield>
   <subfield code="d">Springer Netherlands</subfield>
   <subfield code="g">55/3(2015-09-01), 781-796</subfield>
   <subfield code="x">0006-3835</subfield>
   <subfield code="q">55:3&lt;781</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">55</subfield>
   <subfield code="o">10543</subfield>
  </datafield>
 </record>
</collection>
