Search NASA⌕ Search

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.

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

At least 289 records · Page 16

Finite element flux-corrected transport (FEM-FCT) for the Euler and Navier-Stokes equations

A high resolution finite element method for the solution of problems involving high speed compressible flows is presented. The method uses the concepts of flux-corrected transport and is presented in a form which is suitable for implementation on completely unstructured triangular or tetrahedral meshes. Transient and steady-state examples are solved to illustrate the performance of the algorithm.

Lohner, Rainald↗

CFD in the 1980's from one point of view

The present interpretive treatment of the development history of CFD in the 1980s gives attention to advancements in such algorithmic techniques as flux Jacobian-based upwind differencing, total variation-diminishing and essentially nonoscillatory schemes, multigrid methods, unstructured grids, and nonrectangular structured grids. At the same time, computational turbulence research gave attention to turbulence modeling on the bases of increasingly powerful supercomputers and meticulously constructed databases. The major future developments in CFD will encompass such capabilities as structured and unstructured three-dimensional grids.

Lomax, Harvard↗

Parallel adaptive mesh refinement techniques for plasticity problems

The accurate modeling of the nonlinear properties of materials can be computationally expensive. Parallel computing offers an attractive way for solving such problems; however, the efficient use of these systems requires the vertical integration of a number of very different software components, we explore the solution of two- and three-dimensional, small-strain plasticity problems. We consider a finite-element formulation of the problem with adaptive refinement of an unstructured mesh to accurately model plastic transition zones. We present a framework for the parallel implementation of such complex algorithms. This framework, using libraries from the SUMAA3d project, allows a user to build a parallel finite-element application without writing any parallel code. To demonstrate the effectiveness of this approach on widely varying parallel architectures, we present experimental results from an IBM SP parallel computer and an ATM-connected network of Sun UltraSparc workstations. The results detail the parallel performance of the computational phases of the application during the process while the material is incrementally loaded.

Barry, W. J.↗

Unstructured Unsteady Flow Solver Applicable to MSU TURBO and Computational Design

This paper presents numerical simulations for a high-speed transonic compressor rotor, NASA Rotor 35, using an unstructured grid flow solver U2NCLE. It solves Reynolds averaged Navier-Stokes equations using an arbitrary Mach number solution algorithm. Experiments were conducted at the NASA Glen Research Center to investigate compressor stability enhancement using steady and discrete tip injections. The mass injection upstream of the tip of a high- speed axial compressor rotor has shown effectiveness in suppressing stall in tip-critical rotors. This work presents numerical simulations of a high-speed compressor rotor with and without tip injections. Methods to model the flow injection are described. Numerical simulations are conducted at 80 and 100 percent of the design speed. Results show that numerical solutions are consistent with the experimental trends.

Newman, James C., III↗

A Pebble Tracking Transport Algorithm for Pebble Bed Reactor Analysis

Pebble bed reactor (PBR) designs pose unique challenges to modeling and simulation. The challenges originate from the multiple levels of heterogeneity partly due to random packing in and flow through the core of fuel pebbles. This paper proposes a novel pebble tracking transport (PTT) algorithm to address some of the challenges facing PBR analysis. Each individual pebble is tracked and modeled on an unstructured mesh of which the nodes are aligned with the pebble centroids. The neutron transport equation is solved on this pebble tracking mesh with pre-assembled elemental matrices. These elemental matrices are independent of the cross sections and the streaming directions, thus can be assembled before the calculation without introducing too much memory overhead especially when combined with spatial domain decomposition. Numerical results show that these matrices can be assembled efficiently. PTT is implemented in Rattlesnake, the INL MOOSE-based multigroup radiation transport application. Both the angular and spatial convergence are investigated and the results indicate that low order angular and spatial resolution is typically sufficient for analysis. A complete work flow for PBR analysis with PTT including, pebble packing, meshing, cross section generation, solution of the transport equation, postprocessing, etc. is demonstrated with a simplified reactor with 41,048 pebbles.

