SearcharxivSearch

arXiv · 1912.06270

An Asymptotically Compatible Formulation for Local-to-Nonlocal Coupling Problems without Overlapping Regions

Abstract

In this paper we design and analyze an explicit partitioned procedure for a 2D dynamic local-to-nonlocal (LtN) coupling problem, based on a new nonlocal Robin-type transmission condition. The nonlocal subproblem is modeled by the nonlocal heat equation with a finite horizon parameter $\delta$ characterizing the range of nonlocal interactions, and the local subproblem is described by the classical heat equation. We consider a heterogeneous system where the local and nonlocal subproblems present different physical properties, and employ no overlapping region between the two subdomains. We first propose a new generalization of classical local Neumann-type condition by converting the local flux to a correction term in the nonlocal model, and show that the proposed Neumann-type boundary formulation recovers the local case as $O(\delta^2)$ in the $L^{\infty}$ norm. We then extend the nonlocal Neumann-type boundary condition to a Robin-type boundary condition, and develop a local-to-nonlocal coupling formulation with Robin-Dirichlet transmission conditions. To stabilize the explicit coupling procedure and to achieve asymptotic compatibility, the choice of the coefficient in the Robin condition is obtained via amplification factor analysis for the discretized system with coarse grids. Employing a high-order meshfree discretization method in the nonlocal solver and a linear finite element method in the local solver, the selection of optimal Robin coefficients are verified with numerical experiments on heterogeneous and complicated domains. With the developed optimal coupling strategy, we numerically demonstrate the coupling framework's asymptotic convergence to the local limit with an $O(\delta)=O(h)$ rate, when there is a fixed ratio between the horizon size $\delta$ and the spatial discretization size $h$.

Explore related subjects

Keep this discovery

BibTeXRIS

Huaiqian You, Yue Yu, David Kamensky. 2019-12-13. An Asymptotically Compatible Formulation for Local-to-Nonlocal Coupling Problems without Overlapping Regions. https://doi.org/10.1016/j.cma.2020.113038

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

KEEP EXPLORING

Related papers

Stress-divergence, Laplacian, and rotational forms of the incompressible Navier--Stokes equations with variable viscosity

In the Navier--Stokes equations, incompressibility allows rewriting the viscous term in various forms leading to distinct numerical properties and flow descriptions. Furthermore, models accounting for non-Newtonian, thermal or turbulent effects often break the constant-viscosity assumption, thereby producing additional consistency terms. In this context, the present work compares the classical symmetric-gradient diffusion term with more recent variable-viscosity generalizations of the Laplacian and rotational forms. We discuss, analyze and test their differences with respect to implementation, efficiency, numerical stability and outflow boundary conditions. With a focus on time-dependent flows, we consider second-order implicit-explicit (IMEX) temporal discretizations aimed at improving efficiency and numerical stability. Through a rigorous stability analysis, we show how selected explicit treatments can bypass algorithmic nonlinearities without inducing CFL conditions. Our numerical results highlight important differences between the three viscous formulations---especially in the presence of outflow boundaries, for which the generalized Laplacian form proves more suitable in diffusion-dominated regimes. %(as widely known for constant viscosity).

math.NA

Full-window branch discovery and loss-selected EnKF continuation for data assimilation

We develop a framework for offline full-window branch discovery, optionally followed by online continuation with an ensemble Kalman filter (EnKF). Three mechanisms drive the branch search: adjoint path-kernel (APK) differentiation balances kernel differentiation and correction-stabilized path perturbation, shifting the optimization from exploration to exploitation; an optimized Gaussian initial law broadens the search over initial-state basins; and loss-weighted mixing across independent runs recombines successful path components. We may then select an interior state using a local loss and continue online with an EnKF. In 40-dimensional Lorenz-96 experiments, the mean offline path RMSE of APK is 4.3 times smaller than that of population weak-$\mathrm{4D\text{-}Var}_x$. The resulting APK-EnKF method has a mean online RMSE 64 times smaller than that of ordinary EnKF.

math.NA

A variational physics-informed graph neural network for heterogeneous solid mechanics

Stress localization in heterogeneous solids is governed by the bimaterial interface, where the displacement field remains $C^0$-continuous, while in-plane stresses jump due to the stiffness mismatch. Coordinate-based physics-informed neural networks (PINNs) represent this jump via a prescribed regularization width or a weighted interface penalty, making their accuracy sensitive to how phase-contrast changes are handled. This work presents a variational, label-free physics-informed graph neural network (PI-GNN) in which the heterogeneity is carried by the discretization rather than by the trial field. The solver operates on a conforming adaptive mesh graph, assigns constitutive behavior per element, and minimizes the discrete total potential energy as a single unweighted objective in which only first derivatives appear. The discrete energy on piecewise-linear elements coincides with the finite element (FE) Ritz functional. Dirichlet conditions are enforced by construction, with no penalty term, no interface weight, and no prescribed transition width. Using one fixed architecture, optimizer, and loss across small-strain elasticity and finite-strain Neo-Hookean hyperelasticity in two and three dimensions, the von Mises error remains below $3.58\%$ across a stiffness-contrast sweep spanning $(E_{\mathrm{inc}}/E_{\mathrm{mat}}\in[10^{-2},10^{2}])$, where a strong-form PINN degrades to $5.58\%$, and its displacement error reaches $7.66\%$ against $0.49\%$ for the PI-GNN. A trained network halves the ($\sigma_{xx}$) error of an energy-based PINN ($5.01\%$ versus $10.94\%$). Training cost exceeds a single FE solve by more than an order of magnitude, so the construction is a variationally consistent, penalty-free interface representation for parametric surrogates and inverse identification rather than a replacement for a one-off FE analysis.

math.NA