Related papers: A numerical algorithm based on probing to find opt…
In the field of Domain Decomposition (DD), Optimized Schwarz Method (OSM) appears to be one of the prominent techniques to solve large scale time-harmonic wave propagation problems. It is based on appropriate transmission conditions using…
We consider a scalar wave propagation in harmonic regime modelled by Helmholtz equation with heterogeneous coefficients. Using the Multi-Trace Formalism (MTF), we propose a new variant of the Optimized Schwarz Method (OSM) that can…
Schwarz methods use a decomposition of the computational domain into subdomains and need to put boundary conditions on the subdomain boundaries. In domain truncation one restricts the unbounded domain to a bounded computational domain and…
Classically transmission conditions between subdomains are optimized for a simplified two subdomain decomposition to obtain optimized Schwarz methods for many subdomains. We investigate here if such a simplified optimization suffices for…
The convergence rate of domain decomposition methods (DDMs) strongly depends on the transmission condition at the interfaces between subdomains. Thus, an important aspect in improving the efficiency of such solvers is careful design of…
We present here nonoverlapping optimized Schwarz methods applied to heat transfer problems with heterogeneous diffusion coefficients. After a Laplace transform in time, we derive the error equation and obtain the convergence factor. The…
The generalized optimised Schwarz method proposed in [Claeys & Parolin, 2022] is a variant of the Despr\'es algorithm for solving harmonic wave problems where transmission conditions are enforced by means of a non-local exchange operator.…
Efficient handover algorithms are essential for highly performing mobile wireless communications. These algorithms depend on numerous parameters, whose settings must be appropriately optimized to offer a seamless connectivity. Nevertheless,…
Heat transfer in composites is critical in engineering, where imperfect layer contact causes thermal contact resistance (TCR), leading to interfacial temperature discontinuity. We propose solving this numerically using the optimized Schwarz…
In this paper we consider several content delivery problems (broadcast and multicast, in particular) in some restricted types of distributed systems (e.g. optical Grids and wireless sensor networks with tree-like topologies). For each…
This paper presents a distributed optimization scheme over a network of agents in the presence of cost uncertainties and over switching communication topologies. Inspired by recent advances in distributed convex optimization, we propose a…
The performance of Schwarz Waveform Relaxation is critically dependent on the choice of transmission conditions. While classical absorbing conditions work well for wave propagation, they prove insufficient for damped wave equations,…
This paper presents and evaluates a framework for the coupling of subdomain-local projection-based reduced order models (PROMs) using the Schwarz alternating method following a domain decomposition (DD) of the spatial domain on which a…
In this paper we discuss the convergence of state-of-the-art optimized Schwarz transmission conditions for Helmholtz problems defined on closed domains (i.e. setups which do not exhibit an outgoing wave condition), as commonly encountered…
We introduce a new domain decomposition strategy for time harmonic Maxwell's equations that is valid in the case of automatically generated subdomain partitions with possible presence of cross-points. The convergence of the algorithm is…
Cascade processes are responsible for many important phenomena in natural and social sciences. Simple models of irreversible dynamics on graphs, in which nodes activate depending on the state of their neighbors, have been successfully…
Optimization with time-dependent partial differential equations (PDEs) as constraints {appears} in many science and engineering applications. The associated first-order necessary optimality system consists of one forward and one backward…
Semi-online algorithms that are allowed to perform a bounded amount of repacking achieve guaranteed good worst-case behaviour in a more realistic setting. Most of the previous works focused on minimization problems that aim to minimize some…
We propose a simple, stable and distributed algorithm which directly optimizes the nonconvex maximum likelihood criterion for sensor network localization, with no need to tune any free parameter. We reformulate the problem to obtain a…
This paper considers a distributed optimization problem over a multi-agent network, in which the objective function is a sum of individual cost functions at the agents. We focus on the case when communication between the agents is described…