Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mesh”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

High-Order Mesh r-Adaptivity with Tangential Relaxation and Guaranteed Mesh Validity

High-order meshes are crucial for achieving optimal convergence rates in curvilinear domains, preserving symmetry, and aligning with key flow features in moving mesh simulations [1], but their quality is challenging to control. In prior work, we have developed techniques based on Target-Matrix Optimization Paradigm (TMOP) to adapt a given high-order mesh to the geometry and solution of the partial differential equation (PDE) [2, 3]. Here, we extend this framework to address two key gaps in the literature for highorder mesh 𝑟-adaptivity. First, we introduce tangential relaxation on curved surfaces using solely the discrete mesh representation, eliminating the need for access to underlying geometry (e.g., CAD model). Second, we ensure a continuously positive Jacobian determinant throughout the domain. This determinant positivity is essential for using the high-order mesh resulting from 𝑟-adaptivity with arbitrary quadrature schemes in simulations. The proposed approach is demonstrated to be robust using a variety of numerical experiments.

Mathematics and Computing↗

An Adaptive Mesh Algorithm: Mapping the Mesh Variables

Both thermodynamic and kinematic variables must be mapped. The kinematic variables are defined on a separate kinematic mesh; it is the duel mesh to the thermodynamic mesh. The map of the kinematic variables is done by calculating the contributions of kinematic variables on the old thermodynamic mesh, mapping the kinematic variable contributions onto the new thermodynamic mesh and then synthesizing the mapped kinematic variables on the new kinematic mesh. In this document the map of the thermodynamic variables will be described.

97 MATHEMATICS AND COMPUTING↗

Model Data for the Mesh Convergence Study Demonstrating Benefits of Mixed-polyhedral Mesh in Integrated Hydrology Simulations

This archived model data is related to a study introducing a unique method that employs a stream-aligned mixed-polyhedral mesh to effectively and accurately represent river valleys, stream corridors, and narrow engineered channels in integrated hydrology simulations. The study finds that utilizing stream-aligned mixed-polyhedral meshes in integrated hydrology simulations achieves accuracy on par with a finely refined TIN-based mesh while markedly diminishing computational costs. This archive contains scripts and data files needed to generate the ATS model input, including mesh and ATS input files, for all mesh scenarios using the Watershed Workflow package. Additionally, this archive also provides key outputs from the model simulations that are used in the analysis and post-processing scripts to reproduce figures in the manuscript. The Watershed Workflow package is implemented in Python3. The Jupyter notebooks can be executed through multiple open-source tools, for example, Anaconda Jupyter Lab, VS Studio Code, etc. Other data files include CSV and HDF5 files, which can be read through Python scripts. The input files for the ATS model, open-source integrated hydrology, and transport model are in XML format and can be edited in any commonly used text editors.

54 ENVIRONMENTAL SCIENCES↗

Fast Mesh-to-Mesh Remaps Using Hash Algorithms

Here, we explore the potential uses of hash-based algorithms in the remap operation, mapping one computational mesh onto another. We implement and test optimizations designed to reduce memory operations and compare these optimizations in order to evaluate the performance impact across different meshes. In particular, we created a new remap method that creates a structured hierarchy of hashes. Tests were run on 2D meshes on up to 14 levels of mesh refinement and hundreds of millions of cells to measure the algorithms' relative speeds under differing circumstances. We show that our methods perform two orders of magnitude better than the standard kD-tree algorithm and that on different meshes different hash methods can be optimal. We explore these algorithms on serial CPUs, GPUs using OpenCL, and multi-core CPUs using OpenMP.

97 MATHEMATICS AND COMPUTING↗

Dynamic Mesh Adaptation for Front Evolution Using Discontinuous Galerkin Based Weighted Condition Number Mesh Relaxation

A new mesh smoothing method designed to cluster mesh cells near a dynamically evolving interface is presented. The method is based on weighted condition number mesh relaxation with the weight function being computed from a level set representation of the interface. The weight function is expressed as a Taylor series based discontinuous Galerkin projection, which makes the computation of the derivatives of the weight function needed during the condition number optimization process a trivial matter. For cases when a level set is not available, a fast method for generating a low-order level set from discrete cell-centered elds, such as a volume fraction or index function, is provided. Results show that the low-order level set works equally well for the weight function as the actual level set. Meshes generated for a number of interface geometries are presented, including cases with multiple level sets. Dynamic cases for moving interfaces are presented to demonstrate the method's potential usefulness to arbitrary Lagrangian Eulerian (ALE) methods.

