Related papers: Improved non-overlapping domain decomposition algo…
In this article, a two-level overlapping domain decomposition preconditioner is developed for solving linear algebraic systems obtained from simulating Darcy flow in high-contrast media. Our preconditioner starts at a mixed finite element…
A high-order finite element method is proposed to solve the nonlinear convection-diffusion equation on a time-varying domain whose boundary is implicitly driven by the solution of the equation. The method is semi-implicit in the sense that…
We prove linear convergence for a new family of modified Dirichlet--Neumann methods applied to quasilinear parabolic equations, as well as the convergence of the Robin--Robin method. Such nonoverlapping domain decomposition methods are…
A multiscale numerical method is proposed for the solution of semi-linear elliptic stochastic partial differential equations with localized uncertainties and non-linearities, the uncertainties being modeled by a set of random parameters. It…
Domain decomposition methods are widely used for the numerical solution of partial differential equations on high performance computers. We develop an adjoint-based a posteriori error analysis for both multiplicative and additive…
We present an iterative scheme, reminiscent of the Multigrid method, to solve large boundary value problems with Probabilistic Domain Decomposition (PDD). In it, increasingly accurate approximations to the solution are used as control…
We study the coherence in time and space of electromagnetic fields propagated through complex media. Whether for localization, imaging or telecommunication, the development of dedicated numerical techniques is generally based on the…
We analyze the convergence of the one-level overlapping domain decomposition preconditioner SORAS (Symmetrized Optimized Restricted Additive Schwarz) applied to a generic linear system whose matrix is not necessarily symmetric/self-adjoint…
We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it…
We introduce and analyze a discontinuous Galerkin FEM/BEM method for a time-harmonic eddy current problem written in terms of the magnetic field. We use nonconforming N\'ed\'elec finite elements on a partition of the interior domain coupled…
In this paper we design an iterative domain decomposition method for free boundary problems with nonlinear flux jump condition. Our approach is related to damped Newton's methods. The proposed scheme requires, in each iteration, the…
An efficient strategy to construct physics-based local surrogate models for parametric linear elliptic problems is presented. The method relies on proper generalized decomposition (PGD) to reduce the dimensionality of the problem and on an…
We present a component-based model order reduction procedure to efficiently and accurately solve parameterized incompressible flows governed by the Navier-Stokes equations. Our approach leverages a non-overlapping optimization-based domain…
A strategy to construct physics-based local surrogate models for parametric Stokes flows and coupled Stokes-Darcy systems is presented. The methodology relies on the proper generalized decomposition (PGD) method to reduce the dimensionality…
Surrogate neural network-based partial differential equation (PDE) solvers have the potential to solve PDEs in an accelerated manner, but they are largely limited to systems featuring fixed domain sizes, geometric layouts, and boundary…
We present an abstract framework for parabolic type equations which possibly degenerate on certain spatial regions. The degeneracies are such that the equations under investigation may admit a type change ranging from parabolic to elliptic…
The Hadamard decomposition is a powerful technique for data analysis and matrix compression, which decomposes a given matrix into the element-wise product of two or more low-rank matrices. In this paper, we develop an efficient algorithm to…
Domain decomposition is a technique used to reduce memory overhead on large neutron transport problems. Currently, the optimal load-balanced processor allocation for these domains is typically determined through small-scale simulations of…
The accurate and efficient treatment of eddy-current problems with movement is still a challenge. Very few works applying reduced-order models are available in the literature. In this paper, we propose a proper-orthogonal-decomposition…
We analyze a numerical method for the coupled system of the eddy current equations in $\mathbb{R}^3$ with the Landau-Lifshitz-Gilbert equation in a bounded domain. The unbounded domain is discretized by means of…