We propose and analyze an hp-adaptive DG–FEM algorithm, termed hp-ADFEM, and its one-dimensional realization, which is convergent, instance optimal, and h- and p-robust. The procedure consists of iterating two routines: one hinges on Binev’s algorithm for the adaptive hp-approximation of a given function, and finds a near-best hp-approximation of the current discrete solution and data to a desired accuracy; the other one improves the dis- crete solution to a finer but comparable accuracy, by iteratively applying Dörfler marking and h refinement.

An Adaptive hp–DG–FE Method for Elliptic Problems: Convergence and Optimality in the 1D Case

Antonietti, Paola;Verani, Marco
2019

Abstract

We propose and analyze an hp-adaptive DG–FEM algorithm, termed hp-ADFEM, and its one-dimensional realization, which is convergent, instance optimal, and h- and p-robust. The procedure consists of iterating two routines: one hinges on Binev’s algorithm for the adaptive hp-approximation of a given function, and finds a near-best hp-approximation of the current discrete solution and data to a desired accuracy; the other one improves the dis- crete solution to a finer but comparable accuracy, by iteratively applying Dörfler marking and h refinement.
File in questo prodotto:
File Dimensione Formato  
2019_Antonietti_Canuto_Verani.pdf

Accesso riservato

Descrizione: Articolo principale
: Publisher’s version
Dimensione 3.74 MB
Formato Adobe PDF
3.74 MB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11311/1099963
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 1
social impact