SEARCH · Search NASA

Results for “Unstructured algorithm”

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 163 records · Page 9

All sources NASA NTRS DOE OSTI

NASA NTRS1991

Unstructured Euler flow solutions using hexahedral cell refinement

An attempt is made to extend grid refinement into three dimensions by using unstructured hexahedral grids. The flow solver is developed using the TIGER (topologically Independent Grid, Euler Refinement) as the starting point. The program uses an unstructured hexahedral mesh and a modified version of the Jameson four-stage, finite-volume Runge-Kutta algorithm for integration of the Euler equations. The unstructured mesh allows for local refinement appropriate for each freestream condition, thereby concentrating mesh cells in the regions of greatest interest. This increases the computational efficiency because the refinement is not required to extend throughout the entire flow field.

Melton, John E.↗

DOE OSTI2019

Nonconforming Mesh Refinement for High-Order Finite Elements

In this study, we propose a general algorithm for nonconforming adaptive mesh refinement (AMR) of unstructured meshes in high-order finite element codes. Our focus is on $h$-refinement with a fixed polynomial order. The algorithm handles triangular, quadrilateral, hexahedral, and prismatic meshes of arbitrarily high-order curvature, for any order finite element space in the de Rham sequence. We present a flexible data structure for meshes with hanging nodes and a general procedure to construct the conforming interpolation operator, both in serial and in parallel. The algorithm and data structure allow anisotropic refinement of tensor product elements in two and three dimensions and support unlimited refinement ratios of adjacent elements. We report numerical experiments verifying the correctness of the algorithms and perform a parallel scaling study to show that we can adapt meshes containing billions of elements and run efficiently on 393,000 parallel tasks. Finally, we illustrate the integration of dynamic AMR into a high-order Lagrangian hydrodynamics solver.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1996

Optimal and robust control of transition

Optimal and robust control theories are used to determine feedback control rules that effectively stabilize a linearly unstable flow in a plane channel. Wall transpiration (unsteady blowing/suction) with zero net mass flux is used as the control. Control algorithms are considered that depend both on full flowfield information and on estimates of that flowfield based on wall skin-friction measurements only. The development of these control algorithms accounts for modeling errors and measurement noise in a rigorous fashion; these disturbances are considered in both a structured (Gaussian) and unstructured ('worst case') sense. The performance of these algorithms is analyzed in terms of the eigenmodes of the resulting controlled systems, and the sensitivity of individual eigenmodes to both control and observation is quantified.

Bewley, T. R.↗

DOE OSTI2023

Ume: Unstructured Mesh Explorations

Ume is an open-source collection of data structures for unstructured computational meshes and some simple algorithms that operate on them. These algorithms mimic the memory access patterns of a common class of operations found in several of the computational physics simulation codes developed at Los Alamos National Laboratory. The intent is that Ume can be used by hardware vendors to understand the memory traffic created by complex codes in a simplified environment, and to explore new means of optimization for that traffic. Ume is provided as a source-code C++ library and includes several applications that demonstrate the use of that library.

Henning, Paul↗

DOE OSTI2019

EMPHASIS™/Nevada Unstructured FEM Implementaiton Version 2.1.3. Description, verification, and validation

EMPHASIS™/NEVADA is the SIERRA/NEVADA toolkit implementation of portions of the EMPHASIS TM code suite. The purpose of the toolkit implementation is to facilitate coupling to other physics drivers such as radiation transport as well as to better manage code design, implementation, complexity, and important verification and validation processes. This document describes the theory and implementation of the unstructured finite- element method solver, associated algorithms, and selected verification and validation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1989

An adaptive implicit/explicit finite element scheme for compressible viscous high speed flow

An adaptive implicit/explicit finite element procedure for the solution of three-dimensional problems of steady compressible viscous high-speed flows is presented. In the vicinity of solid walls, a grid-exhibiting structure in the normal direction is employed, while away from this region the grid is totally unstructured. The implicit form of the algorithm is used near solid walls, with the grid structure being utilized in an equation solution approach based upon line relaxation. The explicit form of the algorithm is used elsewhere. Grid adaptation is achieved by means of adaptive remeshing. To illustrate the performance of the proposed method, solutions are obtained for the problems of shock-boundary layer interaction and shock-shock interaction on a swept cylindrical leading edge. Comparisons are made with experimental observations.

