Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “coarse 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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Volumetric Rendering on Wavelet-Based Adaptive Grid

Numerical modeling of physical phenomena frequently involves processes across a wide range of spatial and temporal scales. In the last two decades, the advancements in wavelet-based numerical methodologies to solve partial differential equations, combined with the unique properties of wavelet analysis to resolve localized structures of the solution on dynamically adaptive computational meshes, make it feasible to perform large-scale numerical simulations of a variety of physical systems on a dynamically adaptive computational mesh that changes both in space and time. Volumetric visualization of the solution is an essential part of scientific computing, yet the existing volumetric visualization techniques do not take full advantage of multi-resolution wavelet analysis and are not fully tailored for visualization of a compressed solution on the wavelet-based adaptive computational mesh. Our objective is to explore the alternatives for the visualization of time-dependent data on space-time varying adaptive mesh using volume rendering while capitalizing on the available sparse data representation. Two alternative formulations are explored. The first one is based on volumetric ray casting of multi-scale datasets in wavelet space. Rather than working with the wavelets at the finest possible resolution, a partial inverse wavelet transform is performed as a preprocessing step to obtain scaling functions on a uniform grid at a user-prescribed resolution. As a result, a solution in physical space is represented by a superposition of scaling functions on a coarse regular grid and wavelets on an adaptive mesh. An efficient and accurate ray casting algorithm is based just on these coarse scaling functions. Additional details are added during the ray tracing by taking an appropriate number of wavelets into account based on support overlap with the interpolation point, wavelet coefficient magnitude, and other characteristics, such as opacity accumulation (front to back ordering) and deviation from frontal viewing direction. The second approach is based on complementing of wavelet-based adaptive mesh to the traditional Adaptive Mesh Refinement (AMR) mesh. Both algorithms are illustrated and compared to the existing volume visualization software for Rayleigh-Benard thermal convection and electron density data sets in terms of rendering time and visual quality for different data compression of both wavelet-based and AMR adaptive meshes.

Vezolainen, Alexei V.↗
NASA NTRS1996

Some Aspects of Multigrid Methods on Non-Structured Meshes

To solve a given fine mesh problem, the design of a multigrid method requires the definition of coarse levels, associated coarse grid operators and inter-grid transfer operators. For non-structured simplified meshes, these definitions can rely on the use of non-nested triangulations. These definitions can also be founded on agglomeration/aggregation techniques in a purely algebraic manner. This paper analyzes these two options, shows the connections of the volume-agglomeration method with algebraic methods and proposes a new definition of prolongation operator suitable for the application of the volume-agglomeration method to elliptic problems.

Guillard, H.↗
NASA NTRS1989

An adaptive embedded mesh procedure for leading-edge vortex flows

A procedure for solving the conical Euler equations on an adaptively refined mesh is presented, along with a method for determining which cells to refine. The solution procedure is a central-difference cell-vertex scheme. The adaptation procedure is made up of a parameter on which the refinement decision is based, and a method for choosing a threshold value of the parameter. The refinement parameter is a measure of mesh-convergence, constructed by comparison of locally coarse- and fine-grid solutions. The threshold for the refinement parameter is based on the curvature of the curve relating the number of cells flagged for refinement to the value of the refinement threshold. Results for three test cases are presented. The test problem is that of a delta wing at angle of attack in a supersonic free-stream. The resulting vortices and shocks are captured efficiently by the adaptive code.

Powell, Kenneth G.↗
NASA NTRS1992

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.↗
NASA NTRS2006

Analytical and Numerical Results for an Adhesively Bonded Joint Subjected to Pure Bending

A one-dimensional, semi-analytical methodology that was previously developed for evaluating adhesively bonded joints composed of anisotropic adherends and adhesives that exhibit inelastic material behavior is further verified in the present paper. A summary of the first-order differential equations and applied joint loading used to determine the adhesive response from the methodology are also presented. The method was previously verified against a variety of single-lap joint configurations from the literature that subjected the joints to cases of axial tension and pure bending. Using the same joint configuration and applied bending load presented in a study by Yang, the finite element analysis software ABAQUS was used to further verify the semi-analytical method. Linear static ABAQUS results are presented for two models, one with a coarse and one with a fine element meshing, that were used to verify convergence of the finite element analyses. Close agreement between the finite element results and the semi-analytical methodology were determined for both the shear and normal stress responses of the adhesive bondline. Thus, the semi-analytical methodology was successfully verified using the ABAQUS finite element software and a single-lap joint configuration subjected to pure bending.