97 MATHEMATICS AND COMPUTING↗

Application of unstructured grid methods to steady and unsteady aerodynamic problems

The purpose is to describe the development of unstructured grid methods which have several advantages when compared to methods which make use of structured grids. Unstructured grids, for example, easily allow the treatment of complex geometries, allow for general mesh movement for realistic motions and structural deformations of complete aircraft configurations which is important for aeroelastic analysis, and enable adaptive mesh refinement to more accurately resolve the physics of the flow. Steady Euler calculations for a supersonic fighter configuration to demonstrate the complex geometry capability; unsteady Euler calculations for the supersonic fighter undergoing harmonic oscillations in a complete-vehicle bending mode to demonstrate the general mesh movement capability; and vortex-dominated conical-flow calculations for highly-swept delta wings to demonstrate the adaptive mesh refinement capability are discussed. The basic solution algorithm is a multi-stage Runge-Kutta time-stepping scheme with a finite-volume spatial discretization based on an unstructured grid of triangles in 2D or tetrahedra in 3D. The moving mesh capability is a general procedure which models each edge of each triangle (2D) or tetrahedra (3D) with a spring. The resulting static equilibrium equations which result from a summation of forces are then used to move the mesh to allow it to continuously conform to the instantaneous position or shape of the aircraft. The adaptive mesh refinement procedure enriches the unstructured mesh locally to more accurately resolve the vortical flow features. These capabilities are described in detail along with representative results which demonstrate several advantages of unstructured grid methods. The applicability of the unstructured grid methodology to steady and unsteady aerodynamic problems and directions for future work are discussed.

Batina, John T.↗

GPU Acceleration of Volume Fraction and Centroid Computation from General Shapes on Unstructured Mesh

One important requirement for coupling multi-physics models is a means to remap fields between meshes in an accurate and conservative manner. Since the remapping algorithm is embarrassingly parallel, this motivates the use of Graphical Processing Units (GPU) for such routine. However, since our remapping code, portage, is fairly complex, we explore the use of GPUs through a simpler problem of generating material’s volume fraction and centroid inside each cell of the mesh. We use the same programming structure that is used in portage, namely, on-node parallelism via NVIDIA’s thrust library. Using a similar programming structure enables us to draw lessons from this study that can be applied to the more complex problem. We have found that while the speed-up is pronounced (10-100 times), significant effort is required to re-factor the code so that thrust can be used with a CUDA backend. Moreover, thrust takes away the fine grain control that vanilla CUDA programming gives us.

97 MATHEMATICS AND COMPUTING↗

Research in Parallel Algorithms and Software for Computational Aerosciences

Phase I is complete for the development of a Computational Fluid Dynamics parallel code with automatic grid generation and adaptation for the Euler analysis of flow over complex geometries. SPLITFLOW, an unstructured Cartesian grid code developed at Lockheed Martin Tactical Aircraft Systems, has been modified for a distributed memory/massively parallel computing environment. The parallel code is operational on an SGI network, Cray J90 and C90 vector machines, SGI Power Challenge, and Cray T3D and IBM SP2 massively parallel machines. Parallel Virtual Machine (PVM) is the message passing protocol for portability to various architectures. A domain decomposition technique was developed which enforces dynamic load balancing to improve solution speed and memory requirements. A host/node algorithm distributes the tasks. The solver parallelizes very well, and scales with the number of processors. Partially parallelized and non-parallelized tasks consume most of the wall clock time in a very fine grain environment. Timing comparisons on a Cray C90 demonstrate that Parallel SPLITFLOW runs 2.4 times faster on 8 processors than its non-parallel counterpart autotasked over 8 processors.

Domel, Neal D.↗

How Autonomous Intelligent Systems Can Facilitate Earth-independent Medical Care: Going Beyond Telepresence