Hassan, O.↗

NASA NTRS1990

On unstructured grids and solvers

The fundamentals and the state-of-the-art technology for unstructured grids and solvers are highlighted. Algorithms and techniques pertinent to mesh generation are discussed. It is shown that grid generation and grid manipulation schemes rely on fast multidimensional searching. Flow solution techniques for the Euler equations, which can be derived from the integral form of the equations are discussed. Sample calculations are also provided.

Barth, T. J.↗

NASA NTRS1989

The simulation of 2D compressible viscous high speed flow by the finite element method

Am implicit/explicit procedure for the solution of problems of two-dimensional steady compressible viscous high-speed flows is presented. In the vicinity of solid walls, a grid which need only exhibit structure in the normal direction is employed while, away from this region, the grid is totally unstructured. The implicit form of the algorithm is used near solid walls, with the grid structure being utilized in an equation solution approach, based upon line relaxation. The explicit form of the algorithm is used elsewhere. Grid adaptation is achieved by means of adaptive remeshing. To illustrate the performance of the proposed method, problems of shock-boundary layer interaction and flow over a simulated forebody at high Mach number are included.

Hassan, O.↗

NASA NTRS1990

Finite element methods of analysis for 3D inviscid compressible flows

The applicants have developed a finite element based approach for the solution of three-dimensional compressible flows. The procedure enables flow solutions to be obtained on tetrahedral discretizations of computational domains of complex form. A further development was the incorporation of a solution adaptive mesh strategy in which the adaptivity is achieved by complete remeshing of the solution domain. During the previous year, the applicants were working with the Advanced Aerodynamics Concepts Branch at NASA Ames Research Center with an implementation of the basic meshing and solution procedure. The objective of the work to be performed over this twelve month period was the transfer of the adaptive mesh technology and also the undertaking of basic research into alternative flow algorithms for the Euler equations on unstructured meshes.

Peraire, Jaime↗

NASA NTRS2008

Analysis of Effectiveness of Phoenix Entry Reaction Control System

Interaction between the external flowfield and the reaction control system (RCS) thruster plumes of the Phoenix capsule during entry has been investigated. The analysis covered rarefied, transitional, hypersonic and supersonic flight regimes. Performance of pitch, yaw and roll control authority channels was evaluated, with specific emphasis on the yaw channel due to its low nominal yaw control authority. Because Phoenix had already been constructed and its RCS could not be modified before flight, an assessment of RCS efficacy along the trajectory was needed to determine possible issues and to make necessary software changes. Effectiveness of the system at various regimes was evaluated using a hybrid DSMC-CFD technique, based on DSMC Analysis Code (DAC) code and General Aerodynamic Simulation Program (GASP), the LAURA (Langley Aerothermal Upwind Relaxation Algorithm) code, and the FUN3D (Fully Unstructured 3D) code. Results of the analysis at hypersonic and supersonic conditions suggest a significant aero-RCS interference which reduced the efficacy of the thrusters and could likely produce control reversal. Very little aero-RCS interference was predicted in rarefied and transitional regimes. A recommendation was made to the project to widen controller system deadbands to minimize (if not eliminate) the use of RCS thrusters through hypersonic and supersonic flight regimes, where their performance would be uncertain.

Dyakonov, Artem A.↗

DOE OSTI2020

Machine Learning for Automated Extraction of Building Geometry

