All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

hp-ADAPTATION DRIVEN BY POLYNOMIAL-DEGREE-ROBUST A POSTERIORI ERROR ESTIMATES FOR ELLIPTIC PROBLEMS

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10330313" target="_blank" >RIV/00216208:11320/16:10330313 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1137/15M1026687" target="_blank" >http://dx.doi.org/10.1137/15M1026687</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1137/15M1026687" target="_blank" >10.1137/15M1026687</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    hp-ADAPTATION DRIVEN BY POLYNOMIAL-DEGREE-ROBUST A POSTERIORI ERROR ESTIMATES FOR ELLIPTIC PROBLEMS

  • Original language description

    We devise and study experimentally adaptive strategies driven by a posteriori error estimates to select automatically both the space mesh and the polynomial degree in the numerical approximation of diffusion equations in two space dimensions. The adaptation is based on equilibrated flux estimates. These estimates are presented here for inhomogeneous Dirichlet and Neumann boundary conditions, for spatially varying polynomial degree, and for mixed rectangular-triangular grids possibly containing hanging nodes. They deliver a global error upper bound with constant one and, up to data oscillation, error lower bounds on element patches with a generic constant dependent only on the mesh regularity and with a computable bound. We numerically assess the estimates and several hp-adaptive strategies using the interior penalty discontinuous Galerkin method. Asymptotic exactness is observed for all the symmetric, nonsymmetric (odd degrees), and incomplete variants on nonnested unstructured triangular grids for a smooth solution and uniform refinement. Exponential convergence rates are reported on nonmatching triangular grids for the incomplete version on several benchmarks with a singular solution and adaptive refinement.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2016

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    SIAM Journal of Scientific Computing

  • ISSN

    1064-8275

  • e-ISSN

  • Volume of the periodical

    38

  • Issue of the periodical within the volume

    5

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    27

  • Pages from-to

    "A3220"-"A3246"

  • UT code for WoS article

    000387347700072

  • EID of the result in the Scopus database

    2-s2.0-84994104700