During the last decade, teleoperated robotic systems have extended humans’ sensorimotor competence to digitally fly beyond the physical barrier of distance and scale and thus transmit sensorimotor skills of the human through direct communication. Telepresence capabilities have enabled tele-physical remote access at small scales thanks to telerobotic mediums. Although the concept was initially motivated by space applications, such technologies quickly have expanded into the medical domain and resulted in teleoperated medical robots, including telerobotic surgical systems (such as the da Vinci surgical system). Effective telepresence fundamentally depends on an agile, reliable, and secure communication medium that can transmit real-time information between the operator and a remote device. However, direct telepresence may not be achievable for long-duration exploration spaceflight missions. Thus, autonomous systems and local intelligence represent potential solutions to the aforementioned issues. One example solution employs demonstration systems which enable learning from the pre-captured inputs of a skilled human operator. These will be computationally modeled and later probabilistically replicated toward the completion of remote physical tasks when direct telepresence is not viable - such as under communication blackout conditions. In other words, trained autonomous systems (e.g., robots) can perform remote operations that mimic the physical performance of experts during remote operations/training. Beyond learning the physics of the task, autonomous agents can also be used to conduct algorithmic decision-making that mimics the higher-level cognition of the expert. Thus, using an autonomous system, pre-trained cognitive and manipulation-based skills can be leveraged (acquired during pre-mission events) to produce digital twins of an intelligent operator. Such systems can be used for the real-time conduction of intricate tasks in complex and unstructured environments. Such systems will operationalize “cognitive digital twins” and can expand the reach of human cognition and manipulation through the power of data-driven learning from demonstration algorithms. This system category will be discussed as a fully autonomous operation in this talk. In addition to the above, we will also propose and discuss the possibility of partial-automation using remote intelligence and remote sensing. In contrast to full automation, partial automation can close the loop through a local operator equipped with augmented sensory awareness through wearable systems. Such technologies will allow the local operator to conduct delicate tasks while being guided using sensory augmentation and being monitored to gauge her/his level of cognitive focus and performance. The difference with the previous category is that a remote human will conduct the task. Further, rather than making a digital twin of human cognition, we will augment the control inputs of the local human to match those of the skilled expert operator who is not accessible in real-time. Going beyond classic telepresence and thus approaching intelligent telepresence, our vision is that autonomous agents will eventually enable the safe, consistent and efficient delivery of complex, remote and smart medical care during space exploration across operators in an Earth-independent fashion. We will discuss our collective vision from NASA and MERIIT@NYU lab in this talk.

Telepresence↗

Optimization of the Second Target Station cold source moderators using an automated workflow

The Second Target Station (STS) at the US Department of Energy’s Oak Ridge National Laboratory is designed to become the world’s highest peak-brightness spallation source of cold neutrons. Successful completion of the STS, which is currently in the preliminary design phase, will provide transformative new capabilities to examine novel materials for future technologies. At STS, neutrons will be generated by spallation reactions in a solid tungsten target. They will be moderated and thermalized in two cold (20 K) para-hydrogen moderators. Careful optimization of these moderators is essential to the project’s success. To find optimal moderator designs, an advanced optimization workflow integrates high-fidelity neutronics calculations using the Monte Carlo N-Particle (MCNP) transport code MCNP6.2 with state-of-the-art optimization algorithms in the Dakota optimization toolkit. For each design iteration, a parametrized solid CAD geometry is generated in Creo and automatically converted into an unstructured mesh geometry by Attila 4MC for the neutronics calculation with MCNP. Iterations repeat until optimal designs are found. Herein this paper presents the results of a sensitivity and optimization study for the cylindrical and tube moderators. Both moderators can be optimized for maximum peak brightness, maximum time-integrated brightness, or any combination between these extremes. Maximum peak brightness is achieved by using smaller optimal dimensions of the moderators, whereas maximum time-integrated brightness is achieved by using larger dimensions. A Pareto front details the designs that optimally balance both brightness metrics. The Pareto front can be found in only 40–110 iterations with 4–5 design parameters when using the efficient global and Pareto-set optimization algorithms in Dakota. Additionally, important engineering constraints can be taken into account, such as the coupling between the cylindrical moderator radius and aluminum vessel wall thicknesses required to ensure structural integrity of the vessels. This interaction has a significant impact on the resulting optimal designs. Our new, highly efficient, fully automated optimization workflow will be used to optimize additional STS components in the future and can be adopted for design and optimization studies at other experimental neutron and accelerator facilities.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Computation of propulsion-related flowfields using unstructured adaptive meshes

