arXiv subjects

David M. Williams

Publications and source records attributed to David M. Williams.

16 recordsLinked to original sources

arXiv2025

Versatile mixed methods for weakly-compressible flows

Versatile mixed finite element methods were originally developed by Chen and Williams for isothermal incompressible flows in "Versatile mixed methods for the incompressible Navier-Stokes equations," Computers & Mathematics with Applications, Volume 80, 2020. Thereafter, these methods were extended by Miller, Chen, and Williams to non-isothermal incompressible flows in "Versatile mixed methods for non-isothermal incompressible flows," Computers & Mathematics with Applications, Volume 125, 2022. The main advantage of these methods lies in their flexibility. Unlike traditional mixed methods, they retain the divergence terms in the momentum and temperature equations. As a result, the favorable properties of the schemes are maintained even in the presence of non-zero divergence. This makes them an ideal candidate for an extension to compressible flows, in which the divergence does not generally vanish. In the present article, we finally construct the compressible extension of the methods. In addition, we demonstrate the excellent performance of the resulting methods for weakly-compressible flows that arise near the incompressible limit, as well as moderately-compressible flows that arise near Mach 0.5.

math.NA↗

arXiv2025

Error estimates for the interpolation and approximation of gradients and vector fields on protected Delaunay meshes in $\mathbb{R}^d$

One frequently needs to interpolate or approximate gradients on simplicial meshes. Unfortunately, there are very few explicit mathematical results governing the interpolation or approximation of vector-valued functions on Delaunay meshes in more than two dimensions. Most of the existing results are tailored towards interpolation with piecewise linear polynomials. In contrast, interpolation with piecewise high-order polynomials is not well understood. In particular, the results in this area are sometimes difficult to immediately interpret, or to specialize to the Delaunay setting. In order to address this issue, we derive explicit error estimates for high-order, piecewise polynomial gradient interpolation and approximation on protected Delaunay meshes. In addition, we generalize our analysis beyond gradients, and obtain error estimates for sufficiently-smooth vector fields. Throughout the paper, we show that the quality of interpolation and approximation often depends (in part) on the minimum thickness of simplices in the mesh. Fortunately, the minimum thickness can be precisely controlled on protected Delaunay meshes in $\mathbb{R}^d$.

math.NA↗

arXiv2024

Quasi-optimal interpolation of gradients and vector-fields on protected Delaunay meshes in $\mathbb{R}^d$

There are very few mathematical results governing the interpolation of functions or their gradients on Delaunay meshes in more than two dimensions. Unfortunately, the standard techniques for proving optimal interpolation properties are often limited to triangular meshes. Furthermore, the results which do exist, are tailored towards interpolation with piecewise linear polynomials. In fact, we are unaware of any results which govern the high-order, piecewise polynomial interpolation of functions or their gradients on Delaunay meshes. In order to address this issue, we prove that quasi-optimal, high-order, piecewise polynomial gradient interpolation can be successfully achieved on protected Delaunay meshes. In addition, we generalize our analysis beyond gradient interpolation, and prove quasi-optimal interpolation properties for sufficiently-smooth vector fields. Throughout the paper, we use the words 'quasi-optimal', because the quality of interpolation depends (in part) on the minimum thickness of simplicies in the mesh. Fortunately, the minimum thickness can be precisely controlled on protected Delaunay meshes in $\mathbb{R}^d$. Furthermore, the current best mathematical estimates for minimum thickness have been obtained on such meshes. In this sense, the proposed interpolation is optimal, although, we acknowledge that future work may reveal an alternative Delaunay meshing strategy with better control over the minimum thickness. With this caveat in mind, we refer to our interpolation on protected Delaunay meshes as quasi-optimal.

math.NA↗

arXiv2024

Edge-based discretizations on triangulations in $\mathbb{R}^d$, with special attention to four-dimensional space

