Fast multigrid solvers for conforming and non-conforming multi-patch isogeometric analysis

From MaRDI portal
Publication:2021111

DOI10.1016/J.CMA.2020.113301zbMATH Open1506.65229arXiv1902.01818OpenAlexW2929593731MaRDI QIDQ2021111FDOQ2021111


Authors: Stefan Takacs Edit this on Wikidata


Publication date: 26 April 2021

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Abstract: 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 parameterization of the computational domain. In non-trivial cases, the domain is decomposed into patches having separate parameterizations and separate discretization spaces. If the discretization spaces agree on the interfaces between the patches, the coupling can be done in a conforming way. Otherwise, non-conforming discretizations (utilizing discontinuous Galerkin approaches) are required. The author and his coworkers have previously introduced multigrid solvers for Isogeometric Analysis for the conforming case. In the present paper, these results are extended to the non-conforming case. Moreover, it is shown that the multigrid solves get even more powerful if the proposed smoother is combined with a (standard) Gauss-Seidel smoother.


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




Recommendations




Cites Work


Cited In (8)

Uses Software





This page was built for publication: Fast multigrid solvers for conforming and non-conforming multi-patch isogeometric analysis

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