• Corpus ID: 238634183

Inexact IETI-DP for conforming isogeometric multi-patch discretizations

@article{Schneckenleitner2021InexactIF,
  title={Inexact IETI-DP for conforming isogeometric multi-patch discretizations},
  author={Rainer Schneckenleitner and Stefan Takacs},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.06087}
}
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 proven a condition number estimate for a IETI-DP method using sparse LU factorizations for the subdomain problems that is explicit, among other parameters, in the grid size and the spline degree. In the present paper, we replace the sparse LU factorizations by… 

Figures and Tables from this paper

References

SHOWING 1-8 OF 8 REFERENCES
Inexact Dual-Primal Isogeometric Tearing and Interconnecting Methods
In this paper, we investigate inexact variants of dual-primal isogeometric tearing and interconnecting methods for solving large-scale systems of linear equations arising from Galerkin isogeometric
Isogeometric Preconditioners Based on Fast Solvers for the Sylvester Equation
TLDR
It is shown that a preconditioning strategy which is based on the solution of a Sylvester-like equation at each step of an iterative solver is robust with respect to both mesh size and spline degree, although it may suffer from the presence of complicated geometry or coefficients.
Dual‐primal isogeometric tearing and interconnecting solvers for multipatch continuous and discontinuous Galerkin IgA equations
We present results regarding fast and robust solvers for equations arising from continuous and discontinuous Galerkin discretization of heterogeneous diffusion problems in the context of Isogeometric
IETI – Isogeometric Tearing and Interconnecting
Inexact FETI‐DP methods
TLDR
It is shown that for a very large number of subdomains and a veryLarge coarse problem, the inexact method can be superior.
FETI‐DP: a dual–primal unified FETI method—part I: A faster alternative to the two‐level FETI method
TLDR
This paper presents a dual–primal formulation of the FETI‐2 concept that eliminates the need for that second set of Lagrange multipliers, and unifies all previously developed one‐level and two‐level FETi algorithms into a single dual‐primal FetI‐DP method.
Condition number bounds for IETI-DP methods that are explicit in h and p
TLDR
This work derives condition number bounds that show the expected behavior in the grid size h and that are quasi-linear in the spline degree p and provides a convergence analysis that covers several choices of the primal degrees of freedom: the vertex values, the edge averages, and the combination of both.