Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Consistent Discrete 3D Hodge-type Decomposition: implementation and practical evaluation (1911.12173v2)

Published 27 Nov 2019 in math.NA, cs.NA, math.DG, and q-bio.QM

Abstract: The Hodge decomposition provides a very powerful mathematical method for the analysis of 2D and 3D vector fields. It states roughly that any vector field can be $L2$-orthogonally decomposed into a curl-free, divergence-free, and a harmonic field. The harmonic field itself can be further decomposed into three components, two of which are closely tied to the topology of the underlying domain. For practical computations it is desirable to find a discretization which preserves as many aspects inherent to the smooth theory as possible while at the same time remains computationally tractable, in particular on large-sized models. The correctness and convergence of such a discretization depends strongly on the choice of ansatz spaces defined on the surface or volumetric mesh to approximate infinite dimensional subspaces. This paper presents a consistent discretization of Hodge-type decomposition for piecewise constant vector fields on volumetric meshes. Our approach is based on a careful interplay between edge-based \textNedelec elements and face-based Crouzeix-Raviart elements resulting in a very simple formulation. The method is stable under noisy vector field and mesh resolution, and has a good performance for large sized models. We give pseudocodes for a possible implementation of the method together with some insights on how the Hodge decomposition could answer some central question in computational fluid.

Citations (5)

Summary

We haven't generated a summary for this paper yet.