<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">475776992</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406123633.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170329e20000901xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1023/A:1011130501691</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1023/A:1011130501691</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A Posteriori Error Estimators for a Class of Variational Inequalities</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Wenbin Liu, Ningning Yan]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In this paper, we present an a posteriori error analysis for the finite element approximation of a variational inequality. We derive a posteriori error estimators of residual type, which are shown to provide upper bounds on the discretization error for a class of variational inequalities provided the solutions are sufficiently regular. Furthermore we derive sharp a posteriori error estimators with both lower and upper error bounds for a subclass of the obstacle problem which are frequently met in many physical models. For sufficiently regular solutions, these estimates are shown to be equivalent to the discretization error in an energy type norm. Our numerical tests show that these sharp error estimators are both reliable and efficient in guiding mesh adaptivity for computing the free boundaries.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Plenum Publishing Corporation, 2000</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">finite element approximation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">variational inequalities</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">a posteriori error estimators</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">obstacle problems</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Liu</subfield>
   <subfield code="D">Wenbin</subfield>
   <subfield code="u">CBS &amp; Institute of Mathematics and Statistics, University of Kent, CT2 7NF, Canterbury, England</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Yan</subfield>
   <subfield code="D">Ningning</subfield>
   <subfield code="u">Academia Sinica, Institute of Systems Science, 100080, Beijing, People's Republic of China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Scientific Computing</subfield>
   <subfield code="d">Kluwer Academic Publishers-Plenum Publishers</subfield>
   <subfield code="g">15/3(2000-09-01), 361-393</subfield>
   <subfield code="x">0885-7474</subfield>
   <subfield code="q">15:3&lt;361</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">15</subfield>
   <subfield code="o">10915</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1023/A:1011130501691</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.1023/A:1011130501691</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">Liu</subfield>
   <subfield code="D">Wenbin</subfield>
   <subfield code="u">CBS &amp; Institute of Mathematics and Statistics, University of Kent, CT2 7NF, Canterbury, England</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">Yan</subfield>
   <subfield code="D">Ningning</subfield>
   <subfield code="u">Academia Sinica, Institute of Systems Science, 100080, Beijing, People's Republic of China</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">Journal of Scientific Computing</subfield>
   <subfield code="d">Kluwer Academic Publishers-Plenum Publishers</subfield>
   <subfield code="g">15/3(2000-09-01), 361-393</subfield>
   <subfield code="x">0885-7474</subfield>
   <subfield code="q">15:3&lt;361</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">15</subfield>
   <subfield code="o">10915</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>
