Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 48 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 19 tok/s Pro
GPT-4o 107 tok/s Pro
Kimi K2 205 tok/s Pro
GPT OSS 120B 473 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

A new weak gradient for the stabilizer free weak Galerkin method with polynomial reduction (2004.13019v1)

Published 26 Apr 2020 in math.NA and cs.NA

Abstract: The weak Galerkin (WG) finite element method is an effective and flexible general numerical technique for solving partial differential equations. It is a natural extension of the classic conforming finite element method for discontinuous approximations, which maintains simple finite element formulation. Stabilizer free weak Galerkin methods further simplify the WG methods and reduce computational complexity. This paper explores the possibility of optimal combination of polynomial spaces that minimize the number of unknowns in the stabilizer free WG schemes without compromising the accuracy of the numerical approximation. A new stabilizer free weak Galerkin finite element method is proposed and analyzed with polynomial degree reduction. To achieve such a goal, a new definition of weak gradient is introduced. Error estimates of optimal order are established for the corresponding WG approximations in both a discrete $H1$ norm and the standard $L2$ norm. The numerical examples are tested on various meshes and confirm the theory.

Citations (9)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)