2000 character limit reached
A unified framework for Trefftz-like discretization methods
Published 1 Dec 2024 in math.NA and cs.NA | (2412.00806v1)
Abstract: This paper presents a unifying framework for Trefftz-like methods, which allows the analysis and construction of discretization methods based on the decomposition into, and coupling of, local and global problems. We apply the framework to provide a comprehensive error analysis for the Embedded Trefftz discontinuous Galerkin method, for a wide range of second-order scalar elliptic partial differential equations and a scalar reaction-advection problem. We also analyze quasi-Trefftz methods with our framework and build bridges to other methods that are similar in virtue.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.