AI & ML
Robust Multigrid on Adaptive Meshes for the Integral Fractional Laplacian
arXiv cs.NA0 views
arXiv:2611.06577v1 Announce Type: new Abstract: We analyze a geometric multigrid method on locally refined mesh hierarchies for non-local variational problems, focusing on the integral fractional Laplacian. For newest-vertex-bisection-generated hierarchies, we prove uniform contraction of the multigrid iteration independently of the refinement level, the smallest local mesh size, and the polynomial degree in the finite element discretization. The proof is based on an abstract Hilbert-space framework, a strengthened Cauchy--Schwarz estimate obtained from a near-/far-field decomposition of the non-local bilinear form, and a multilevel stable decomposition independent of the discretization parameters. Numerical experiments underline the theoretical findings.
Source:https://arxiv.org/abs/2611.06577PreviousA Tensor-Network Chebyshev--Galerkin Method for Boundary-Value Problems in Computational MechanicsNextSobolev--Poincar\'e inequalities for piecewise $W^{2,p}$ functions over general polytopic meshes
Related posts
Test DOCX Breaks as a Many-to-One Conversion
0dev.to JavaScript
A Bayesian Optimized Biquad Filter-Burg Model for Real-Time EEG Phase Estimation
0arXiv eess.SP
Thought-deciphering via hierarchical EEG-to-text alignment
0arXiv eess.SP
Neuromorphic Decoding and Dynamical Image Reconstruction from Populations of Spiking Retinal Ganglion Cells
0arXiv eess.SP
Benchmarking Sensor-Fault Robustness in Forecasting
0arXiv eess.SP
Consistent Geometric Deep Learning via Hilbert Bundles and Cellular Sheaves
0arXiv eess.SP