Efficient optimization-based quadrature for variational discretization of nonlocal problems
Marco Pasetto, Zhaoxiang Shen, Marta D'Elia, Xiaochuan Tian, Nathaniel, Trask, David Kamensky

TL;DR
This paper introduces a novel quadrature method for efficiently computing nonlocal variational problems, avoiding complex geometric intersection calculations and ensuring convergence as mesh size and nonlocal radius diminish.
Contribution
It proposes a quadrature technique that simplifies nonlocal integral computation by avoiding element-ball intersection calculations, improving efficiency and accuracy.
Findings
Method achieves at least first-order convergence in L^2 norm.
Technique is asymptotically compatible as mesh size and nonlocal radius approach zero.
Applicable to 1D and 2D problems with both uniform and nonuniform grids.
Abstract
Casting nonlocal problems in variational form and discretizing them with the finite element (FE) method facilitates the use of nonlocal vector calculus to prove well-posedeness, convergence, and stability of such schemes. Employing an FE method also facilitates meshing of complicated domain geometries and coupling with FE methods for local problems. However, nonlocal weak problems involve the computation of a double-integral, which is computationally expensive and presents several challenges. In particular, the inner integral of the variational form associated with the stiffness matrix is defined over the intersections of FE mesh elements with a ball of radius , where is the range of nonlocal interaction. Identifying and parameterizing these intersections is a nontrivial computational geometry problem. In this work, we propose a quadrature technique where the inner…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
