Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and 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 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 24 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 439 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Enforcing Neumann Boundary Conditions with Polynomial Extension Operators to Acheive Optimal Convergence Rates on Polytopial Meshes in the Finite Element Method (2301.03753v1)

Published 10 Jan 2023 in math.NA and cs.NA

Abstract: In \cite{cheung2019optimally}, the authors presented two finite element methods for approximating second order boundary value problems on polytopial meshes with optimal accuracy without having to utilize curvilinear mappings. This was done by enforcing the boundary conditions through judiciously chosen polynomial extension operators. The $H1$ error estimates were proven to be optimal for the solutions of both the Dirichlet and Neumann boundary value problems. It was also proven that the Dirichlet problem approximation converges optimally in $L2$. However, optimality of the Neumann approximation in the $L2$ norm was left as an open problem. In this work, we seek to close this problem by presenting new analysis that proves optimal error estimates for the Neumann approximation in the $W1_\infty$ and $L2$ norms.

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

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

Collections

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