Smeltzer, Stanley S., III↗
NASA NTRS1994

Cluster Computation of Flight Reynolds Number Flows

The performance of a workstation cluster used for the solution of the Reynolds-averaged Navier-Stokes equations is compared with a conventional vector supercomputer architecture. The application simulation of the steady flowfield about a transonic transport was computed using an implicit diagonal scheme in an overset mesh framework. Static load balancing was used, while coarse grain decomposition was achieved by solution of a grid zone per processor. Price/performance ratios are estimated for several scenarios in which such clusters may be utilized.

Atwood, Christopher A.↗
NASA NTRS2002

Triangle Geometry Processing for Surface Modeling and Cartesian Grid Generation

Cartesian mesh generation is accomplished for component based geometries, by intersecting components subject to mesh generation to extract wetted surfaces with a geometry engine using adaptive precision arithmetic in a system which automatically breaks ties with respect to geometric degeneracies. During volume mesh generation, intersected surface triangulations are received to enable mesh generation with cell division of an initially coarse grid. The hexagonal cells are resolved, preserving the ability to directionally divide cells which are locally well aligned.

Aftosmis, Michael J.↗
DOE OSTI2024

A quasi-meshfree method for constructing boundary-aware reproducing bases on geometrically complex domains using manifold geodesics

In many applications, physical domains are geometrically complex making it challenging to perform coarse-scale approximation. A defeaturing process is often used to simplify the domain in preparation for approximation and analysis at the coarse scale. In this paper, a methodology is presented for constructing a coarse-scale reproducing basis on geometrically complex domains given an initial fine-scale mesh of the fully featured domain. The initial fine-scale mesh can be of poor quality and extremely refined. The construction of the basis functions begins with a coarse-scale covering of the domain and generation of weighting functions with local support. Manifold geodesics are used to define distances within the local support for general applicability to non-convex domains. Conventional moving least squares is used to construct the coarse-scale reproducing basis. Applications in quasi-interpolation and linear elasticity are presented.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1994

Agglomeration multigrid for viscous turbulent flows

Agglomeration multigrid, which has been demonstrated as an efficient and automatic technique for the solution of the Euler equations on unstructured meshes, is extended to viscous turbulent flows. For diffusion terms, coarse grid discretizations are not possible, and more accurate grid transfer operators are required as well. A Galerkin coarse grid operator construction and an implicit prolongation operator are proposed. Their suitability is evaluated by examining their effect on the solution of Laplace's equation. The resulting strategy is employed to solve the Reynolds-averaged Navier-Stokes equations for aerodynamic flows. Convergence rates comparable to those obtained by a previously developed non-nested mesh multigrid approach are demonstrated, and suggestions for further improvements are given.

Mavriplis, D. J.↗
DOE OSTI2025

PruningAMR

PruningAMR is an algorithm that reads in data stored as a neural network and outputs an adaptive mesh with values of the neural network stored at its vertices. Examples of input data include implicit neural representations (INRs) and physics-informed neural networks (PINNs). The output mesh is a grid-based adaptive mesh with larger elements for regions in which the neural network has coarse-scale variation and smaller elements for regions with fine scale variation. The goal of the software is to discretize the neural network to a mesh that faithfully captures the details encoded in the data without resorting a fine scale mesh.

