Search NASA⌕ Search

DOE OSTI · 1612624

An accurate and asymptotically compatible collocation scheme for nonlocal diffusion problems

Abstract

Here, in this paper, we develop and analyze a collocation scheme for solving the linear nonlocal diffusion problem with general kernels. To approximate the nonlocal diffusion operator, we take a classic trapezoidal rule based on the linear interpolation as the starting point, and then carefully derive a new improved quadrature rule, which is not only more accurate but also could avoid the evaluations of singular integrals. We then use this rule to construct a collocation scheme for solving the nonlocal diffusion equations, that produces a symmetric positive definite stiffness matrix with Toeplitz structure. The proposed scheme is rigorously shown to be of second order accurate with respect to the mesh size for the nonlocal problem with fixed horizon, and in particular, it can achieve higher order accuracy for the commonly used kernels in the literature. Furthermore, we also prove that the scheme is asymptotically compatible, i.e., the approximate solution of the nonlocal diffusion problem converges to the exact solution of the corresponding local PDE problem when the horizon and the mesh size both go to zero. Finally, numerical experiments are presented to verify the theoretical results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhang, Xiaoping, Wu, Jiming, Ju, Lili. 2017-12-05. An accurate and asymptotically compatible collocation scheme for nonlocal diffusion problems. https://doi.org/10.1016/j.apnum.2017.11.007

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

TANTE: Time-adaptive operator learning via neural Taylor expansion

Operator learning for time-dependent partial differential equations (PDEs) has seen rapid progress in recent years, enabling efficient approximation of complex spatiotemporal dynamics. However, most existing methods rely on fixed time step sizes during rollout, which limits their ability to adapt to varying temporal complexity and often leads to error accumulation. In this work, we propose the Time-Adaptive Transformer with Neural Taylor Expansion (TANTE), a novel operator-learning framework that produces continuous-time predictions with adaptive step sizes. TANTE predicts future states by performing a Taylor expansion at the current state, where neural networks learn both the higher-order temporal derivatives and the local radius of convergence. This allows the model to dynamically adjust its rollout based on the local behavior of the solution, thereby reducing cumulative error and improving computational efficiency. We demonstrate the effectiveness of TANTE across a wide range of PDE benchmarks, achieving superior accuracy and adaptability compared to fixed-step baselines, delivering accuracy gains of 60-80 % and speed-ups of 30-40 % at inference time.

97 MATHEMATICS AND COMPUTING↗

Structured illumination for surface-resolved grazing-incidence X-ray scattering

Grazing-incidence (GI) scattering techniques are widely used to characterize thin films, offering high surface sensitivity and insight into morphology and structure. However, these approaches typically provide statistical averaged information due to elongated footprint or limited spatial resolution due to beam size. Here we introduce a method that combines structured illumination with GI X-ray scattering and leverages our computational imaging approach to resolve local structural details. We demonstrate that our method captures local features of an organic semiconductor thin film without the need for sample rotation as in tomography. The method expands GI techniques from statistical averaging to high-resolution imaging, thereby providing the capability for detailed analysis of local material properties, such as domain shape, orientation and polymorphism, which are critical for advancing material design towards more efficient and tailored materials.

97 MATHEMATICS AND COMPUTING↗