Related papers: A Balancing Domain Decomposition by Constraints Pr…
In this paper, we study the biharmonic equation with Dirichlet boundary conditions in a polygonal domain. In particular, we propose a method that effectively decouples the fourth-order problem into a system of two Poison equations and one…
In this paper, we propose a $C^{0}$ interior penalty method for $m$th-Laplace equation on bounded Lipschitz polyhedral domain in $\mathbb{R}^{d}$, where $m$ and $d$ can be any positive integers. The standard $H^{1}$-conforming piecewise…
In this work, we present scalable balancing domain decomposition by constraints methods for linear systems arising from arbitrary order edge finite element discretizations of multi-material and heterogeneous 3D problems. In order to enforce…
In this work, we consider an initial-boundary value problem for a time-fractional biharmonic equation in a bounded polygonal domain with a Lipschitz continuous boundary in $\mathbb{R}^2$ with clamped boundary conditions. After establishing…
Balancing domain decomposition by constraints (BDDC) algorithms with adaptive primal constraints are developed in a concise variational framework for the weighted plane wave least-squares (PWLS) discritization of Helmholtz equations with…
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…
We prove the convergence of adaptive discontinuous Galerkin and $C^0$-interior penalty methods for fully nonlinear second-order elliptic Hamilton--Jacobi--Bellman and Isaacs equations with Cordes coefficients. We consider a broad family of…
This paper provides a theoretical and numerical investigation of a penalty decomposition scheme for the solution of optimization problems with geometric constraints. In particular, we consider some situations where parts of the constraints…
The discretization of constrained nonlinear optimization problems arising in the field of topology optimization yields algebraic systems which are challenging to solve in practice, due to pathological ill-conditioning, strong nonlinearity…
A domain decomposition method for the solution of general variable-coefficient elliptic partial differential equations on regular domains is introduced. The method is based on tessellating the domain into overlapping thin slabs or shells,…
Even in cases where quantum linear solvers provide significant speedup compared to their classical counterparts, their performance depends on some of the same parameters. In particular, the condition number of the matrix which is to be…
Discontinuous Galerkin (DG) methods offer an enormous flexibility regarding local grid refinement and variation of polynomial degrees for a variety of different problem classes. With a focus on diffusion problems, we consider DG…
We present an arbitrary order discontinuous Galerkin finite element method for solving the biharmonic interface problem on the unfitted mesh. The approximation space is constructed by a patch reconstruction process with at most one degree…
Solving the Stokes equation by an optimal domain decomposition method derived algebraically involves the use of non standard interface conditions whose discretisation is not trivial. For this reason the use of approximation methods such as…
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…
The interior penalty discontinuous Galerkin method is applied to solve elliptic equations on either networks of segments or networks of planar surfaces, with arbitrary but fixed number of bifurcations. Stability is obtained by proving a…
A novel theoretical convergence rate estimate for a Balancing Domain Decomposition by Constraints algorithm is proven for the solution of the cardiac Bidomain model, describing the propagation of the electric impulse in the cardiac tissue.…
We develop two penalty based difference of convex (DC) algorithms for solving chance constrained programs. First, leveraging a rank-based DC decomposition of the chance constraint, we propose a proximal penalty based DC algorithm in the…
We present a domain decomposition formulation based on hybridization which is inspired by hybridized discontinuous Galerkin (HDG) methods, that enhance mixed domain decomposition methods by incorporating stabilization terms. Unlike…
This paper develops and analyzes some interior penalty discontinuous Galerkin methods using piecewise linear polynomials for the Helmholtz equation with the first order absorbing boundary condition in the two and three dimensions. It is…