97 MATHEMATICS AND COMPUTING↗

A priori mesh quality estimation via direct relation between truncation error and mesh distortion

The purpose of the present work is the derivation and evaluation of a priori mesh quality indicators for structured, unstructured, as well as hybrid grids. Emphasis is placed on deriving direct relations between the indicators and mesh distortion. The work is based on use of the finite volume discretization for evaluation of first order spatial derivatives. The analytic form of the truncation error is derived and applied to elementary types of mesh distortion including typical hybrid grid interfaces. The corresponding analytic expressions provide direct relations between computational accuracy and the degree of stretching, skewness, shearing and non-alignment of the mesh.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving kinetic equations with adaptive mesh in phase space for rarefied gas dynamics and plasma physics (Invited)

The paper describes an Adaptive Mesh in Phase Space (AMPS) technique for solving kinetic equations with deterministic mesh-based methods. The AMPS technique allows automatic generation of adaptive Cartesian mesh in both physical and velocity spaces using a Tree-of-Trees data structure. We illustrate advantages of AMPS for simulations of rarefied gas dynamics and electron kinetics on low temperature plasmas. In particular, we consider formation of the velocity distribution functions in hypersonic flows, particle kinetics near oscillating boundaries, and electron kinetics in a radio-frequency sheath. AMPS provide substantial savings in computational cost and increased efficiency of the mesh-based kinetic solvers.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

WHITE DWARF MERGERS ON ADAPTIVE MESHES. I. METHODOLOGY AND CODE VERIFICATION

The Type Ia supernova (SN Ia) progenitor problem is one of the most perplexing and exciting problems in astrophysics, requiring detailed numerical modeling to complement observations of these explosions. One possible progenitor that has merited recent theoretical attention is the white dwarf (WD) merger scenario, which has the potential to naturally explain many of the observed characteristics of SNe Ia. To date there have been relatively few self-consistent simulations of merging WD systems using mesh-based hydrodynamics. This is the first paper in a series describing simulations of these systems using a hydrodynamics code with adaptive mesh refinement. In this paper we describe our numerical methodology and discuss our implementation in the compressible hydrodynamics code CASTRO, which solves the Euler equations, and the Poisson equation for self-gravity, and couples the gravitational and rotation forces to the hydrodynamics. Standard techniques for coupling gravitation and rotation forces to the hydrodynamics do not adequately conserve the total energy of the system for our problem, but recent advances in the literature allow progress and we discuss our implementation here. We present a set of test problems demonstrating the extent to which our software sufficiently models a system where large amounts of mass are advected on the computational domain over long timescales. Future papers in this series will describe our treatment of the initial conditions of these systems and will examine the early phases of the merger to determine its viability for triggering a thermonuclear detonation.

79 ASTRONOMY AND ASTROPHYSICS↗

Improving Unstructured Mesh Partitions for Multiple Criteria Using Mesh Adjacencies

