Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adaptive meshing”

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 1,279 records · Page 71

Cartesian based grid generation/adaptive mesh refinement

Grid adaptation has recently received attention in the computational fluid dynamics (CFD) community as a means to capture the salient features of a flowfield by either moving grid points of a structured or by adding cells in an unstructured manner. An approach based on a background cartesian mesh is investigated from which the geometry is 'cut' out of the mesh. Once the mesh is obtained, a solution on this coarse grid is found, that indicates which cells need to be refined. This process of refining/solving continues until the flow is grid refined in terms of a user specified global parameter (such as drag coefficient etc.). The advantages of this approach are twofold: the generation of the base grid is independent of the topology of the bodies or surfaces around/through which the flow is to be computed, and the resulting grid (in uncut regions) is highly isotropic, so that the truncation error is low. The flow solver (which, along with the grid generation is still under development) uses a completely unstructured data base, and is a finite volume, upwinding scheme. Current and future work will address generating Navier-Stokes suitable grids by using locally aligned and normal face/cell refining. The attached plot shows a simple grid about two turbine blades.

Coirier, William J.↗

Self-Avoiding Walks over Adaptive Triangular Grids

In this paper, we present a new approach to constructing a "self-avoiding" walk through a triangular mesh. Unlike the popular approach of visiting mesh elements using space-filling curves which is based on a geometric embedding, our approach is combinatorial in the sense that it uses the mesh connectivity only. We present an algorithm for constructing a self-avoiding walk which can be applied to any unstructured triangular mesh. The complexity of the algorithm is O(n x log(n)), where n is the number of triangles in the mesh. We show that for hierarchical adaptive meshes, the algorithm can be easily parallelized by taking advantage of the regularity of the refinement rules. The proposed approach should be very useful in the run-time partitioning and load balancing of adaptive unstructured grids.

Heber, Gerd↗

Self-Avoiding Walks Over Adaptive Triangular Grids

Space-filling curves is a popular approach based on a geometric embedding for linearizing computational meshes. We present a new O(n log n) combinatorial algorithm for constructing a self avoiding walk through a two dimensional mesh containing n triangles. We show that for hierarchical adaptive meshes, the algorithm can be locally adapted and easily parallelized by taking advantage of the regularity of the refinement rules. The proposed approach should be very useful in the runtime partitioning and load balancing of adaptive unstructured grids.

Heber, Gerd↗

LDRD Abbreviated report: High-Order General-Discrete-Ordinates Method Enabling Efficient Deterministic Transport in Hydrodynamic Simulations

Deterministic transport simulations for national-security and energy applications often operate in high-dimensional phase-space, where accuracy and cost both become major challenges. A common numerical artifact in such problems is the “ray-effect,” which appears as unphysical streaks. Beyond misinterpretation, these artifacts can contaminate tightly coupled physics, such as fluid dynamics, radiation-hydrodynamics, and laser-plasma interactions, eroding the predictive capability of entire multiphysics workflows. Our objective was to make high-dimension studies practical on modern hardware while mitigating the ray-effect without relying on prohibitively expensive sampling approaches such as Monte Carlo methods. We developed the Generic Discretization Library (GenDiL), a Graphics Processing Unit (GPU)-first framework that uses high-order Discontinuous Galerkin (DG) methods and matrix-free algorithms to reduce memory usage and improve computational efficiency, critical for phase-space simulations. GenDiL supports phase-space adaptivity in both mesh size and polynomial order (hp-adaptivity) to place resolution only where it is needed. A central capability is Local Dimensional Refinement (LDR), which couples lower-dimension continuum models to higher-dimension kinetic models through stable and conservative interfaces, so that high-fidelity physics is applied only in regions where it is essential. Building on the GenDiL framework, we developed the General SN (GSN) family of algorithms as a true generalization of the polar SN approach (discrete ordinates, often denoted SN). Rather than tying discrete ordinates to a specific polar change of coordinates, GSN formulates transport on an arbitrary change of coordinates chosen to reduce ray-effect. We studied two complementary variants: an analytic variant, where the coordinate map is prescribed in advance by a closed-form function; and a data-driven variant, where a quantity of interest, such as the net flux, guides the coordinate system. GenDiL provides the library infrastructure for efficient GPU execution, but the GSN concept is algorithmic and independent of any one library. Across representative high-dimension tests, including non-symmetric solutions, both variants delivered strong ray-effect mitigation at practical cost, moving four- to six-dimensional analysis toward repeatable, routine studies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A new procedure for dynamic adaption of three-dimensional unstructured grids

