Searcharxiv⌕ Search

arXiv subjects

Bruno Degli Esposti

Publications and source records attributed to Bruno Degli Esposti.

2 recordsLinked to original sources

Decoupling solution and quadrature nodes in meshless Nyström methods for second-kind Fredholm integral equations

We introduce a meshless Nyström method for Fredholm integral equations of the second kind with smooth kernels in which the solution and quadrature nodes are chosen independently. Meshless moment-free quadrature formulas discretize the integral operator on scattered nodes, while local reconstruction with polyharmonic spline radial basis functions transfers values from a coarser set of solution nodes to a finer set of quadrature nodes. This construction yields a high-order method applicable to complex domains and irregular node distributions. We provide a well-posedness and convergence analysis of the resulting discretization. Under natural assumptions, we establish unique solvability for sufficiently dense node sets and derive an error bound that separates the contributions of quadrature and reconstruction. The overall convergence order is determined by the lower of the quadrature and reconstruction orders. When these orders coincide, we propose a coarse-grid parameter sweep to identify a nearly optimal ratio between the densities of solution and quadrature nodes. Numerical experiments on planar domains confirm the predicted rates and demonstrate a substantial increase in computational efficiency over the classical Nyström method, especially for narrow kernels.

math.NA↗

Meshless moment-free quadrature formulas arising from numerical differentiation

We suggest a method for simultaneously generating high order quadrature weights for integrals over Lipschitz domains and their boundaries that requires neither meshing nor moment computation. The weights are determined on pre-defined scattered nodes as a minimum norm solution of a sparse underdetermined linear system arising from a discretization of a suitable boundary value problem by either collocation or meshless finite differences. The method is easy to implement independently of the domain's representation, since it only requires as inputs the position of all quadrature nodes and the direction of outward-pointing normals at each node belonging to the boundary. Numerical experiments demonstrate the robustness and high accuracy of the method on a number of smooth and piecewise smooth domains in 2D and 3D, including some with reentrant corners and edges. Comparison with quadrature schemes provided by the state-of-the-art open source packages Gmsh and MFEM shows that the new method is competitive in terms of accuracy for a given number of nodes.

math.NA↗