Mathematics > Numerical Analysis
[Submitted on 25 Apr 2018 (v1), last revised 13 Nov 2018 (this version, v5)]
Title:A third Strang lemma and an Aubin-Nitsche trick for schemes in fully discrete formulation
View PDFAbstract:In this work, we present an abstract error analysis framework for the approximation of linear partial differential equation (PDE) problems in weak formulation. We consider approximation methods in fully discrete formulation, where the discrete and continuous spaces are possibly not embedded in a common space. A proper notion of consistency is designed, and, under a classical inf-sup condition, it is shown to bound the approximation error. This error estimate result is in the spirit of Strang's first and second lemmas, but applicable in situations not covered by these lemmas (because of a fully discrete approximation space). An improved estimate is also established in a weaker norm, using the Aubin--Nitsche trick.
We then apply these abstract estimates to an anisotropic heterogeneous diffusion model and two classical families of schemes for this model: Virtual Element and Finite Volume methods. For each of these methods, we show that the abstract results yield new error estimates with a precise and mild dependency on the local anisotropy ratio. A key intermediate step to derive such estimates for Virtual Element Methods is proving optimal approximation properties of the oblique elliptic projector in weighted Sobolev seminorms. This is a result whose interest goes beyond the specific model and methods considered here. We also obtain, to our knowledge, the first clear notion of consistency for Finite Volume methods, which leads to a generic error estimate involving the fluxes and valid for a wide range of Finite Volume schemes. An important application is the first error estimate for Multi-Point Flux Approximation L and G methods.
In the appendix, not included in the published version of this work, we show that classical estimates for discontinuous Galerkin methods can be obtained with simplified arguments using the abstract framework.
Submission history
From: Jerome Droniou [view email][v1] Wed, 25 Apr 2018 11:25:37 UTC (41 KB)
[v2] Sun, 29 Apr 2018 06:00:27 UTC (35 KB)
[v3] Thu, 23 Aug 2018 22:37:29 UTC (43 KB)
[v4] Fri, 31 Aug 2018 12:59:53 UTC (43 KB)
[v5] Tue, 13 Nov 2018 23:48:03 UTC (43 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.