A new procedure is presented for the simultaneous coarsening and refinement of three-dimensional unstructured tetrahedral meshes. This algorithm allows for localized grid adaption that is used to capture aerodynamic flow features such as vortices and shock waves in helicopter flowfield simulations. The mesh-adaption algorithm is implemented in the C programming language and uses a data structure consisting of a series of dynamically-allocated linked lists. These lists allow the mesh connectivity to be rapidly reconstructed when individual mesh points are added and/or deleted. The algorithm allows the mesh to change in an anisotropic manner in order to efficiently resolve directional flow features. The procedure has been successfully implemented on a single processor of a Cray Y-MP computer. Two sample cases are presented involving three-dimensional transonic flow. Computed results show good agreement with conventional structured-grid solutions for the Euler equations.

Biswas, Rupak↗

A structured and unstructured remeshing method for high speed flows

An adaptive remeshing method using both triangular and quadrilateral elements suitable for high speed flows is presented. For inviscid flows the method generates completely unstructured meshes. For viscous flows the boundary layer edge is identified adaptively and a structured mesh is generated in the boundary layer, and an unstructured mesh is generated in the inviscid region. Examples of inviscid and viscous mesh adaptations for high speed flows are presented. A comparison is made between first order and higher order finite element algorithms when used in association with the remeshing method.

Vemaganti, Gururaja R.↗

Conformal refinement of unstructured quadrilateral meshes

We present a multilevel adaptive refinement technique for unstructured quadrilateral meshes in which the mesh is kept conformal at all times. This means that the refined mesh, like the original, is formed of only quadrilateral elements that intersect strictly along edges or at vertices, i.e., vertices of one quadrilateral element do not lie in an edge of another quadrilateral. Elements are refined using templates based on 1:3 refinement of edges. We demonstrate that by careful design of the refinement and coarsening strategy, we can maintain high quality elements in the refined mesh. We demonstrate the method on a number of examples with dynamically changing refinement regions.

99 GENERAL AND MISCELLANEOUS↗

Analysis of Hydrocyclone Geometry via Rapid Optimization Based on Computational Fluid Dynamics

Abstract Hydrocyclones exploit density gradients for the centrifugal separation of dispersions in a continuous liquid. Selection of the geometrics for optimal separation is case specific, like the media characteristics. The existing optimization method based on computational fluid dynamics (CFD) provides a powerful analytical tool but requires long computational times. The most common praxis for CFD optimization is via the single‐factor optimization method (SFOM). In this study, a novel approach is presented as an improved rapid optimization method that implements a dynamic‐mesh and user‐defined function optimization method (DUOM). The DUOM adapts the dynamic‐mesh approach from other applications to the optimization analysis of hydrocyclones. The DUOM reduced the computational time by 31.1 %, compared to the SFOM.

Liu, Lin↗

An improved random walk algorithm for the implicit Monte Carlo method

