Related papers: Learning Adaptive Constraints in Nonlinear FETI-DP…
We analyze the performance of a state-of-the-art domain decomposition approach, the Finite Element Tearing and Interconnecting Dual Primal (FETI-DP) method, for the efficient solution of very large linear systems arising from elliptic…
The combination of nonlinear FETI-DP (Dual Primal Finite Element Tearing and Interconnecting) and Quasi-Newton methods using a sequential quadratic programming (SQP) approach is considered. Nonlinear FETI-DP methods are parallel iterative…
We study a framework that allows to solve the coarse problem in the FETI-DP method approximately. It is based on the saddle-point formulation of the FETI-DP system with a block-triangular preconditioner. One of the blocks approximates the…
In this paper we consider second order elliptic partial differential equations with highly varying (heterogeneous) coefficients on a two-dimensional region. The problems are discretized by a composite finite element (FE) and discontinuous…
BDDC and FETI-DP algorithms are developed for three-dimensional elliptic problems with adaptively enriched coarse components. It is known that these enriched components are necessary in the development of robust preconditioners. To form the…
We deal with the Finite Element Tearing and Interconnecting Dual Primal (FETI-DP) preconditioner for elliptic problems discretized by the virtual element method (VEM). We extend the result of [22] to the three dimensional case. We prove…
Isogeometric Analysis is a variant of the finite element method, where spline functions are used for the representation of both the geometry and the solution. Splines, particularly those with higher degree, achieve their full approximation…
Dual-Primal Finite Element Tearing and Interconnecting (FETI-DP) algorithms are developed for a 2D Biot model. The model is formulated with mixed-finite elements as a saddle-point problem. The displacement $\mathbf{u}$ and the Darcy flux…
The dual-primal isogeometric tearing and interconnecting (IETI-DP) method is the adaption of the dual-primal finite element tearing and interconnecting (FETI-DP) method to isogeometric analysis of scalar elliptic boundary value problems…
The FETI-DP algorithms, proposed by the authors in [SIAM J. Numer. Anal., 51 (2013), pp.~1235--1253] and [Internat. J. Numer. Methods Engrg., 94 (2013), pp.~128--149] for solving incompressible Stokes equations, are extended to…
In this paper we investigate the parallelization of dual-primal isogeometric tearing and interconnecting (IETI-DP) type methods for solving large-scale continuous and discontinuous Galerkin systems of equations arising from Isogeometric…
A unified framework of FETI-DP algorithms is proposed for solving the system of linear equations arising from the mixed finite element approximation of incompressible Stokes equations. A distinctive feature of this framework is that it…
We propose a domain decomposition method for the efficient simulation of nonlocal problems. Our approach is based on a multi-domain formulation of a nonlocal diffusion problem where the subdomains share "nonlocal" interfaces of the size of…
The Balanced Domain Decomposition (BDD) method and the Finite Element Tearing and Interconnecting (FETI) method are two commonly used non-overlapping domain decomposition methods. Due to strong theoretical and numerical similarities, these…
This paper presents a strategy for a posteriori error estimation for substructured problems solved by non-overlapping domain decomposition methods. We focus on global estimates of the discretization error obtained through the error in…
We critically assess the performance of several variants of dual and dual-primal domain decomposition strategies in problems with fixed subdomain partitioning and high heterogeneity in stiffness coefficients typically arising in topology…
We consider adaptive finite element methods for second-order elliptic PDEs, where the arising discrete systems are not solved exactly. For contractive iterative solvers, we formulate an adaptive algorithm which monitors and steers the…
We construct solvers for an isogeometric multi-patch discretization, where the patches are coupled via a discontinuous Galerkin approach, which allows the consideration of discretizations that do not match on the interfaces. We solve the…
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…
We propose an algorithm for the efficient parallel implementation of elastoplastic problems with hardening based on the so-called TFETI (Total Finite Element Tearing and Interconnecting) domain decomposition method. We consider an…