Explicit geometric construction of \textit{sparse inverse mass matrices} for arbitrary tetrahedral grids

DOI10.1016/J.CMA.2021.113699zbMATH Open1506.65143OpenAlexW3132000393MaRDI QIDQ2021968FDOQ2021968

Authors Silvano Pitassi, Francesco Trevisan, Ruben Specogna 

Publication date 27 April 2021

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

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

zbMATH Keywords

mimetic methodscompatible discretizationsdual griddual mimetic reconstructiongeometrically-defined inverse mass matricesinverse Hodge star operators

Mathematics Subject Classification ID

Numerical solution of discretized equations for initial value and initial-boundary value problems involving PDEs (65M22)

Abstract: The geometric reinterpretation of the Finite Element Method (FEM) shows that Raviart Thomas and Nedelec mass matrices map from degrees of freedoms (DoFs) attached to geometric elements of a tetrahedral grid to DoFs attached to the barycentric dual grid. The algebraic inverses of the mass matrices map DoFs attached to the barycentric dual grid back to DoFs attached to the corresponding primal tetrahedral grid, but they are of limited practical use since they are dense. In this paper we present a new geometric construction of sparse inverse mass matrices for arbitrary tetrahedral grids and possibly anisotropic materials, debunking the conventional wisdom that the barycentric dual grid prohibits a sparse representation for inverse mass matrices. In particular, we provide a unified framework for the construction of both edge and face mass matrices and their sparse inverses. Such a unifying principle relies on novel geometric reconstruction formulas, from which, according to a well established design strategy, local mass matrices are constructed as the sum of a consistent and a stabilization term. A major difference with the approaches proposed so far is that the consistent term is defined geometrically and explicitly, that is, without the necessity of computing the inverses of local matrices. This provides a sensible speedup and an easier implementation. We use these new sparse inverse mass matrices to discretize a three dimensional Poisson problem, providing the comparison between the results obtained by various formulations on a benchmark problem with analytical solution.

Recommendations

• Sparse approximate inverse smoothers for geometric and algebraic multigrid
• \(P = 2\) continuous finite elements on tetrahedra with local mass matrix inversion
• Direct and sparse construction of consistent inverse mass matrices: general variational formulation and application to selective mass scaling
• A geometric framework for sparse matrix problems
• Preconditioning the mass matrix for high order finite element approximation on tetrahedra
• Sparse spectral-Galerkin method on an arbitrary tetrahedron using generalized Koornwinder polynomials
• Sparse grids and related approximation schemes for higher dimensional problems
• Fast inversion of the simplicial Bernstein mass matrix
• A sparse-grid isogeometric solver
• Sparsity optimized high order finite element functions for \(H(\mathrm{curl})\) on tetrahedra

Cites Work

• scientific article; zbMATH DE number 3129774 (Why is no real title available?)
• scientific article; zbMATH DE number 4102053 (Why is no real title available?)
• scientific article; zbMATH DE number 1266750 (Why is no real title available?)
• A new discretization methodology for diffusion problems on generalized polyhedral meshes
• A new set of basis functions for the discrete geometric approach
• Algebraic multigrid for k‐form Laplacians
• Analysis of compatible discrete operator schemes for elliptic problems on polyhedral meshes
• Base functions and discrete constitutive relations for staggered polyhedral grids
• Complementary geometric formulations for electrostatics
• Differential Forms, Galerkin Duality, and Sparse Inverse Approximations in Finite Element Solutions of Maxwell Equations
• Discrete Helmholtz-Hodge decomposition on polyhedral meshes using compatible discrete operators
• Finite volume methods
• Low-order reconstruction operators on polyhedral meshes: application to compatible discrete operator schemes
• Mimetic finite difference method
• Mixed finite element methods: Implementation with one unknown per element, local flux expressions, positivity, polygonal meshes, and relations to other methods
• Numerical solution of initial boundary value problems involving maxwell's equations in isotropic media
• Principles of mimetic discretizations of differential operators
• The mathematical structure of classical and relativistic physics. A general classification diagram

Cited In (4)

• \(P = 2\) continuous finite elements on tetrahedra with local mass matrix inversion
• The \textit{curved} mimetic finite difference method: allowing grids with curved faces
• Foundations of volume integral methods for eddy current problems
• Direct and sparse construction of consistent inverse mass matrices: general variational formulation and application to selective mass scaling

This page was built for publication: Explicit geometric construction of \textit{sparse inverse mass matrices} for arbitrary tetrahedral grids

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