In this paper, we describe a computational fluid dynamics (CFD) technique based on unstructured triangular/tetrahedral meshes. A finite-volume scheme is used in conjunction with a multi-stage Runge-Kutta algorithm. Convergence enhancements in the form of dual time-stepping and time-derivative preconditioning are used to overcome the limitations of conventional multi-stage schemes. The method is applied to propulsion-related flows and shown to perform satisfactorily.

Weiss, Jonathan M.↗

Comments on the Diffusive Behavior of Two Upwind Schemes

The diffusive characteristics of two upwind schemes, multi-dimensional fluctuation splitting and locally one-dimensional finite volume, are compared for scalar advection-diffusion problems. Algorithms for the two schemes are developed for node-based data representation on median-dual meshes associated with unstructured triangulations in two spatial dimensions. Four model equations are considered: linear advection, non-linear advection, diffusion, and advection-diffusion. Modular coding is employed to isolate the effects of the two approaches for upwind flux evaluation, allowing for head-to-head accuracy and efficiency comparisons. Both the stability of compressive limiters and the amount of artificial diffusion generated by the schemes is found to be grid-orientation dependent, with the fluctuation splitting scheme producing less artificial diffusion than the finite volume scheme. Convergence rates are compared for the combined advection-diffusion problem, with a speedup of 2.5 seen for fluctuation splitting versus finite volume when solved on the same mesh. However, accurate solutions to problems with small diffusion coefficients can be achieved on coarser meshes using fluctuation splitting rather than finite volume, so that when comparing convergence rates to reach a given accuracy, fluctuation splitting shows a speedup of 29 over finite volume.

Wood, William A.↗

Research in Parallel Algorithms and Software for Computational Aerosciences

Phase 1 is complete for the development of a computational fluid dynamics CFD) parallel code with automatic grid generation and adaptation for the Euler analysis of flow over complex geometries. SPLITFLOW, an unstructured Cartesian grid code developed at Lockheed Martin Tactical Aircraft Systems, has been modified for a distributed memory/massively parallel computing environment. The parallel code is operational on an SGI network, Cray J90 and C90 vector machines, SGI Power Challenge, and Cray T3D and IBM SP2 massively parallel machines. Parallel Virtual Machine (PVM) is the message passing protocol for portability to various architectures. A domain decomposition technique was developed which enforces dynamic load balancing to improve solution speed and memory requirements. A host/node algorithm distributes the tasks. The solver parallelizes very well, and scales with the number of processors. Partially parallelized and non-parallelized tasks consume most of the wall clock time in a very fine grain environment. Timing comparisons on a Cray C90 demonstrate that Parallel SPLITFLOW runs 2.4 times faster on 8 processors than its non-parallel counterpart autotasked over 8 processors.

Domel, Neal D.↗

Simulation of Stagnation Region Heating in Hypersonic Flow on Tetrahedral Grids

Hypersonic flow simulations using the node based, unstructured grid code FUN3D are presented. Applications include simple (cylinder) and complex (towed ballute) configurations. Emphasis throughout is on computation of stagnation region heating in hypersonic flow on tetrahedral grids. Hypersonic flow over a cylinder provides a simple test problem for exposing any flaws in a simulation algorithm with regard to its ability to compute accurate heating on such grids. Such flaws predominantly derive from the quality of the captured shock. The importance of pure tetrahedral formulations are discussed. Algorithm adjustments for the baseline Roe / Symmetric, Total-Variation-Diminishing (STVD) formulation to deal with simulation accuracy are presented. Formulations of surface normal gradients to compute heating and diffusion to the surface as needed for a radiative equilibrium wall boundary condition and finite catalytic wall boundary in the node-based unstructured environment are developed. A satisfactory resolution of the heating problem on tetrahedral grids is not realized here; however, a definition of a test problem, and discussion of observed algorithm behaviors to date are presented in order to promote further research on this important problem.

