AI & ML
Sharp Pointwise Error Estimates of Finite Element Methods for the Biharmonic Equation
arXiv cs.NA0 views
arXiv:2610.25115v1 Announce Type: new Abstract: We prove sharp pointwise error estimates for finite element approximations of the clamped biharmonic equation on convex polygonal domains. For $C^1$-conforming elements, we establish $W^{2,p}$-stability for all $2\le p\le \infty$, together with best-approximation type estimates in $W^{1,\infty}$ and $L^\infty$. For the nonconforming Morley element, we derive optimal estimates in $W^{2,p}$, $W^{1,\infty}$, and $L^\infty$; in particular, the $L^\infty$-error is of order $O(h^2)$ without an additional logarithmic factor. The analysis is based on three ingredients: local energy estimates for conforming and nonconforming plate elements, a removal of the local $L^2$-error term in these estimates, and H\"older estimates for derivatives of the Green's function. These tools are combined with a dyadic decomposition argument for regularized Green's functions. The results remove logarithmic losses present in earlier pointwise estimates for fourth-order problems and yield sharp rates for classical plate elements such as the Argyris, Bogner--Fox--Schmit (BFS), Hsieh--Clough--Tocher (HCT), and Morley elements.
Source:https://arxiv.org/abs/2610.25115PreviousIntegrable building blocks for symplectic neural networks: learned-type layers, fiber-preserving layers, and what a single layer can doNextLocal Approximation of $A$-Harmonic Functions and the Super-Localization Conjecture
Related posts
Hybrid retrieval with reciprocal rank fusion: notes from a RAG prototype
0dev.to
It is in co-creating, together. As humans do.
0dev.to
C64 Basic Dungeon Crawler: Stairs, Levels and Levelling Up (Part 11)
0Hacker News
Anthropic's internal AI use, at retail prices, now exceeds its employee pay
0Hacker News
Launch HN: Momentic (YC W24) – Agents that catch bugs by using your app
0Hacker News

Behavioral Design Unpacked: Nudges, Funnels & Persuasion | UX Unpacked #3
0dev.to UX