The scalability of unstructured mesh based applications depends on partitioning methods that quickly balance the computational work while reducing communication costs. Zhou et al. [SIAM J. Sci. Comput., 32 (2010), pp. 3201{3227; J. Supercomput., 59 (2012), pp. 1218{1228] demonstrated the combination of (hyper)graph methods with vertex and element partition improvement for PHASTA CFD scaling to hundreds of thousands of processes. Our work generalizes partition improvement to support balancing combinations of all the mesh entity dimensions (vertices, edges, faces, regions) in partitions with imbalances exceeding 70%. Improvement results are then presented for multiple entity dimensions on up to one million processes on meshes with over 12 billion tetrahedral elements.

97 MATHEMATICS AND COMPUTING↗

Parallel deterministic transport sweeps of structured and unstructured meshes with overloaded mesh decompositions

Here, the efficiency of discrete ordinates transport sweeps depends on the scheduling algorithm, the domain decomposition, the problem to be solved, and the computational platform. Sweep scheduling algorithms may be categorized by their approach to several issues. In this paper we examine the strategy of domain overloading for mesh partitioning as one of the components of such algorithms. In particular, we extend the domain overloading strategy, previously defined and analyzed for structured meshes, to the general case of unstructured meshes. We also present computational results for both the structured and unstructured domain overloading cases. We find that an appropriate amount of domain overloading can greatly improve the efficiency of parallel sweeps for both structured and unstructured partitionings of the test problems examined on up to 10 5 processor cores.

97 MATHEMATICS AND COMPUTING↗

Four-dimensional electrical conductivity monitoring of stage-driven river water intrusion: Accounting for water table effects using a transient mesh boundary and conditional inversion constraints

Our paper describes and demonstrates two methods of providing a priori information to the surface-based time-lapse three-dimensional electrical resistivity tomography (ERT) problem for monitoring stage-driven or tide-driven surface water intrusion into aquifers. First, a mesh boundary is implemented that conforms to the known location of the water table through time, thereby enabling the inversion to place a sharp bulk conductivity contrast at that boundary without penalty. Moreover, a nonlinear inequality constraint is used to allow only positive or negative transient changes in EC to occur within the saturated zone, dependent on the relative contrast in fluid electrical conductivity between surface water and groundwater. A 3-D field experiment demonstrates that time-lapse imaging results using traditional smoothness constraints are unable to delineate river water intrusion. The water table and inequality constraints provide the inversion with the additional information necessary to resolve the spatial extent of river water intrusion through time.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Conservative finite‐volume schemes for the quasi‐geostrophic equation on coastal‐conforming unstructured primal–dual meshes

In this article we propose finite‐volume schemes for solving the inviscid and viscous quasi‐geostrophic equations on coastal‐conforming unstructured primal–dual meshes. Several approaches for enforcing the boundary conditions are also explored along with these schemes. The pure transport parts in these schemes are shown to conserve the potential vorticity along fluid paths in an averaged sense, and conserve the potential enstrophy up to the time truncation errors. Numerical tests based on the centroidal Voronoi–Delaunay meshes are performed to confirm these properties, and to distinguish the dynamical behaviours of these schemes. Finally some potential applications of these schemes in different situations are discussed.

Chen, Qingshan↗

Mesh refinement for uncertainty quantification through model reduction

We present a novel way of deciding when and where to refine a mesh in probability space in order to facilitate uncertainty quantification in the presence of discontinuities in random space. A discontinuity in random space makes the application of generalized polynomial chaos expansion techniques prohibitively expensive. The reason is that for discontinuous problems, the expansion converges very slowly. An alternative to using higher terms in the expansion is to divide the random space in smaller elements where a lower degree polynomial is adequate to describe the randomness. In general, the partition of the random space is a dynamic process since some areas of the random space, particularly around the discontinuity, need more refinement than others as time evolves. In the current work we propose a way to decide when and where to refine the random space mesh based on the use of a reduced model. The idea is that a good reduced model can monitor accurately, within a random space element, the cascade of activity to higher degree terms in the chaos expansion. In turn, this facilitates the efficient allocation of computational sources to the areas of random space where they are more needed. For the Kraichnan–Orszag system, the prototypical system to study discontinuities in random space, we present theoretical results which show why the proposed method is sound and numerical results which corroborate the theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reversible Reactions, Mesh Size, and Segmental Dynamics Control Penetrant Diffusion in Ethylene Vitrimers

The diffusion of two aromatic dyes with nearly identical sizes was measured in ethylene vitrimers with precise linker lengths and borate ester cross-links using fluorescence recovery after photobleaching (FRAP). One dye possessed a reactive hydroxyl group, while the second was inert. The reaction of the hydroxyl group with the network is slow relative to the hopping times of the dye, resulting in a large slowdown by a factor of 50 for a reactive probe molecule. A kinetic model was fit to the fluorescence intensity data to determine rate constants for the reversible reaction of the dye from the network, which confirms the role of slow reaction kinetics. A second network cross-linker was also investigated with a substituted boronic ester showing ∼10,000 times faster exchange kinetics. In this system, the two dyes show the same diffusion coefficient, as the reaction is no longer the rate-limiting step. The role of dense meshes on small and large dyes is also discussed in the context of the existing theories. Finally, these results highlight the potential of dynamic networks to control penetrant transport through synergistic effects of the mesh size, dynamic bond kinetics, and penetrant–network interactions.

confinement↗