Related papers: BDDC and FETI-DP under Minimalist Assumptions
After a short historical review, we present four popular substructuring methods: FETI-1, BDD, FETI-DP, BDDC, and derive the primal versions to the two FETI methods, called P-FETI-1 and P-FETI-DP, as proposed by Fragakis and Papadrakakis.…
We build and analyze Balancing Domain Decomposition by Constraint (BDDC) and Finite Element Tearing and Interconnecting Dual Primal (FETI-DP) preconditioners for elliptic problems discretized by the virtual element method (VEM). We prove…
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…
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…
In this paper, we construct and analyze a block dual-primal preconditioner for Biot's consolidation model approximated by three-field mixed finite elements based on a displacement, pressure, and total pressure formulation. The domain is…
In this paper we study the representation of partial differential equations (PDEs) as abstract differential-algebraic equations (DAEs) with dissipative Hamiltonian structure (adHDAEs). We show that these systems not only arise when there…
Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…
Using the framework of operator or Calder\'on preconditioning, uniform preconditioners are constructed for elliptic operators discretized with continuous finite (or boundary) elements. The preconditioners are constructed as the composition…
In this paper, we introduce a new type of backward stochastic differential equations (BSDEs), called conditional expectation BSDEs, whose drivers depend not only on the value of the solutions but also on their conditional expectations with…
The o-minimal structure generated by the restricted Pfaffian functions, known as restricted sub-Pfaffian sets, admits a natural measure of complexity in terms of a format $\mathcal{F}$, recording information like the number of variables and…
Among the most general structures extending the framework by Dung are the abstract dialectical frameworks (ADFs). They come equipped with various types of semantics, with the most prominent - the labeling-based one - analyzed in the context…
A simple variant of the BDDC preconditioner in which constraints are imposed on a selected set of subobjects (subdomain subedges, subfaces and vertices between pairs of subedges) is presented. We are able to show that the condition number…
We introduce an algebraic concept of the frame for abstract conditional independence (CI) models, together with basic operations with respect to which such a frame should be closed: copying and marginalization. Three standard examples of…
Pseudo-BCI-algebras generalize both BCI-algebras and pseudo-BCK-algebras, which are a non-commutative generalization of BCK-algebras. In this paper, following [J.G. Raftery and C.J. van Alten, Residuation in commutative ordered monoids with…
This paper is concerned with a compositional approach for constructing both infinite (reduced-order models) and finite abstractions (a.k.a. finite Markov decision processes (MDPs)) of large-scale interconnected discrete-time stochastic…
We give a sufficient condition for a monomial ideal to have a nonzero Betti number in each multidegree. In the case of facet ideals of simplicial forests, this condition becomes a necessary one and it allows us to characterize Betti…
Abstract argumentation frameworks (AFs) are one of the most studied formalisms in AI. In this work, we introduce a certain subclass of AFs which we call compact. Given an extension-based semantics, the corresponding compact AFs are…
A common technique to verify complex logic specifications for dynamical systems is the construction of symbolic abstractions: simpler, finite-state models whose behaviour mimics the one of the systems of interest. Typically, abstractions…
While linear FETI-DP (Finite Element Tearing and Interconnecting - Dual Primal) is an efficient iterative domain decomposition solver for discretized linear PDEs (partial differential equations), nonlinear FETI-DP is its consequent…