In this work, we introduce a modified Implicit Monte Carlo (IMC) Random Walk (RW) algorithm, which increases simulation efficiency for multigroup radiative transfer problems with strongly frequency-dependent opacities. To date, the RW method has only been implemented in “fully-gray” form; that is, the multigroup IMC opacities are group-collapsed over the full frequency domain of the problem to obtain a gray diffusion problem for RW. This formulation works well for problems with large spatial cells and/or opacities that are weakly dependent on frequency; however, the efficiency of the RW method degrades when the spatial cells are thin or the opacities are a strong function of frequency. To address this inefficiency, we introduce a RW frequency group cutoff in each spatial cell, which divides the frequency domain into optically thick and optically thin components. In the modified algorithm, opacities for the RW diffusion problem are obtained by group-collapsing IMC opacities below the frequency group cutoff. Particles with frequencies above the cutoff are transported via standard IMC, while particles below the cutoff are eligible for RW. This greatly increases the total number of RW steps taken per IMC time-step, which in turn improves the efficiency of the simulation. We refer to this new method as Partially-Gray Random Walk (PGRW). We present numerical results for several multigroup radiative transfer problems, which show that the PGRW method is significantly more efficient than standard RW for several problems of interest. In general, PGRW decreases runtimes by a factor of ∼2–4 compared to standard RW, and a factor of ∼3–6 compared to standard IMC. While PGRW is slower than frequency-dependent Discrete Diffusion Monte Carlo (DDMC), it is also easier to adapt to unstructured meshes and can be used in spatial cells where DDMC is not applicable. This suggests that it may be optimal to employ both DDMC and PGRW in a single simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A parallel adaptive method for simulating shock-induced combustion with detailed chemical kinetics in complex domains

An adaptive finite volume approach is presented to accurately simulate shock-induced combustion phenomena in gases, particular detonation waves. The method uses a Cartesian mesh that is dynamically adapted to embedded geometries and flow features by using regular refinement patches. The discretisation is a reliable linearised Riemann solver for thermally perfect gas mixtures; detailed kinetics are considered in an operator splitting approach. Besides easily reproducible ignition problems, the capabilities of the method and its parallel implementation are quantified and demonstrated for fully resolved triple point structure investigations of Chapman-Jouguet detonations in low-pressure hydrogen-oxygen-argon mixtures in two and three space dimensions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Progress in the Simulation of Steady and Time-Dependent Flows with 3D Parallel Unstructured Cartesian Methods

The proposed paper will present recent extensions in the development of an efficient Euler solver for adaptively-refined Cartesian meshes with embedded boundaries. The paper will focus on extensions of the basic method to include solution adaptation, time-dependent flow simulation, and arbitrary rigid domain motion. The parallel multilevel method makes use of on-the-fly parallel domain decomposition to achieve extremely good scalability on large numbers of processors, and is coupled with an automatic coarse mesh generation algorithm for efficient processing by a multigrid smoother. Numerical results are presented demonstrating parallel speed-ups of up to 435 on 512 processors. Solution-based adaptation may be keyed off truncation error estimates using tau-extrapolation or a variety of feature detection based refinement parameters. The multigrid method is extended to for time-dependent flows through the use of a dual-time approach. The extension to rigid domain motion uses an Arbitrary Lagrangian-Eulerlarian (ALE) formulation, and results will be presented for a variety of two- and three-dimensional example problems with both simple and complex geometry.

Aftosmis, M. J.↗

Target Formulation and Construction in Mesh Quality Improvement

In the Target-matrix Optimization Paradigm (TMOP), it’s long been understood that one must create a set of target matrices before the mesh can be optimized. But there is still no general method to create correct, effective targets in response to a specific mesh quality improvement goal. The TMOP literature describes how certain sets of target matrices can be used to control the shape or size of mesh elements, but those examples address only a fraction of the problems that can occur in mesh quality improvement and were not derived from a general framework for target matrix construction. In this work, a general method of target construction is introduced based on an independent set of geometric parameters which are intrinsic to the Jacobian matrices upon which TMOP is based. The parameters enable a systematic approach to target definition and construction. The approach entails two parts. The first part defines correspondences between available raw data (stuff about the mesh and/or the physical solution) and intermediate data (e.g., a field of error estimates). Once the correspondences are established, the raw data is processed into intermediate field data existing on mesh sample points. The second part is to create a model that represents the values of the geometric target parameters as functions of the intermediate data. The model is then tested numerically to establish model constants and effectiveness. This systematic approach to target construction is illustrated in a set of examples to show how it can be applied to common problems in mesh optimization such as equidistribution of geometric properties, preservation of existing good quality, and adaptation of the mesh to the solution. The result is a systematic method of target construction for TMOP which can be applied to a wide variety of planar and volume mesh quality improvement tasks.

