<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:contributor>Krause, Rolf</dc:contributor>
  <dc:creator>Kothari, Hardik</dc:creator>
  <dc:date>2020-07-28</dc:date>
  <dc:description xmlns:ns0="xml" ns0:lang="en">In the unfitted finite element methods, traditionally we can use Nitsche's method or the method of Lagrange multipliers to enforce the boundary/interface  conditions. In this work, we present tailored multilevel methods for solving the problems stemming from either of these discretizations. Generally, multigrid  methods require a hierarchy of finite element (FE) spaces which can be created geometrically using a hierarchy of nested meshes. However, in the unfitted FE  framework, standard multigrid methods might demonstrate poor convergence properties if the hierarchy of FE spaces employed is not nested. We design a  prolongation operator for the multigrid methods in such a way that it can accommodate the arbitrary shape of the boundaries/interfaces and recursively induces  a nested FE space hierarchy. The prolongation operator is constructed using so-called pseudo-$L^2$-projections; as common, the adjoint of the prolongation  operator is employed as the restriction operator. We employ this transfer operator in our multigrid method and solve the linear system of equations that arise  from using Nitsche's method. In the numerical experiments, we show that our multigrid method is robust with respect to highly varying coefficients and the  number of interfaces in a domain. It shows level independent convergence rates when applied to different variants of Nitsche's method. Additionally, we present  a generalized multigrid method for solving the problems stemming from the discretization of the interface conditions using Lagrange multipliers. This method  can be used to solve the quadratic minimization problems with linear equality/inequality constraints, efficiently. The essential component of this multigrid  method is the technique that decouples the linear constraints by projecting them into a new basis. The decoupled constraints are then handled by a modified  version of the projected Gauss-Seidel method. By means of several numerical experiments, we exhibit the robustness of our multigrid method for the boundary  or interface conditions with respect to varying coefficients. In addition, we demonstrate that this multigrid method can also handle the inequality constraints  arising from the contact problems in the unfitted framework.</dc:description>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>https://susi.usi.ch/global/documents/319417</dc:identifier>
  <dc:identifier>https://n2t.net/ark:/12658/srd1319417</dc:identifier>
  <dc:identifier>https://susi.usi.ch/documents/319417/files/2020INFO009.pdf</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>info:eu-repo/semantics/altIdentifier/urn/urn:nbn:ch:rero-006-121324</dc:relation>
  <dc:relation>info:eu-repo/semantics/altIdentifier/ark/12658/srd1319417</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>License undefined</dc:rights>
  <dc:subject xmlns:ns1="xml" ns1:lang="en">Multigrid methods</dc:subject>
  <dc:subject xmlns:ns2="xml" ns2:lang="en">Extended finite element method (XFEM)</dc:subject>
  <dc:subject xmlns:ns3="xml" ns3:lang="en">CutFEM</dc:subject>
  <dc:subject xmlns:ns4="xml" ns4:lang="en">Discontinuities</dc:subject>
  <dc:subject xmlns:ns5="xml" ns5:lang="en">Constrained optimiztation</dc:subject>
  <dc:subject>info:eu-repo/classification/udc/004</dc:subject>
  <dc:title xmlns:ns6="xml" ns6:lang="en">Multilevel solution strategies for unfitted finite element methods</dc:title>
  <dc:type>http://purl.org/coar/resource_type/c_db06</dc:type>
</oai_dc:dc>
