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
Autoscaling Adds Waiters, Not Ovens. Here's What Actually Breaks at 10x Load
0dev.to
[백엔드 모의면접] 중복 결제는 어떻게 막을까?
0dev.to
Server-Side Pagination Looked Easy. It Took Me Longer Than Any React Concept Yet.
0dev.to
Before You Create an AWS Account, Spend 45 Minutes Learning These Security Tools
0dev.to
Claude “Invalid Signature” in a Thinking Block: How to Debug It Safely
0dev.to
How to catch an expiring or broken SSL certificate before your visitors do
0dev.to