Many time-dependent problems in the field of computational fluid dynamics can be solved using space-time methods. However, such methods can encounter issues with computational cost and robustness. In order to address these issues, efficient, node-centered edge-based schemes are currently being developed. In these schemes, a median-dual tessellation of the space-time domain is constructed based on an initial triangulation. These methods are node-centered or node-based, as the primary components of the discretization are median-dual regions (polytopes) which surround the mesh nodes. These methods are extremely robust, as the median-dual regions will often maintain a positive volume and other good geometric properties, even in cases when some of the associated simplices have negative volumes, or other poor geometric properties. Unfortunately, it is not straightforward to construct median-dual regions or deduce their properties on triangulations for $d \geq 3$. In this work, we provide the first rigorous definition of median-dual regions on triangulations in any number of dimensions. In addition, we introduce a new method for computing the hypervolume of a median-dual region in $\mathbb{R}^d$. Furthermore, we provide a new approach for computing the directed-hyperarea vectors for faces of a median-dual region in $\mathbb{R}^{4}$. These geometric properties are key for developing node-centered edge-based schemes in any number of dimensions. We conclude our work by analyzing the computational complexity of the edge-based schemes, and performing numerical experiments in two, three, and four dimensions. We successfully demonstrate their effectiveness by obtaining accurate solutions to several canonical problems.

math.NA↗

arXiv2024

Spline-based solution transfer for space-time methods in 2D+t

This work introduces a new solution-transfer process for slab-based space-time finite element methods. The new transfer process is based on Hsieh-Clough-Tocher (HCT) splines and satisfies the following requirements: (i) it maintains high-order accuracy up to 4th order, (ii) it preserves a discrete maximum principle, (iii) it asymptotically enforces mass conservation, and (iv) it constructs a smooth, continuous surrogate solution in between space-time slabs. While many existing transfer methods meet the first three requirements, the fourth requirement is crucial for enabling visualization and boundary condition enforcement for space-time applications. In this paper, we derive an error bound for our HCT spline-based transfer process. Additionally, we conduct numerical experiments quantifying the conservative nature and order of accuracy of the transfer process. Lastly, we present a qualitative evaluation of the visualization properties of the smooth surrogate solution.

math.NA↗

arXiv2024

Anisotropic Delaunay hypervolume meshing for space-time applications: point insertion, quality heuristics, and bistellar flips

This paper provides a comprehensive guide to generating unconstrained, simplicial, four-dimensional (4D), hypervolume meshes for space-time applications. While several universal procedures for constructing unconstrained, d-dimensional, anisotropic Delaunay meshes are already known, many of the explicit implementation details are missing from the relevant literature for cases in which d >= 4. As a result, the purpose of this paper is to provide explicit descriptions of the key components in the 4D meshing algorithm: namely, the point-insertion process, geometric predicates, element quality heuristics, and bistellar flips. This paper represents a natural continuation of the work which was pioneered by Anderson et al. in "Surface and hypersurface meshing techniques for space-time finite element methods", Computer-Aided Design, 2023. In this previous paper, hypersurface meshes were generated using a novel, trajectory-tracking procedure. In the current paper, we are interested in generating coarse, 4D hypervolume meshes (boundary meshes) which are formed by sequentially inserting points from an existing hypersurface mesh. In the latter portion of this paper, we present numerical experiments which demonstrate the viability of this approach for a simple, convex domain. Although, our main focus is on the generation of hypervolume boundary meshes, the techniques described in this paper are broadly applicable to a much wider range of 4D meshing methods. We note that the more complex topics of constrained hypervolume meshing, and boundary recovery for non-convex domains will be covered in a companion paper.

math.NA↗

arXiv2024

An explicit construction of optimized interpolation points on the 4-simplex

In this work, a family of symmetric interpolation points are generated on the four-dimensional simplex (i.e. the pentatope). These points are optimized in order to minimize the Lebesgue constant. The process of generating these points closely follows that outlined by Warburton in "An explicit construction of interpolation nodes on the simplex," Journal of Engineering Mathematics, 2006. Here, Warburton generated optimal interpolation points on the triangle and tetrahedron by formulating explicit geometric warping and blending functions, and applying these functions to equidistant nodal distributions. The locations of the resulting points were Lebesgue-optimized. In our work, we extend this procedure to four dimensions, and construct interpolation points on the pentatope up to order ten. The Lebesgue constants of our nodal sets are calculated, and are shown to outperform those of equidistant nodal distributions.

math.NA↗

arXiv2023

Conforming Finite Element Function Spaces in Four Dimensions, Part 1: Foundational Principles and the Tesseract

