A computational study of the weak Galerkin method for second-order elliptic equations

From MaRDI portal
Publication:2391818

DOI10.1007/S11075-012-9651-1zbMATH Open1271.65140arXiv1111.0618OpenAlexW2017533067WikidataQ62727804 ScholiaQ62727804MaRDI QIDQ2391818FDOQ2391818


Authors: Lin Mu, Junping Wang, Yanqiu Wang, Xiu Ye Edit this on Wikidata


Publication date: 5 August 2013

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: The weak Galerkin finite element method is a novel numerical method that was first proposed and analyzed by Wang and Ye for general second order elliptic problems on triangular meshes. The goal of this paper is to conduct a computational investigation for the weak Galerkin method for various model problems with more general finite element partitions. The numerical results confirm the theory established by Wang and Ye. The results also indicate that the weak Galerkin method is efficient, robust, and reliable in scientific computing.


Full work available at URL: https://arxiv.org/abs/1111.0618




Recommendations




Cites Work


Cited In (90)

Uses Software





This page was built for publication: A computational study of the weak Galerkin method for second-order elliptic equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391818)