<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">378875051</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180305123418.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">161128s2003    xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.2478/cmam-2003-0037</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)gruyter-10.2478/cmam-2003-0037</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A Priori Error Analysis for the hp-Version of the Discontinuous Galerkin Finite Element Method for the Biharmonic Equation</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">We consider the hp-version of the discontinuous Galerkin finite element approximation of boundary value problems for the biharmonic equation. Our main concern is the a priori error analysis of the method, based on a nonsymmetric bilinear form with interior discontinuity penalization terms. We establish an a priori error bound for the method which is of optimal order with respect to the mesh size h , and nearly optimal with respect to the degree p of the polynomial approximation. For analytic solutions, the method exhibits an exponential rate of convergence under p- refinement. These results are shown in the DG-norm for a general shape regular family of partitions consisting of d-dimensional parallelepipeds. The theoretical results are confirmed by numerical experiments. The method has also been tested on several practical problems of thin-plate-bending theory and has been shown to be competitive in accuracy with existing algorithms.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">discontinuous Galerkin methods</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">biharmonic equation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">thin plate theory</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Mozolevski</subfield>
   <subfield code="D">Igor</subfield>
   <subfield code="u">Federal University of Santa Catarina, Mathematical Department Trindade, Florian´opolis, SC, 88040-900, Brazil.</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Süli</subfield>
   <subfield code="D">Endre</subfield>
   <subfield code="u">Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, UK.</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Computational Methods in Applied Mathematics</subfield>
   <subfield code="d">De Gruyter</subfield>
   <subfield code="g">3/4(2003), 596-607</subfield>
   <subfield code="x">1609-4840</subfield>
   <subfield code="q">3:4&lt;596</subfield>
   <subfield code="1">2003</subfield>
   <subfield code="2">3</subfield>
   <subfield code="o">cmam</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.2478/cmam-2003-0037</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.2478/cmam-2003-0037</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">Mozolevski</subfield>
   <subfield code="D">Igor</subfield>
   <subfield code="u">Federal University of Santa Catarina, Mathematical Department Trindade, Florian´opolis, SC, 88040-900, Brazil</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">Süli</subfield>
   <subfield code="D">Endre</subfield>
   <subfield code="u">Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, UK</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">Computational Methods in Applied Mathematics</subfield>
   <subfield code="d">De Gruyter</subfield>
   <subfield code="g">3/4(2003), 596-607</subfield>
   <subfield code="x">1609-4840</subfield>
   <subfield code="q">3:4&lt;596</subfield>
   <subfield code="1">2003</subfield>
   <subfield code="2">3</subfield>
   <subfield code="o">cmam</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-gruyter</subfield>
  </datafield>
 </record>
</collection>
