Asynchronous global–local non-invasive coupling for linear elliptic problems
نویسندگان
چکیده
This paper presents the first asynchronous version of Global/Local non-invasive coupling, capable dealing efficiently with multiple, possibly adjacent, patches. We give a new interpretation coupling in terms primal domain decomposition method, and we prove convergence relaxed iteration. The paradigm lifts many bottlenecks performance. illustrate method on several linear elliptic problems as encountered thermal elasticity studies.
منابع مشابه
Non-coercive Linear Elliptic Problems
We study here some linear elliptic partial differential equations (with Dirichlet, Fourier or mixed boundary conditions), to which convection terms (first order perturbations) are added that entail the loss of the classical coercivity property. We prove the existence, uniqueness and regularity results for the solutions to these problems. Mathematics Subject Classification (2000): 35J25.
متن کاملAsynchronous multi-domain variational integrators for non-linear problems
We develop an asynchronous time integration and coupling method with domain decomposition for linear and non-linear problems in mechanics. To ensure stability in the time integration and in coupling between domains, we use variational integrators with local Lagrange multipliers to enforce continuity at the domain interfaces. The asynchronous integrator lets each domain step with its own time st...
متن کاملEfficient metacomputing of elliptic linear and non-linear problems
Metacomputing is a method of using the GRID, which originated in the US and quickly was also picked up by European and Japanese researchers where a number of challenging projects were aiming at the exploitation of such distributed resources. Especially the GLOBUS project (The globus project: a status report, Proceedings IPPS/SPDP’98 Heterogeneous Computing Workshop, 1998, pp. 4–18) has contribu...
متن کاملEquivalent operator preconditioning for linear elliptic problems
Finite element or finite difference approximations to linear partial differential equations of elliptic type lead to algebraic systems, normally of very large size. However, since the matrices are sparse, even extremely large-sized systems can be handled. To save computer memory and elapsed time, such equations are normally solved by iteration, most commonly using a preconditioned conjugate gra...
متن کاملAsynchronous Non-Convex Optimization for Separable Problems
This paper considers the distributed optimization of a sum of locally observable, nonconvex functions. The optimization is performed over a multi-agent networked system, and each local function depends only on a subset of the variables. An asynchronous and distributed alternating directions method of multipliers (ADMM) method that allows the nodes to defer or skip the computation and transmissi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Methods in Applied Mechanics and Engineering
سال: 2023
ISSN: ['0045-7825', '1879-2138']
DOI: https://doi.org/10.1016/j.cma.2023.115910