Gnoffo, Peter A.↗

Multi-material hydrodynamics with algebraic sharp interface capturing

A finite volume method for Eulerian multi-material hydrodynamics with sharp interface capturing is presented here. The pressure-temperature non-equilibrium multi-material system with finite-rate pressure relaxation in mixed-cells is considered here. This pressure closure facilitates material-property-dependent pressure relaxation, rather than instantaneous pressure equilibration, which in turn allows the use of unsplit high-order time-integrators. A modified tangent of hyperbola for interface capturing (THINC) method is used to reconstruct multi-material (> 2) interfaces, on three-dimensional unstructured meshes. A simple modification which extends the THINC reconstruction to interfaces between more than two materials is proposed. It is demonstrated that the modified THINC can capture multi-material interfaces within 2–4 tetrahedral cells. Since no geometric reconstructions are required by the THINC method, the presented multi-material method is algorithmically simple, and computationally efficient. Consistent reconstructions of conserved quantities at material interfaces ensure that conservation and closure laws are satisfied at the discrete level. Through a suite of test problems solved on unstructured meshes, it is demonstrated that the presented method is a promising candidate for accurate and efficient multi-material hydrodynamics computations.

97 MATHEMATICS AND COMPUTING↗

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↗

SIRIUS: Enabling Progressive Data Exploration for Extreme-Scale Scientific Data

Scientific simulations on high performance computing (HPC) platforms generate large quantities of data. To bridge the widening gap between compute and I/O, and enable data to be more efficiently stored and analyzed, simulation outputs need to be refactored, reduced, and appropriately mapped to storage tiers. However, a systematic solution to support these steps has been lacking in the current HPC software ecosystem. To that end, this paper develops SIRIUS, a progressive JPEG-like data management scheme for storing and analyzing big scientific data. It co-designs data decimation, compression, and data storage, taking the hardware characteristics of each storage tier into considerations. With reasonably low overhead, our approach refactors simulation data, using either topological or uniform decimation, into a much smaller, reduced-accuracy base dataset, and a series of deltas that is used to augment the accuracy if needed. The base dataset and deltas are compressed and written to multiple storage tiers. Data saved on different tiers can then be selectively retrieved to restore the level of accuracy that satisfies data analytics. Thus, SIRIUS provides a paradigm shift towards elastic data analytics and enables end users to make trade-offs between analysis speed and accuracy on-the-fly. This paper further develops algorithms to preserve statistics for data decimation, a common requirement for reducing data. Here, we assess the impact of SIRIUS on unstructured triangular meshes, a pervasive data model used in scientific simulations. In particular, we evaluate two realistic use cases: the blob detection in fusion and high-pressure area extraction in computational fluid dynamics.

97 MATHEMATICS AND COMPUTING↗

An interactive adaptive remeshing algorithm for the two-dimensional Euler equations

An interactive adaptive remeshing algorithm utilizing a frontal grid generator and a variety of time integration schemes for the two-dimensional Euler equations on unstructured meshes is presented. Several device dependent interactive graphics interfaces have been developed along with a device independent DI-3000 interface which can be employed on any computer that has the supporting software including the Cray-2 supercomputers Voyager and Navier. The time integration methods available include: an explicit four stage Runge-Kutta and a fully implicit LU decomposition. A cell-centered finite volume upwind scheme utilizing Roe's approximate Riemann solver is developed. To obtain higher order accurate results a monotone linear reconstruction procedure proposed by Barth is utilized. Results for flow over a transonic circular arc and flow through a supersonic nozzle are examined.

Slack, David C.↗