Zvonek, JenniferE [Lawrence Livermore National Lab↗
DOE OSTI2025

Adaptive Grid Redistribution for a 1D Model of Turbulence and Clouds

In global atmospheric models, resolving stratocumulus (Sc) in the vertical is computationally expensive. However, Sc appear only under special meteorological conditions. Therefore, there is motivation to refine the vertical grid levels adaptively. In order to facilitate the possibility of parallelization on graphical processing units, our grid adaptation method prescribes the number of vertical levels a priori. Then grid levels are relocated toward altitude ranges in need of refinement. Because the method relocates existing grid levels, rather than adding extra levels, there is a risk of creating regions with overly coarse grid spacing, that is, voids in the grid mesh. To prevent such voids from forming, a simple method is developed to impose a maximum grid spacing. To decide where to place enhanced resolution, the authors develop an empirical mesh refinement criterion. It refines grid spacing near the ground, near strong temperature gradients, and within clouds. Our grid adaptation method is implemented in a single-column model and evaluated on four test cases: decaying stratocumulus, developing shallow cumulus, a quasi-stationary stratocumulus deck, and the diurnal cycle of a dry boundary layer. In the stratocumulus cases, mesh refinement leads to improvements in both the time evolution of fields and their time averages. The other two cases show smaller differences.

Carstensen, Steffen [Univ. of Wisconsin, Milwaukee↗
DOE OSTI2022

Planar 2D wireframe DNA origami

Two-dimensional (2D) DNA origami is widely used for applications ranging from excitonics to single-molecule biophysics. Conventional, single-layer 2D DNA origami exhibits flexibility and curvature in solution; however, that may limit its suitability as a 2D structural template. In contrast, 2D wireframe DNA origami rendered with six-helix bundle edges offers local control over duplex orientations with enhanced in-plane rigidity. Here, we investigate the 3D structure of these assemblies using cryo–electron microscopy (cryo-EM). 3D reconstructions reveal a high degree of planarity and homogeneity in solution for polygonal objects with and without internal mesh, enabling 10-Å resolution for a triangle. Coarse-grained simulations were in agreement with cryo-EM data, offering molecular structural insight into this class of 2D DNA origami. Our results suggest that these assemblies may be valuable for 2D material applications and geometries that require high structural fidelity together with local control over duplex orientations, rather than parallel duplex assembly.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS2002

Multilevel Error Estimation and Adaptive h-Refinement for Cartesian Meshes with Embedded Boundaries

This paper presents the development of a mesh adaptation module for a multilevel Cartesian solver. While the module allows mesh refinement to be driven by a variety of different refinement parameters, a central feature in its design is the incorporation of a multilevel error estimator based upon direct estimates of the local truncation error using tau-extrapolation. This error indicator exploits the fact that in regions of uniform Cartesian mesh, the spatial operator is exactly the same on the fine and coarse grids, and local truncation error estimates can be constructed by evaluating the residual on the coarse grid of the restricted solution from the fine grid. A new strategy for adaptive h-refinement is also developed to prevent errors in smooth regions of the flow from being masked by shocks and other discontinuous features. For certain classes of error histograms, this strategy is optimal for achieving equidistribution of the refinement parameters on hierarchical meshes, and therefore ensures grid converged solutions will be achieved for appropriately chosen refinement parameters. The robustness and accuracy of the adaptation module is demonstrated using both simple model problems and complex three dimensional examples using meshes with from 10(exp 6), to 10(exp 7) cells.

Aftosmis, M. J.↗
DOE OSTI2021

Crystal mechanics-based thermo-elastic constitutive modeling of orthorhombic uranium using generalized spherical harmonics and first-order bounding theories

In earlier works, a mathematical procedure for invertible microstructure-property linkages was developed using computationally efficient spectral methods for polycrystalline cubic and hexagonal metals. This paper formulates such invertible microstructure–property linkages for orthorhombic polycrystalline metals relying on the generalized spherical harmonics (GSH) spectral basis. The procedure is used to compute property closures of orthorhombic polycrystals. The closures represent the complete set of theoretically possible combinations of effective properties for a selected material. The procedure relies on the first-order bounding theories and considers orientation distribution functions (ODFs) as the main microstructural descriptor influencing homogenized properties. Numerous examples of these closures involving second-rank thermal expansion and fourth-rank elastic stiffness tensorial properties over a broad range of temperatures are presented for α-uranium (α-U). In doing so, certain key properties of these closures are exploited to facilitate their computation with drastically reduced computational effort. Along with the recently developed GSH-based interpolation procedure for ODFs from coarsely spaced experimental measurement grids to finely spaced finite element mesh resolution grids presented in Barrett et al., the developed computationally efficient ODF-effective property linkages are used to establish a crystal mechanics-based simulation framework coupled with the finite element method (FEM). The ODF dependent thermal expansion and elastic stiffness tensors are efficiently calculated at every integration point and used by the FEM to predict the overall distortion of a hemispherical part made of α-U during heating. In conclusion, it is shown that the developed framework can be used to simulate microstructurally heterogeneous components under thermo-mechanical loadings in a computationally efficient manner.

36 MATERIALS SCIENCE↗
NASA NTRS1993

Towards a generalized computational fluid dynamics technique for all Mach numbers

Currently there exists no single unified approach for efficiently and accurately solving computational fluid dynamics (CFD) problems across the Mach number regime, from truly low speed incompressible flows to hypersonic speeds. There are several CFD codes that have evolved into sophisticated prediction tools with a wide variety of features including multiblock capabilities, generalized chemistry and thermodynamics models among other features. However, as these codes evolve, the demand placed on the end user also increases simply because of the myriad of features that are incorporated into these codes. In order for a user to be able to solve a wide range of problems, several codes may be needed requiring the user to be familiar with the intricacies of each code and their rather complicated input files. Moreover, the cost of training users and maintaining several codes becomes prohibitive. The objective of the current work is to extend the compressible, characteristic-based, thermochemical nonequilibrium Navier-Stokes code GASP to very low speed flows and simultaneously improve convergence at all speeds. Before this work began, the practical speed range of GASP was Mach numbers on the order of 0.1 and higher. In addition, a number of new techniques have been developed for more accurate physical and numerical modeling. The primary focus has been on the development of optimal preconditioning techniques for the Euler and the Navier-Stokes equations with general finite-rate chemistry models and both equilibrium and nonequilibrium thermodynamics models. We began with the work of Van Leer, Lee, and Roe for inviscid, one-dimensional perfect gases and extended their approach to include three-dimensional reacting flows. The basic steps required to accomplish this task were a transformation to stream-aligned coordinates, the formulation of the preconditioning matrix, incorporation into both explicit and implicit temporal integration schemes, and modification of the numerical flux formulae. In addition, we improved the convergence rate of the implicit time integration schemes in GASP through the use of inner iteration strategies and the use of the GMRES (General Minimized Resisual) which belongs to the class of algorithms referred to as Krylov subspace iteration. Finally, we significantly improved the practical utility of GASP through the addition of mesh sequencing, a technique in which computations begin on a coarse grid and get interpolated onto successively finer grids. The fluid dynamic problems of interest to the propulsion community involve complex flow physics spanning different velocity regimes and possibly involving chemical reactions. This class of problems results in widely disparate time scales causing numerical stiffness. Even in the absence of chemical reactions, eigenvalue stiffness manifests itself at transonic and very low speed flows which can be quantified by the large condition number of the system and evidenced by slow convergence rates. This results in the need for thorough numerical analysis and subsequent implementation of sophisticated numerical techniques for these difficult yet practical problems. As a result of this work, we have been able to extend the range of applicability of compressible codes to very low speed inviscid flows (M = .001) and reacting flows.

Walters, R. W.↗
NASA NTRS2006

Software for Automated Generation of Cartesian Meshes

Cart3D is a collection of computer programs for generating Cartesian meshes [for computational fluid dynamics (CFD) and other applications] in volumes bounded by solid objects. Aspects of Cart3D at earlier stages of development were reported in "Robust and Efficient Generation of Cartesian Meshes for CFD" (ARC-14275), NASA Tech Briefs, Vol. 23, No. 8 (August 1999), page 30. The geometric input to Cart3D comprises surface triangulations like those commonly generated by computer-aided-design programs. Complexly shaped objects can be represented as assemblies of simpler ones. Cart3D deletes all portions of such an assembled object that are not on the exterior surface. Intersections between components are preserved in the resulting triangulation. A tie-breaking routine unambiguously resolves geometric degeneracies. Then taking the intersected surface triangulation as input, the volume mesh is generated through division of cells of an initially coarse hexahedral grid. Cells are subdivided to refine the grid in regions of increased surface curvature and/or increased flow gradients. Cells that become split into multiple unconnected regions by thin pieces of surface are identified.

Aftosmis, Michael J.↗
NASA NTRSDate not supplied

FUN3D Analyses in Support of the 1st AIAA Stability and Control Prediction Workshop

The 1st AIAA Stability and Control Prediction Workshop was created to establish best practices for the prediction of stability & control derivatives using computational fluid dynamics and assess the limitations of these computational methods when those best practices are applied. The inaugural workshop considers the ONERA version of the NASA/Boeing Common Research Model(CRM), which includes the wing, body, horizontal tail, and a vertical tail designed by ONERA. Wind tunnel tests have been conducted for this configuration with longitudinal tests having been previously published, in addition to unpublished data at small sideslip angles that will serve as ‘blind’ data for workshop data comparisons. Participants were provided a ‘family’ of unstructured grids for the full-span ONERA CRM model with the wind-tunnel sting included. This family of mixed-element grids consists of 5 levels of refinement (tiny, coarse, medium, fine, and extra fine) with surface and volume mesh scaling, resulting in a size range of 14.6 to 53.4 million nodes. In addition, a medium refinement mesh has been provided for the ONERA CRM configuration without a sting to evaluate the sting’s impact on static longitudinal stability characteristics. In addition to these workshop-provided grids, the present work also considers an equivalent ‘family’ of computational grids generated using Heldenmesh™, a rapid grid generation software by Helden Aerospace Corporation for creating high-quality, three-dimensional, mixed-element unstructured meshes. Because of the authors’ familiarity with this software, these additional grids were generated as a comparison to the workshop-provided grids and to better understand the implications of using volume-mirrored grids for stability and control predictions. The present work will contribute to the workshop with test case data generated using the NASA FUN3D code, a parallelized, unstructured, node-based, finite-volume discretization, Reynolds-averaged Navier-Stokes flow solver. Numerical simulations will be conducted using the Quadratic Constitutive Relationship (QCR) version of the Spalart-Allmaras (SA) turbulence model with negative turbulence variable provisions. Both steady and2nd-order, time-accurate simulation results are to be generated and compared for select test cases, as time permits, to investigate their impact on FUN3D predictions. The present work will consider the three primary workshop test cases: (1) grid convergence study, (2) Mach number effect on static stability, and (3) wind tunnel sting increments. Additionally, data will be provided for the two optional test cases, which include:(1) static stability derivative calculations and (2)sideslip angle sweeps. In each of the test cases, the vehicle is stationary, and the body is assumed to be rigid, where vehicle deformation has been accounted for in the model configuration geometry. For all test cases, longitudinal and lateral force and moment aerodynamic coefficients will be provided for the total configuration, in addition to a component-level breakdown that includes the port wing, starboard wing, fuselage, and tail.

CFD↗
DOE OSTI2025

Mesh-based super-resolution of fluid flows with multiscale graph neural networks

A graph neural network (GNN) approach is introduced in this work which enables mesh-based three-dimensional super-resolution of fluid flows. In this framework, the GNN is designed to operate not on the full mesh-based field at once, but on localized meshes of elements (or cells) directly. To facilitate mesh-based GNN representations in a manner similar to spectral (or finite) element discretizations, a baseline GNN layer (termed a message passing layer, which updates local node properties) is modified to account for synchronization of coincident graph nodes, rendering compatibility with commonly used element-based mesh connectivities. Furthermore, the architecture is multiscale in nature, and is comprised of a combination of coarse-scale and fine-scale message passing layer sequences (termed processors) separated by a graph unpooling layer. The coarse-scale processor embeds a query element (alongside a set number of neighboring coarse elements) into a single latent graph representation using coarse-scale synchronized message passing over the element neighborhood, and the fine-scale processor leverages additional message passing operations on this latent graph to correct for interpolation errors. Demonstration studies are performed using hexahedral mesh-based data from Taylor–Green Vortex and backward-facing step flow simulations at Reynolds numbers of 1600 and 3200. Through analysis of both global and local errors, the results ultimately show how the GNN is able to produce accurate super-resolved fields compared to targets in both coarse-scale and multiscale model configurations. Reconstruction errors for fixed architectures were found to increase in proportion to the Reynolds number. Geometry extrapolation studies on a separate cavity flow configuration show promising cross-mesh capabilities of the super-resolution strategy.

Backward-facing step↗