As data science comes to buildings, the promise of using machine learning and novel sources of data has received much attention. Advances in machine learning and computer vision algorithms, combined with increased access to unstructured data (e.g., images and text), have created an opportunity for automated extraction of building characteristics – cost-effectively, and at scale. Acquisition of features such as footprint are time consuming and costly to acquire with today’s manual methods, but can be streamlined through intelligent software-based solutions applied to satellite images. When combined with aerial RGB and thermal images, full 3D geometries and thermal maps can be constructed to determine additional characteristics such as window to wall ratio, height, number of stories and envelope thermal characteristics. In this paper we present three contributions to accelerate these high potential opportunities: (1) a methodical analysis of how these features can be integrated into today’s simulation and data driven software tools to enhance efficiency measure identification and owner/operator decision making; (2) development and accuracy testing of open source deep neural network methods to extract building footprints from satellite imagery, including the curation and application of openly available GIS datasets for training and continued development by others; and (3) an open framework for drone-based image capture and creation of 3D building geometries. This work represents an important bridge between high-level studies that span diverse application areas and those that detail point solutions yet cannot be easily replicated or extended.

Touzani, Samir↗

NASA NTRS1990

Galerkin finite difference Laplacian operators on isolated unstructured triangular meshes by linear combinations

The Galerkin weighted residual technique using linear triangular weight functions is employed to develop finite difference formulae in Cartesian coordinates for the Laplacian operator on isolated unstructured triangular grids. The weighted residual coefficients associated with the weak formulation of the Laplacian operator along with linear combinations of the residual equations are used to develop the algorithm. The algorithm was tested for a wide variety of unstructured meshes and found to give satisfactory results.

Baumeister, Kenneth J.↗

NASA NTRS1993

Unstructured multigrid through agglomeration

In this work the compressible Euler equations are solved using finite volume techniques on unstructured grids. The spatial discretization employs a central difference approximation augmented by dissipative terms. Temporal discretization is done using a multistage Runge-Kutta scheme. A multigrid technique is used to accelerate convergence to steady state. The coarse grids are derived directly from the given fine grid through agglomeration of the control volumes. This agglomeration is accomplished by using a greedy-type algorithm and is done in such a way that the load, which is proportional to the number of edges, goes down by nearly a factor of 4 when moving from a fine to a coarse grid. The agglomeration algorithm has been implemented and the grids have been tested in a multigrid code. An area-weighted restriction is applied when moving from fine to coarse grids while a trivial injection is used for prolongation. Across a range of geometries and flows, it is shown that the agglomeration multigrid scheme compares very favorably with an unstructured multigrid algorithm that makes use of independent coarse meshes, both in terms of convergence and elapsed times.

Venkatakrishnan, V.↗

DOE OSTI2018

Integrating Natural Language Processing and Machine Learning Algorithms to Categorize Oncologic Response in Radiology Reports

A significant volume of medical data remains unstructured. Natural language processing (NLP) and machine learning (ML) techniques have shown to successfully extract insights from radiology reports. However, the codependent effects of NLP and ML in this context have not been well-studied. Between April 1, 2015 and November 1, 2016, 9418 cross-sectional abdomen/pelvis CT and MR examinations containing our internal structured reporting element for cancer were separated into four categories: Progression, Stable Disease, Improvement, or No Cancer. We combined each of three NLP techniques with five ML algorithms to predict the assigned label using the unstructured report text and compared the performance of each combination. The three NLP algorithms included term frequency-inverse document frequency (TF-IDF), term frequency weighting (TF), and 16-bit feature hashing. The ML algorithms included logistic regression (LR), random decision forest (RDF), one-vs-all support vector machine (SVM), one-vs-all Bayes point machine (BPM), and fully connected neural network (NN). The best-performing NLP model consisted of tokenized unigrams and bigrams with TF-IDF. Increasing N-gram length yielded little to no added benefit for most ML algorithms. With all parameters optimized, SVM had the best performance on the test dataset, with 90.6 average accuracy and F score of 0.813. The interplay between ML and NLP algorithms and their effect on interpretation accuracy is complex. The best accuracy is achieved when both algorithms are optimized concurrently.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

NASA NTRS1993

A multilevel adaptive projection method for unsteady incompressible flow