The stability, robustness, accuracy, and efficiency of space-time finite element methods crucially depend on the choice of approximation spaces for test and trial functions. This is especially true for high-order, mixed finite element methods which often must satisfy an inf-sup condition in order to ensure stability. With this in mind, the primary objective of this paper and a companion paper is to provide a wide range of explicitly stated, conforming, finite element spaces in four-dimensions. In this paper, we construct explicit high-order conforming finite elements on 4-cubes (tesseracts); our construction uses tools from the recently developed `Finite Element Exterior Calculus'. With a focus on practical implementation, we provide details including Piola-type transformations, and explicit expressions for the volumetric, facet, face, edge, and vertex degrees of freedom. In addition, we establish important theoretical properties, such as the exactness of the finite element sequences, and the unisolvence of the degrees of freedom.

math.NA↗

arXiv2023

Conforming Finite Element Function Spaces in Four Dimensions, Part II: The Pentatope and Tetrahedral Prism

In this paper, we present explicit expressions for conforming finite element function spaces, basis functions, and degrees of freedom on the pentatope and tetrahedral prism elements. More generally, our objective is to construct finite element function spaces that maintain conformity with infinite-dimensional spaces of a carefully chosen de Rham complex. This paper is a natural extension of the companion paper entitled "Conforming Finite Element Function Spaces in Four Dimensions, Part I: Foundational Principles and the Tesseract" by Nigam and Williams, (2023). In contrast to Part I, in this paper we focus on two of the most popular elements which do not possess a full tensor-product structure in all four coordinate directions. We note that these elements appear frequently in existing space-time finite element methods. In order to build our finite element spaces, we utilize powerful techniques from the recently developed 'Finite Element Exterior Calculus'. Subsequently, we translate our results into the well-known language of linear algebra (vectors and matrices) in order to facilitate implementation by scientists and engineers.

math.NA↗

arXiv2023

Surface and hypersurface meshing techniques for space-time finite element methods

A general method is introduced for constructing two-dimensional (2D) surface meshes embedded in three-dimensional (3D) space time, and 3D hypersurface meshes embedded in four-dimensional (4D) space time. In particular, we begin by dividing the space-time domain into time slabs. Each time slab is equipped with an initial plane (hyperplane), in conjunction with an unstructured simplicial surface (hypersurface) mesh that covers the initial plane. We then obtain the vertices of the terminating plane (hyperplane) of the time slab from the vertices of the initial plane using a space-time trajectory-tracking approach. Next, these vertices are used to create an unstructured simplicial mesh on the terminating plane (hyperplane). Thereafter, the initial and terminating boundary vertices are stitched together to form simplicial meshes on the intermediate surfaces or sides of the time slab. After describing this new mesh-generation method in rigorous detail, we provide the results of multiple numerical experiments which demonstrate its validity and flexibility.

math.NA↗

arXiv2022

Generalized Korn's Inequalities for Piecewise $H^2$ Vector Fields

The purpose of this paper is to construct a new class of discrete generalized Korn's inequalities for piecewise H2 vector fields in three-dimensional space. The resulting Korn's inequalities are different from the standard Korn's inequalities, as they involve the trace-free symmetric gradient operator, in place of the usual symmetric gradient operator. It is anticipated that the new generalized Korn's inequalities will be useful for the analysis of a broad range of finite element methods, including mixed finite element methods and discontinuous Galerkin methods.

math.NA↗

arXiv2021

Foundations of space-time finite element methods: polytopes, interpolation, and integration

The main purpose of this article is to facilitate the implementation of space-time finite element methods in four-dimensional space. In order to develop a finite element method in this setting, it is necessary to create a numerical foundation, or equivalently a numerical infrastructure. This foundation should include a collection of suitable elements (usually hypercubes, simplices, or closely related polytopes), numerical interpolation procedures (usually orthonormal polynomial bases), and numerical integration procedures (usually quadrature rules). It is well known that each of these areas has yet to be fully explored, and in the present article, we attempt to directly address this issue. We begin by developing a concrete, sequential procedure for constructing generic four-dimensional elements (4-polytopes). Thereafter, we review the key numerical properties of several canonical elements: the tesseract, tetrahedral prism, and pentatope. Here, we provide explicit expressions for orthonormal polynomial bases on these elements. Next, we construct fully symmetric quadrature rules with positive weights that are capable of exactly integrating high-degree polynomials, e.g. up to degree 17 on the tesseract. Finally, the quadrature rules are successfully tested using a set of canonical numerical experiments on polynomial and transcendental functions.

math.NA↗

arXiv2021

Enabling four-dimensional conformal hybrid meshing with cubic pyramids

The main purpose of this article is to develop a novel refinement strategy for four-dimensional hybrid meshes based on cubic pyramids. This optimal refinement strategy subdivides a given cubic pyramid into a conforming set of congruent cubic pyramids and invariant bipentatopes. The theoretical properties of the refinement strategy are rigorously analyzed and evaluated. In addition, a new class of fully symmetric quadrature rules with positive weights are generated for the cubic pyramid. These rules are capable of exactly integrating polynomials with degrees up to 12. Their effectiveness is successfully demonstrated on polynomial and transcendental functions. Broadly speaking, the refinement strategy and quadrature rules in this paper open new avenues for four-dimensional hybrid meshing, and space-time finite element methods.

math.NA↗

arXiv2020

A finite element discrete Boltzmann method for high Knudsen number flows

Simulations of the discrete Boltzmann Bhatnagar-Gross-Krook (BGK) equation are an important tool for understanding fluid dynamics in non-continuum regimes. Here, we introduce a discontinuous Galerkin finite element method (DG-FEM) for spatial discretization of the discrete Boltzmann equation for isothermal flows with Knudsen numbers (Kn~O(1)). In conjunction with a high-order Runge-Kutta time marching scheme, this method is capable of achieving high-order accuracy in both space and time, while maintaining a compact stencil. We validate the spatial order of accuracy of the scheme on a two-dimensional Couette flow with Kn = 1 and the D2Q16 velocity discretization. We then apply the scheme to lid-driven micro-cavity flow at Kn = 1, 2, and 8, and we compare the ability of Gauss-Hermite (GH) and Newton-Cotes (NC) velocity sets to capture the high non-linearity of the flow-field. While GH quadrature provides higher integration strength with fewer points, the NC quadrature has more uniformly distributed nodes with weights greater than machine-zero, helping to avoid the so-called ray-effect. Broadly speaking, we anticipate that the insights from this work will help facilitate the efficient implementation and application of high-order numerical methods for complex high Knudsen number flows.

physics.flu-dyn↗

arXiv2020

Versatile Mixed Methods for Non-Isothermal Incompressible Flows

The purpose of this paper is to extend the versatile mixed methods originally developed by Chen and Williams for isothermal flows in "Versatile Mixed Methods for the Incompressible Navier-Stokes Equations," Computers & Mathematics with Applications, 2020, (under review), to simulate non-isothermal incompressible flows. These new mixed methods are particularly interesting, as with only minor modifications they can be applied to a much broader range of flows, including non-isothermal weakly-compressible flows, and fully-compressible flows. In the main body of this paper, we carefully develop these mixed methods for solving the Boussinesq model equations. Thereafter, we prove the L2-stability of the discrete temperature field, and assess the practical behavior of the methods by applying them to a set of well-known convection problems.

physics.comp-ph↗

arXiv2020

Versatile Mixed Methods for the Incompressible Navier-Stokes Equations

In the spirit of the "Principle of Equipresence" introduced by Truesdell & Toupin, The Classical Field Theories (1960), we use the full version of the viscous stress tensor which was originally derived for compressible flows, instead of the classical incompressible stress tensor. In our approach, the divergence-free constraint for the viscous stress term is not enforced ahead of discretization. Instead, our formulation allows the scheme itself to "choose" a consistent way to interpret the divergence-free constraint: i.e., the divergence-free constraint is interpreted (or enforced) in a consistent fashion in both the mass conservation equation and the stress tensor term (in the momentum equation). Furthermore, our approach preserves the original symmetrical properties of the stress tensor, e.g. its rotational invariance, and it remains physically correct in the context of compressible flows. As a result, our approach facilitates versatility and code reuse. In this paper, we introduce our approach and establish some important mathematical properties for the resulting class of finite element schemes. More precisely, for general mixed methods, which are not necessarily pointwise divergence-free, we establish the existence of a new norm induced by the full, viscous bilinear form. Thereafter, we prove the coercivity of the viscous bilinear form and the semi-coercivity of a convective trilinear form. In addition, we demonstrate L2-stability of the discrete velocity fields for the general class of methods and (by deduction) the H(div)-conforming methods. Finally, we run some numerical experiments to illustrate the behavior of the versatile mixed methods, and we make careful comparisons with a conventional H(div)-conforming scheme.

math.NA↗