Related papers: A domain decomposition strategy to efficiently sol…
For several classes of mathematical models that yield linear systems, the splitting of the matrix into its Hermitian and skew Hermitian parts is naturally related to properties of the underlying model. This is particularly so for…
We shall derive and propose several efficient overlapping domain decomposition methods for solving some typical linear inverse problems, including the identiffication of the flux, the source strength and the initial temperature in second…
The structure-preserving doubling algorithm (SDA) is a fairly efficient method for solving problems closely related to Hamiltonian (or Hamiltonian-like) matrices, such as computing the required solutions to algebraic Riccati equations.…
This work is concerned with the propagation of uncertainty across coupled domain problems with high-dimensional random inputs. A stochastic model reduction approach based on low-rank separated representations is proposed for the partitioned…
With tens of petaflops supercomputers already in operation and exaflops machines expected to appear within the next 10 years, efficient parallel computational methods are required to take advantage of such extreme-scale machines. In this…
Rigorous computer simulations of propagating electromagnetic fields have become an important tool for optical metrology and design of nanostructured optical components. A vectorial finite element method (FEM) is a good choice for an…
This paper deals with the estimation of the distance between the solution of a static linear mechanic problem and its approximation by the finite element method solved with a non-overlapping domain decomposition method (FETI or BDD). We…
The purpose of this research is to describe an efficient iterative method suitable for obtaining high accuracy solutions to high frequency time-harmonic scattering problems. The method allows for both refinement of local polynomial degree…
This work focuses on the development and analysis of a partitioned numerical method for moving domain, fluid-structure interaction problems. We model the fluid using incompressible Navier-Stokes equations, and the structure using linear…
Non-overlapping domain decomposition methods necessarily have to exchange Dirichlet and Neumann traces at interfaces in order to be able to converge to the underlying mono-domain solution. Well known such non-overlapping methods are the…
A framework is developed for a robust and highly accurate numerical solution of the coupled Stokes-Darcy system in three dimensions. The domain decomposition method is based on a Dirichlet-Neumann type splitting of the interface conditions…
FETI is a numerical method used to solve engineering problems. It builds on the ideas of domain decomposition, which makes it highly scalable and capable of efficiently utilizing whole supercomputers. One of the most time-consuming parts of…
Domain decomposition (DD) methods for solving time-dependent problems can be classified by (i) the method of domain decomposition used, (ii) the choice of decomposition operators (exchange of boundary conditions), and (iii) the splitting…
Nonlocal models allow for the description of phenomena which cannot be captured by classical partial differential equations. The availability of efficient solvers is one of the main concerns for the use of nonlocal models in real world…
In this paper, we present a finite element method (FEM) framework enhanced by an operator-adapted wavelet decomposition algorithm designed for the efficient analysis of multiscale electromagnetic problems. Usual adaptive FEM approaches,…
In this work, we propose a reduced basis method for efficient solution of parametric linear systems. The coefficient matrix is assumed to be a linear matrix-valued function that is symmetric and positive definite for admissible values of…
A Krylov subspace recycling method for the efficient evaluation of a sequence of matrix functions acting on a set of vectors is developed. The method improves over the recycling methods presented in [Burke et al., arXiv:2209.14163, 2022] in…
In this article, we present numerical enhancements of a multiscale domain decomposition strategy based on a LaTIn solver and dedicated to the computation of the debounding in laminates. We show that the classical scale separation is…
Barren plateaus present a major challenge in the training of variational quantum algorithms (VQAs), particularly for large-scale discretizations of nonlinear partial differential equations. In this work, we introduce a domain decomposition…
Domain decomposition methods are used for approximate solving boundary problems for partial differential equations on parallel computing systems. Specific features of unsteady problems are taken into account in the most complete way in…