Backend
Forests of Omnitrees: Analysis and Applications to Anisotropic Space--Time Finite Elements
arXiv cs.NA0 views
arXiv:2611.21836v1 Announce Type: new Abstract: We prove output-optimal work bounds for omnitree forests, which bisect cells along selected axes. A canonical descriptor characterizes representable partitions independently of split order. Complete one-level cycles, including coarsening, face balance and selected coarse meshes, take sequential work proportional to stored input and output at fixed dimension and key width, with polynomial depth dependence even for unbalanced input. From balanced input, refinement-only balance stays within each request's coordinate slab; this bound is attained. Polynomial trace equations characterize conforming high-order spaces across crossed face partitions. Reconstruction moments bound interpolation errors and capture the logarithmic loss that bilinear nodal interpolation can suffer on balanced meshes. Elements of degree up to four resolve moving heat layers on unstructured 4D space-time and 5D space-time-parameter meshes. Multigrid uses the generated hierarchies.
Source:https://arxiv.org/abs/2611.21836PreviousDirect Element-Level Mass Matrix InversionNextBeyond the error horizon: averaged quantile Kaczmarz methods for corrupted and noisy linear systems
Related posts
Why Microsoft's Outlook Outage Lasted More Than 27 Hours
0HackerNoon

I Watched AI Eat the Easy Half of an Industry. The Other Half Got More Expensive.
0HackerNoon
AI Agents Could Drive the Next Open Source Software Revolution
0HackerNoon
Prompt Theory: Critical Analysis
0dev.to

MacOS widget that tells me which coding agents are waiting on me
0dev.to
Pchi life studio
0dev.to