There are two main requirements for practical simulation of unsteady flow at high Reynolds number: the algorithm must accurately propagate discontinuous flow fields without excessive artificial viscosity, and it must have some adaptive capability to concentrate computational effort where it is most needed. We satisfy the first of these requirements with a second-order Godunov method similar to those used for high-speed flows with shocks, and the second with a grid-based refinement scheme which avoids some of the drawbacks associated with unstructured meshes. These two features of our algorithm place certain constraints on the projection method used to enforce incompressibility. Velocities are cell-based, leading to a Laplacian stencil for the projection which decouples adjacent grid points. We discuss features of the multigrid and multilevel iteration schemes required for solution of the resulting decoupled problem. Variable-density flows require use of a modified projection operator--we have found a multigrid method for this modified projection that successfully handles density jumps of thousands to one. Numerical results are shown for the 2D adaptive and 3D variable-density algorithms.

Howell, Louis H.↗

NASA NTRS1989

Upwind-biased, point-implicit relaxation strategies for hypersonic flowfield simulations on supercomputers

An upwind-biased, point-implicit relaxation algorithm for obtaining the numerical solution to the governing equations for three-dimensional, viscous, hypersonic flows in chemical and thermal nonequilibrium is described. The algorithm is derived using a finite-volume formulation in which the inviscid components of flux across cell walls are described with Roe's averaging and Harten's entropy fix with second-order corrections based on Yee's Symmetric Total Variation Diminishing scheme. The relaxation strategy is well suited for computers employing either vector or parallel architectures, and the relation between computer architecture and algorithm is emphasized. It is also well suited to the numerical solution of the governing equations on unstructured grids. Because of the point-implicit relaxation strategy, the algorithm remains stable at large Courant numbers without the necessity of solving large. block tri-diagonal systems. A single relaxation step depends only on information from nearest neighbors. Predictions for pressure distributions, surface heating, and aerodynamic coefficients compare well with experimental data for Mach 10 flow over a blunt body. Predictions for the hypersonic flow of air in chemical and thermal nonequilibrium (velocity = 8917 m/s, altitude = 78 km.) over the Aeroassist Flight Experiment (AFE) configuration obtained on a multi-domain grid are discussed.

Gnoffo, Peter A.↗

NASA NTRS1998

Tetrahedral Finite-Volume Solutions to the Navier-Stokes Equations on Complex Configurations

A review of the algorithmic features and capabilities of the unstructured-grid flow solver USM3Dns is presented. This code, along with the tetrahedral grid generator, VGRIDns, is being extensively used throughout the U.S. for solving the Euler and Navier-Stokes equations on complex aerodynamic problems. Spatial discretization is accomplished by a tetrahedral cell-centered finite-volume formulation using Roe's upwind flux difference splitting. The fluxes are limited by either a Superbee or MinMod limiter. Solution reconstruction within the tetrahedral cells is accomplished with a simple, but novel, multidimensional analytical formula. Time is advanced by an implicit backward-Euler time-stepping scheme. Flow turbulence effects are modeled by the Spalart-Allmaras one-equation model, which is coupled with a wall function to reduce the number of cells in the near-wall region of the boundary layer. The issues of accuracy and robustness of USM3Dns Navier-Stokes capabilities are addressed for a flat-plate boundary layer, and a full F-16 aircraft with external stores at transonic speed.

Frink, Neal T.↗

NASA NTRS2002

Application of the Loci-Based CFD Code Chem at MSFC: Preliminary Results

Contents include the following: 1. Objectives. Concentrate on determining the qualitative accuracy, performance and robustness of the Chen code. 2. What is the Loci-Chem CFD code? Density-based, finite volume, generalized unstructured grid, Navier-Stokes solver. The algorithm was implemented using the Loci framework, which allows implementation issues such as parallel processing to be handled transparently to the coding of the CFD algorithm. 3. Application to Bifurcating Duct problem. Flow splits from single duct to two ducts. 4. Application to single element injector. 5. Application to PSU RBCC rig. 6. 90 degree elbow benchmark problem. 7. Future work.

West, Jeff S.↗