Mass lumping and stabilization for immersogeometric analysis
Yannis Voet, Espen Sande, Annalisa Buffa
TL;DR
This work analyzes mass lumping in immersogeometric analysis and shows that, although lumping cures the CFL restriction for small trimmed elements, it can activate spurious low-frequency modes that degrade the dynamic solution. It introduces a polynomial-extension stabilization that extends basis functions from well-behaved (good) elements into badly cut (bad) trimmed elements, producing stabilized matrices $\tilde{K}$ and $\tilde{M}$ and enabling lumped solves that exhibit accuracy and CFL behavior comparable to boundary-fitted discretizations. The stabilization successfully removes the deleterious low-energy modes for both smooth IGA and standard $C^0$ finite elements across diverse test geometries, including 1D trims, rotated squares, extruded plates, and perforated plates. The work also discusses the limitations of conventional row-sum lumping for high-order splines and highlights potential directions, such as extended spaces and advanced lumping schemes, to further improve robustness in trimmed geometries.
Abstract
Trimmed (multi-patch) geometries are the state-of-the-art technology in computer-aided design for industrial applications such as automobile crashworthiness. In this context, fast solution techniques extensively rely on explicit time integration schemes in conjunction with mass lumping techniques that substitute the consistent mass with a (usually diagonal) approximation. For smooth isogeometric discretizations, Leidinger [1] first showed that mass lumping removed the dependency of the critical time-step on the size of trimmed elements. This finding has attracted considerable attention but has unfortunately overshadowed another more subtle effect: mass lumping may disastrously impact the accuracy of low frequencies and modes, potentially inducing spurious oscillations in the solution. In this article, we provide compelling evidence for this phenomenon and later propose a stabilization technique based on polynomial extensions that restores a level of accuracy comparable to boundary-fitted discretizations.
