Robust and parallel scalable iterative solutions for large-scale finite cell analyses

DOI10.1016/J.FINEL.2019.01.009arXiv1809.00828WikidataQ114179397 ScholiaQ114179397MaRDI QIDQ6306201FDOQ6306201

Mohamed Elhaddad, Vera Nübel, F. de Prenter, Davide D'Angella, Jan S. Kirschke, E. H. van Brummelen, Clemens V. Verhoosel, John N. Jomo, Ernst Rank, S. Kollmannsberger

Publication date: 4 September 2018

Abstract: The finite cell method is a highly flexible discretization technique for numerical analysis on domains with complex geometries. By using a non-boundary conforming computational domain that can be easily meshed, automatized computations on a wide range of geometrical models can be performed. Application of the finite cell method, and other immersed methods, to large real-life and industrial problems is often limited due to the conditioning problems associated with these methods. These conditioning problems have caused researchers to resort to direct solution methods, which signifi- cantly limit the maximum size of solvable systems. Iterative solvers are better suited for large-scale computations than their direct counterparts due to their lower memory requirements and suitability for parallel computing. These benefits can, however, only be exploited when systems are properly conditioned. In this contribution we present an Additive-Schwarz type preconditioner that enables efficient and parallel scalable iterative solutions of large-scale multi-level hp-refined finite cell analyses.

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Fictitious domain methods for boundary value problems involving PDEs (65N85)

This page was built for publication: Robust and parallel scalable iterative solutions for large-scale finite cell analyses

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