Inexact Dual-Primal Isogeometric Tearing and Interconnecting Methods

From MaRDI portal
Publication:5114557

DOI10.1007/978-3-319-93873-8_37zbMATH Open1450.65166arXiv1705.04531OpenAlexW2962934772MaRDI QIDQ5114557FDOQ5114557

Christoph Hofer, Stefan Takacs, Ulrich Langer

Publication date: 24 June 2020

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Abstract: 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 discretizations of elliptic boundary value problems. The considered methods are extensions of standard finite element tearing and interconnecting methods to isogeometric analysis. The algorithms are implemented by means of energy minimizing primal subspaces. We discuss the replacement of local sparse direct solvers by iterative methods, particularly, multigrid solvers. We investigate the incorporation of these iterative solvers into different formulations of the algorithm. Finally, we present numerical examples comparing the performance of these inexact versions.


Full work available at URL: https://arxiv.org/abs/1705.04531





Cites Work


Cited In (6)






This page was built for publication: Inexact Dual-Primal Isogeometric Tearing and Interconnecting Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114557)