SEARCH · Engineering Papers

Results for “unstructured”

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.

SourceResearch connectionFrom yearThrough year

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

At least 865 records · Page 48

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

Validation of the HyperSolve CFD Solver for Entry Descent and Landing Applications

The functional equivalence of the HyperSolve unstructured edge-based, finite-volume computational fluid dynamics code to the Langley Aerothermodynamic Upwind Relaxation Algorithm multiblock structured grid code is documented for applications of interest to the Entry, Descent, and Landing community. A suite of cases using a range of thermochemical gas models on relevant vehicle configurations were analyzed with both codes and the results compared. A tolerance of ±4% difference in surface pressure and surface heat flux from a benchmark LAURA solution was used as the criterion for functional equivalence, and comparisons of flowfield quantities are also included to verify that the thermochemical nonequilibrium capabilities in HyperSolve match those of the LAURA code. The functional equivalence of the HyperSolve unstructured edge-based finite-volume computational fluid dynamics (CFD) code to the Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA) multiblock structured grid code is documented for applications of interest to the Entry, Descent, and Landing (EDL) community. A suite of cases using a range of thermochemical gas models on EDL-relevant vehicle configurations were analyzed with both codes and the results compared. A tolerance of ±4% difference in surface pressure and surface heat flux from a benchmark LAURA solution was used as the criterion for functional equivalence, and comparisons of flow field quantities are also included to verify that the thermochemical nonequilibrium capabilities in HyperSolve match those of the LAURA code. In general, HyperSolve predictions for surface pressure and surface heat flux are in close agreement with those predicted by LAURA.

hypersolve↗

NASA NTRSDate not supplied

High-Fidelity Simulations of Lift+Cruise VTOL Urban Air Mobility Concept Aircraft in Hover

This presentation presents progress of high-fidelity multidisciplinary simulations for the NASA lift+cruise vertical takeoff and landing (VTOL) urban air mobility concept aircraft in hover. The study focuses on the unsteady flow solutions featuring strong wake interactions between rotors and the airframe. The simulations couple a high-fidelity aerodynamic model with a comprehensive rotorcraft aeromechanics tool with rotor rotation-speed trim. The aerodynamic model is based on the Reynolds-averaged Navier-Stokes equations using the one-equation Spalart-Allmaras turbulence model with rotation correction. Unsteady aerodynamic flows are computed on a dynamic, deformable, unstructured, overset grid system. An integrated overset-grid assembler is used to construct the composite grid from 23 component grids and facilitate communications between individual component grids. Rotor performance and airframe forces and moments are computed and compared on two unstructured grids. The study demonstrates capabilities of high-fidelity multidisciplinary analysis tools to capture the strong unsteady flowfield around this multi-rotor aircraft in hover.

CFD↗

NASA NTRSDate not supplied

Grid Refinement Techniques for the 𝜸-Re 𝜽 𝒕 Transition Model in FUN3D

There has been an increased focus on the overall accuracy and grid convergence of Reynolds-averaged Navier-Stokes (RANS)-based transition models from the recent AIAA and NATO-AVT workshops. Even though satisfactory grid convergence could be achieved for simple two-dimensional flow configurations, it required mesh counts that are substantially larger than those used in typical applications. In this paper, we focus our efforts on understanding how the grid resolution and topology influences the accuracy and convergence of results by studying the Schubauer and Skramstad flat-plate configuration and the NLF-0416 airfoil at an angle of attack equal to five degrees using FUN3D, a second-order finite-volume code. By focusing on these cases, we can analyze both natural and separation-induced transition scenarios. Multiple grid refinement strategies are investigated. First, we determine the relative effectiveness of zonal streamwise refinement in the transition region within structured grids as an alternative to the costly option of globally uniform refinement of a baseline grid. We also complement this zonal technique by globally varying the wall-normal resolution keeping the streamwise resolution fixed. The zonal streamwise refinement can accurately model natural transition in a flat-plate boundary layer and separation-induced transition, but struggles to accurately model natural transition in airfoil flows. A series of unstructured prismatic grids that have similar node counts and viscous wall spacings as the structured hexahedral grids are also tested, and they do not achieve grid convergence until an extremely fine resolution. Last, we employ adjoint-based unstructured grid adaptation in FUN3D to natural and separation-induced transition on the NLF-0416 airfoil. The adjoint-based refinement process converges to the same solution as the baseline family of structured grids, but leads to smaller errors on coarser grids.

