相关论文: A IETI-DP method for discontinuous Galerkin discre…
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…
In this paper we consider a new version of the dual-primal isogeometric tearing and interconnecting (IETI-DP) method for solving large-scale linear systems of algebraic equations arising from discontinuous Galerkin (dG) isogeometric…
In this paper, we investigate Dual-Primal Isogeometric Tearing and Interconnecting (IETI-DP) methods for conforming Galerkin discretizations on multi-patch computational domains with inexact subdomain solvers. Recently, the authors have…
In this paper, we develop a convergence theory for Dual-Primal Isogeometric Tearing and Interconnecting (IETI-DP) solvers for isogeometric multi-patch discretizations of the Poisson problem, where the patches are coupled using discontinuous…
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…
Recently, the authors have proposed and analyzed isogeometric tearing and interconnecting (IETI-DP) solvers for multi-patch discretizations in Isogeometric Analysis. Conforming and discontinuous Galerkin settings have been considered. In…
We study Dual-Primal Isogeometric Tearing and Interconnecting (IETI-DP) solvers for non-conforming multi-patch discretizations of a generalized Poisson problem. We realize the coupling between the patches using a symmetric interior penalty…
In this paper, we present the analysis of the discontinuous Galerkin dual-primal isogeometric tearing and interconnecting method (dG-IETI-DP) for the two-dimensional case where we only consider vertex primal variables. The dG-IETI-DP method…
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…
In Isogeometric Analysis, the computational domain is often described as multi-patch, where each patch is given by a tensor product spline/NURBS parametrization. In this work we propose a FETI-like solver where local inexact solvers exploit…
We consider dual-primal isogeometric tearing and interconnection (IETI-DP) solvers for multi-patch geometries in Isogeometric Analysis. Recently, the authors have published a convergence analysis for those solvers that is explicit in both…
We propose and analyze a domain decomposition solver for the biharmonic problem. The problem is discretized in a conforming way using multi-patch Isogeometric Analysis. As first step, we discuss the setup of a sufficiently smooth…
In this paper a discretization based on discontinuous Galerkin (DG) method for an elliptic two-dimensional problem with discontinuous coefficients is considered. The problem is posed on a polygonal region $\Omega$ which is a union of $N$…
In this work, we study the approximation properties of multi-patch dG-IgA methods, that apply the multipatch Isogeometric Analysis (IgA) discretization concept and the discontinuous Galerkin (dG) technique on the interfaces between the…
The Isogeometric Analysis (IgA) of boundary value problems in complex domains often requires a decomposition of the computational domain into patches such that each of which can be parametrized by the so-called geometrical mapping. In this…
We are interested in a fast solver for linear systems obtained by discretizing the Stokes problem with multi-patch Isogeometric Analysis. We use Dual-Primal Isogeometric Tearing and Interconnecting (IETI-DP) methods. In resent years,…
We consider the linearized elasticity equation, discretized with multi-patch Isogeometric Analysis. A standard discretization error analysis is based on Korn's inequality, which degrades for certain geometries, such as long and thin…
Isogeometric Analysis is a high-order discretization method for boundary value problems that uses a number of degrees of freedom which is as small as for a low-order method. Standard isogeometric discretizations require a global…
Isogeometric Analysis (IgA) is a versatile method for the discretization of partial differential equations on complex domains, which arise in various applications of science and engineering. Some complex geometries can be better described…
We present a novel method for solving high-order partial differential equations (PDEs) over planar multi-patch geometries demonstrated on the basis of the polyharmonic equation of order $m$, $m \geq 1$, which is a particular linear elliptic…