Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A robust DPG method for large domains (2011.12098v1)

Published 24 Nov 2020 in math.NA and cs.NA

Abstract: We observe a dramatic lack of robustness of the DPG method when solving problems on large domains and where stability is based on a Poincar\'e-type inequality. We show how robustness can be re-established by using appropriately scaled test norms. As model cases we study the Poisson problem and the Kirchhoff--Love plate bending model, and also include fully discrete variants where optimal test functions are approximated. Numerical experiments for both model problems, including an-isotropic domains and mixed boundary conditions, confirm our findings.

Citations (5)

Summary

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