Grid Adaptation↗

NASA NTRSDate not supplied

Assessment of UMUSCL Scheme for DNS of Turbulent Flows

Direct Numerical Simulations (DNS) are performed using the FUN3D code ( https://fun3d.larc.nasa.gov) for three validation cases: (1) flow through a plane channel, (2) flow through a channel with a constriction, and (3) flow over a flat plate. FUN3D is a node-centered finite-volume code developed at the NASA Langley Research Center that solves the three-dimensional compressible Navier-Stokes equations on unstructured computational grids. The simulations are performed employing the 2nd-order unstructured monotonic upstream scheme for conservation laws (UMUSCL). The results are compared with available experimental and numerical data. The effect of the UMUSCL reconstruction parameter (κ) is assessed, and the results indicate that κ = 0.9 yields satisfactory results in terms of accuracy and robustness compared to available data. Further analyses of the results, along with additional test cases and grids will be presented in the final manuscript.

Direct Numerical Simulation↗

NASA NTRSDate not supplied

A Wall-Distance Method for Turbulence Modeling

The distance from a grid point to the closest wall surface, wall distance, is a funda- mental quantity in turbulence modeling. Efficiency of wall-distance calculations has become more critical as the size of computational grids has significantly increased in recent years. This paper reports on an initial implementation of a new search-based wall-distance method that is suitable for general unstructured computational fluid dynamics (CFD) grids and tailored for requirements specific for turbulence modeling. The method represents a two-step approach to calculate the wall distance. In the first step, the wall distance is approximated for each grid point as the minimum distance from this point to a vertex of a triangular face at the wall. The point-to-vertex distance calculation is relatively inexpensive but may lead to a significant error in the wall-distance ap- proximation, especially for grid points near the wall. In the second step, for grid points located within a predefined distance ( threshold ) from the wall, the wall distance is computed as the minimum distance to wall faces. As a result, the wall distance is exact for all grid points within the threshold. This two-step approach reduces the computational cost yet achieves high and controllable accuracy in the evaluation of the wall distance. Algorithmic enhancements are presented to improve efficiency of wall-distance computations. Comprehensive assessment of the new method is reported for large-scale unstructured CFD grids generated for the Fifth AIAA CFD High-Lift Prediction Workshop. The performance of the new wall-distance method compares favorably with performance of two established methods implemented in high-performance CFD codes.

Wall Distance↗

NASA NTRSDate not supplied

New Capabilities and Improvements to the High-Order Glenn Flux Reconstruction Code

The Glenn Flux Reconstruction (GFR) code is a computational fluid dynamics (CFD) code under development at NASA Glenn Research Center. GFR is based on the high-order flux reconstruction (FR) method and provides a large-eddy simulation (LES) capability that is both accurate and efficient for complex aeropropulsion flows. Three significant new capabilities have been added to the code that improve its performance and functionality. First, a variety of explicit Runge-Kutta methods, including some with adaptive time stepping, were added to GFR with two methods offering a 33% improvement in time-to-solution. Second, GFR can now utilize fully unstructured, mixed-element meshes to more easily facilitate the grid generation process for complex geometries. Finally, a rotating reference frame capability has been added to GFR for solving rotating turbomachinery problems. A selection of results demonstrating these new capabilities are presented in this work. The Taylor-Green vortex problem is used to verify the new unstructured capability by showing similar accuracy and resolution for all element types. LES of the Turbulent Heat Flux Phase III (THX3) experiment with comparison to another high-order LES code and a popular Reynolds-averaged Navier-Stokes (RANS) code demonstrates the accuracy of the code for complex aeropropulsion flows. Finally, LES of a spacecraft cabin ventilation fan shows the ability of GFR to efficiently establish a fan performance map and identify operating points for further analysis at high orders of accuracy.

High-Order Methods↗

NASA NTRSDate not supplied

New Capabilities and Improvements to the High-Order Glenn Flux Reconstruction Code

Direct Numerical Simulations↗

DOE OSTI2020

JSONize: A Scalable Machine Learning Pipeline to Model Medical Notes as Semi-structured Documents

The Department of Veteran's Affairs (VA) archives the largest corpora of clinical notes in their corporate data warehouse (CDW) as unstructured text data. Unstructured text easily supports keyword searches and regular expressions. Often these simple searches do not adequately support the complex searches that need to be performed on notes. For example, a researcher may want all notes with a Duke Treadmill Score less than 5 or people that smoke more than 1 pack per day. Range queries like this and more can be supported by modelling text as semi-structured documents. In this paper, we implement a scalable machine learning pipeline that models plain medical text as useful semi-structured documents. We improve on existing models and achieve a F1-score of 0.912 and scale our methods to the entire VA corpus.

Rush III, Everett↗

DOE OSTI2021

Preparing an Incompressible-Flow Fluid Dynamics Code for Exascale-Class Wind Energy Simulations: Preprint

The US Department of Energy has identified Exascale-Class wind farm simulation tools as critical to wind energy scientific discovery. A primary objective of the Exawind project is to build high-performance, predictive Computational Fluid Dynamics tools that satisfy these modeling needs. GPU accelerators will serve as the computational thoroughbreds of next generation, Exascale-Class, platforms. Here, we report on our efforts for preparing the Exawind unstructured mesh solver, Nalu-Wind, for Exascale-Class machines. For computing at this scale, a simple port of the incompressible-flow algorithms to GPUs is not sufficient. One needs novel algorithms that are application aware, memory efficient, and optimized for latest generation GPU devices to get high-performance. The result of our efforts are unstructured mesh simulations of wind turbines that use 1/6 the compute resources of Summit supercomputer at Oak Ridge National Lab. In particular, we demonstrate a first-of-its-kind, simulation using Algebraic Multigrid solvers on over 4000 GPUs.

algebraic multigrid↗

DOE OSTI2022

Reverse-mode differentiation in arbitrary tensor network format: with application to supervised learning.

This paper describes an efficient reverse-mode differentiation algorithm for contraction operations of tensor networks that may have arbitrary and unconventional network topologies. The approach leverages the tensor contraction tree of Evenbly and Pfeifer (2014), which provides an instruction set for the contraction sequence of a network. We show that this tree can be efficiently leveraged for differentiation of a full tensor network contraction using a recursive scheme that exploits (1) the bilinear property of contraction and (2) the property that trees have single path from root to leaves. While differentiation of tensor-tensor contraction is already possible in most automatic differentiation packages, we show that exploiting these two additional properties in the specific context of contraction sequences can improve efficiency. Following a description of the algorithm and computational complexity analysis, we investigate its utility for gradient-based supervised learning for low-rank function recovery and for fitting real-world unstructured datasets. We demonstrate improved performance over alternating least-squares optimization approaches and the capability to handle heterogeneous and arbitrary tensor network formats. When compared to alternating minimization algorithms, we find that the gradient-based approach requires a smaller oversampling ratio (number of samples compared to number model parameters) for recovery. This increased efficiency extends to fitting unstructured data of varying dimensionality and when employing a variety of tensor network formats. Here, we show improved learning using the hierarchical Tucker method over the tensor-train in high-dimensional settings on a number of benchmark problems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Emulation automation and model checking

A method of automating emulations is provided. The method comprising collecting publicly available network data over a predefined time interval, wherein the collected network data might comprise structured and unstructured data. Any unstructured data is converted into structured data. The original and converted structured data is stored in a database and compared to known network vulnerabilities. An emulated network is created according to the collected network data and the comparison of the structured data with known vulnerabilities. Virtual machines are created to run on the emulated network. Director programs and guest actor programs are run on the virtual machines, wherein the actor programs imitate real user behavior on the emulated network. The director programs deliver task commands to the guest actor programs to imitate real user behavior. The imitated behavior is presented to a user via an interface.

Urias, Vincent↗

DOE OSTI2022

New modelling capabilities in IDT

This work concerns the enhanced modelling capabilities of the discrete ordinates transport solver IDT. The novelties introduced allow for modelling unstructured geometries composed by a collection of X/Y segments and circles, and the use of reciprocity and conservation relations reduce the memory imprint as well as the computational cost of the method. IDT decomposes geometries in modular Cartesian patterns, which are the so-called Heterogeneous Cartesian Cells (HCCs), containing a chunk of the original unstructured geometries. Each HCC can be then discretized by superimposing a XY grid to refine locally the HCC. Unlike the most popular MOC, IDT performs the spatial sweeping by directional collision probabilities instead of trajectories. The sources and interface angular fluxes are expanded up to linear order. The accuracy of ray-tracing, the memory imprints together with the novel mesh refinement capabilities have been verified. A first set of preliminary results on PWR lattice problems will be presented in this paper.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2026

System-Level Integration of Modular Language Models for Real-Time Risk Assessment in Third-Party Risk Management Systems

Large enterprises typically rely on dedicated teams to govern and implement security measures throughout their supply chains, ensuring compliance with enterprise security procedures. There is a significant reliance on Third-Party Risk Management (TPRM) platforms, which often require complete, highly structured information from potential vendors. The review and compliance assurance processes are time- and labor intensive, often requiring several rounds of review between the supply chain security risk management teams, business users, and potential vendors, leading to delays in the supply chain processing and consumer experience. Significant challenges in the risk management paradigm include handling unstructured data in various formats and providing real-time feedback to users to reduce the required review time. This paper presents a novel solution to these challenges. A modular multi-step system architecture is proposed using advances in language processing, specifically for unstructured responses and provides real-time feedback (i.e., 3 seconds) so that users can improve their responses before the TPSRM team review. This novel system architecture will increase information accuracy and significantly reduce time and labor during the review process.

99 - GENERAL AND MISCELLANEOUS↗

DOE OSTI2021

Conservative numerical schemes with optimal dispersive wave relations: Part I. Derivation and analysis

An energy-conserving and an energy-and-enstrophy conserving numerical schemes are derived by approximating the Hamiltonian formulation of the inviscid shallow water flows based on the vorticity-divergence variables. These schemes also conserve the first-order moments such as mass and vorticity, as usual. The conservative properties of the schemes stem from the skew-symmetry and singularities of the Poisson brackets, which are carefully retained in the discrete approximations. Here, the schemes operate on unstructured orthogonal dual meshes, over bounded or unbounded domains, and they are also shown to possess the same optimal dispersive wave relations as those of the Z-grid scheme, which is a consequence of the use of the vorticity and divergence variables.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

Haar-Like Wavelets on Hierarchical Trees

Here, discrete wavelet methods, originally formulated in the setting of regularly sampled signals, can be adapted to data defined on a point cloud if some multiresolution structure is imposed on the cloud. A wide variety of hierarchical clustering algorithms can be used for this purpose, and the multiresolution structure obtained can be encoded by a hierarchical tree of subsets of the cloud. Prior work introduced the use of Haar-like bases defined with respect to such trees for approximation and learning tasks on unstructured data. This paper builds on that work in two directions. First, we present an algorithm for constructing Haar-like bases on general discrete hierarchical trees. Second, with an eye towards data compression, we present thresholding techniques for data defined on a point cloud with error controlled in the $L$ $\infty$ norm and in a Hölder-type norm. In a concluding trio of numerical examples, we apply our methods to compress a point cloud dataset, study the tightness of the $L$ $\infty$ error bound, and use thresholding to identify MNIST classifiers with good generalizability.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Advances in hexagon mesh-based flow direction modeling

Watershed delineation and flow direction representation are the foundations of streamflow routing in spatially distributed hydrologic modeling. A recent study showed that hexagon-based watershed discretization has several advantages compared to the traditional Cartesian (latitude–longitude) discretization, such as uniform connectivity and compatibility with other Earth system model components based on unstructured mesh systems (e.g., oceanic models). Despite these advantages, hexagon-based discretization has not been widely adopted by the current generation of hydrologic models. One major reason is that there is no existing model that can delineate hexagon-based watersheds while maintaining accurate representations of flow direction across various spatial resolutions. In this study, we explored approaches such as spatial resampling and hybrid breaching-filling stream burning techniques to improve watershed delineation and flow direction representation using a newly developed hexagonal mesh watershed delineation model (HexWatershed). We applied these improvements to the Columbia River basin and performed 16 simulations with different configurations. The results show that (1) spatial resampling modulates flow direction around headwaters and provides an opportunity to extract subgrid information; and (2) stream burning corrects the flow directions in mountainous areas with complex terrain features.

58 GEOSCIENCES↗

DOE OSTI2022

An aggregation-based nonlinear multigrid solver for two-phase flow and transport in porous media

A nonlinear multigrid solver for two-phase flow and transport in a mixed fractional-flow velocity-pressure-saturation formulation is proposed. The solver, which is under the framework of the full approximation scheme (FAS), extends our previous work on nonlinear multigrid for heterogeneous diffusion problems. The coarse spaces in the multigrid hierarchy are constructed by first aggregating degrees of freedom, and then solving some local flow problems. The mixed formulation and the choice of coarse spaces allow us to assemble the coarse problems without visiting finer levels during the solving phase, which is crucial for the scalability of multigrid methods. Specifically, a natural generalization of the upwind flux can be evaluated directly on coarse levels using the precomputed coarse flux basis vectors. We find that the resulting solver is applicable to problems discretized on general unstructured grids. The performance of the proposed nonlinear multigrid solver in comparison with the standard single level Newton's method is demonstrated through challenging numerical examples. It is observed that the proposed solver is robust for highly nonlinear problems and clearly outperforms Newton's method in the case of high Courant-Friedrichs-Lewy (CFL) numbers.

58 GEOSCIENCES↗

DOE OSTI2025

General field evaluation in high-order meshes on GPUs

Robust and scalable function evaluation at any arbitrary point in the finite/spectral element mesh is required for querying the partial differential equation solution at points of interest, comparison of solution between different meshes, and Lagrangian particle tracking. This is a challenging problem, particularly for high-order unstructured meshes partitioned in parallel with MPI, as it requires identifying the element that overlaps a given point and computing the corresponding reference space coordinates. Here, we present a robust and efficient technique for general field evaluation in large-scale high-order meshes with quadrilaterals and hexahedra. In the proposed method, a combination of globally partitioned and processor-local maps are used to first determine a list of candidate MPI ranks, and then locally candidate elements that could contain a given point. Next, element-wise bounding boxes further reduce the list of candidate elements. Finally, Newton’s method with trust region is used to determine the overlapping element and corresponding reference space coordinates. Since GPU-based architectures have become popular for accelerating computational analyses using meshes with tensor-product elements, specialized kernels have been developed to utilize the proposed methodology on GPUs. The method is also extended to enable general field evaluation on surface meshes. The paper concludes by demonstrating the use of the proposed method in various applications ranging from mesh-to-mesh transfer during r-adaptivity to Lagrangian particle tracking.

97 MATHEMATICS AND COMPUTING↗