arXiv:1610.05850 [math.NA]AbstractReferencesReviewsResources
Discretization of mixed formulations of elliptic problems on polyhedral meshes
Konstantin Lipnikov, Gianmarco Manzini
Published 2016-10-19Version 1
We review basic design principles underpinning the construction of mimetic finite difference and a few finite volume and finite element schemes for mixed formulations of elliptic problems. For a class of low-order mixed-hybrid schemes, we show connections between these principles and prove that the consistency and stability conditions must lead to a member of the mimetic family of schemes regardless of the selected discretization framework. Finally, we give two examples of using flexibility of the mimetic framework: derivation of higher-order schemes and convergent schemes for nonlinear problems with small diffusion coefficients.
Comments: 27 pages; 4 figures; 49 citations
Journal: Lecture Notes in Computational Science and Engineering, vol. 114, pag. 309-340, 2016
Categories: math.NA
Keywords: elliptic problems, mixed formulations, polyhedral meshes, discretization, review basic design principles underpinning
Tags: journal article
Related articles: Most relevant | Search more
arXiv:1703.06325 [math.NA] (Published 2017-03-18)
Adaptive Local (AL) Basis for Elliptic Problems with $L^\infty$-Coefficients
Multigrid algorithms for $hp$-Discontinuous Galerkin discretizations of elliptic problems
arXiv:1506.03855 [math.NA] (Published 2015-06-11)
Discretization of polynomial vector fields by polarization