97 MATHEMATICS AND COMPUTING↗

Mesh refinement for anisotropic diffusion in magnetized plasmas

Highly accurate simulation of plasma transport is needed to drive the successful design and operation of magnetically confined fusion reactors. Unfortunately, the extreme anisotropy present in magnetized plasmas results in thin boundary layers that are expensive to resolve. Here, this work investigates how various mesh refinement strategies might reduce that expense to allow for more efficient simulation by comparing standard variable refinement approaches that use a field quantity to an adaptive approach that uses an error estimator. It is first verified that higher order discretization only realizes the proper rate of convergence once the mesh resolves the thin boundary layer, therefore motivating the focusing of refinement on the boundary layer. For three two-dimensional test cases that contain characteristic features of tokamak magnetic fields, an exponential refinement strategy based on the magnetic flux function, which is the standard refinement approach in the field, is compared to an adaptive strategy utilizing the established Zienwiekicz and Zhu error estimator. The adaptive mesh refinement strategy consistently achieves the same accuracy using orders of magnitude less degrees of freedom than either exponential or uniform refinement. This result makes the adaptive refinement strategy more efficient than the exponential refinement strategy while also being more generalizable to problems with complex magnetic geometries. Scaling laws are derived that quantify the improvement in cost of the adaptive refinement strategy over other refinement approaches in 2D and 3D.

97 MATHEMATICS AND COMPUTING↗

An accuracy assessment of Cartesian-mesh approaches for the Euler equations

A critical assessment of the accuracy of Cartesian-mesh approaches for steady, transonic solutions of the Euler equations of gas dynamics is made. An exact solution of the Euler equations (Ringleb's flow) is used not only to infer the order of the truncation error of the Cartesian-mesh approaches, but also to compare the magnitude of the discrete error directly to that obtained with a structured mesh approach. Uniformly and adaptively refined solutions using a Cartesian-mesh approach are obtained and compared to each other and to uniformly refined structured mesh results. The effect of cell merging is investigated as well as the use of two different K-exact reconstruction procedures. The solution methodology of the schemes is explained and tabulated results are presented to compare the solution accuracies.

Coirier, William J.↗

Advances in the development of wire mesh reactor for coal gasification studies - article no. 084102

In an effort to further understand the coal gasification behavior in entrained-flow gasifiers, a high pressure and high temperature wire mesh reactor with new features was recently built. An advanced LABVIEW-based temperature measurement and control system were adapted. Molybdenum wire mesh with aperture smaller than 70 {mu} m and type D thermocouple were used to enable high carbon conversion ({gt}90%) at temperatures {gt}1000 {sup o}C. Gaseous species from wire mesh reactor were quantified using a high sensitivity gas chromatography. The material balance of coal pyrolysis in wire mesh reactor was demonstrated for the first time by improving the volatile's quantification techniques.

01 COAL, LIGNITE, AND PEAT↗

An Object-Oriented Finite Element Framework for Multiphysics Phase Field Simulations

The phase field approach is a powerful and popular method for modeling microstructure evolution. In this work, advanced numerical tools are used to create a phase field framework that facilitates rapid model development. This framework, called MARMOT, is based on Idaho National Laboratory's finite element Multiphysics Object-Oriented Simulation Environment. In MARMOT, the system of phase field partial differential equations (PDEs) are solved simultaneously with PDEs describing additional physics, such as solid mechanics and heat conduction, using the Jacobian-Free Newton Krylov Method. An object-oriented architecture is created by taking advantage of commonalities in phase fields models to facilitate development of new models with very little written code. In addition, MARMOT provides access to mesh and time step adaptivity, reducing the cost for performing simulations with large disparities in both spatial and temporal scales. In this work, phase separation simulations are used to show the numerical performance of MARMOT. Deformation-induced grain growth and void growth simulations are included to demonstrate the muliphysics capability.

36 MATERIALS SCIENCE↗

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science↗