Search NASA⌕ Search

SEARCH · Search NASA

Results for “adaptive refinement”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

An edge-based solution-adaptive method applied to the AIRPLANE code

Computational methods to solve large-scale realistic problems in fluid flow can be made more efficient and cost effective by using them in conjunction with dynamic mesh adaption procedures that perform simultaneous coarsening and refinement to capture flow features of interest. This work couples the tetrahedral mesh adaption scheme, 3D_TAG, with the AIRPLANE code to solve complete aircraft configuration problems in transonic and supersonic flow regimes. Results indicate that the near-field sonic boom pressure signature of a cone-cylinder is improved, the oblique and normal shocks are better resolved on a transonic wing, and the bow shock ahead of an unstarted inlet is better defined.

Biswas, Rupak↗
NASA NTRS1993

H-P adaptive methods for finite element analysis of aerothermal loads in high-speed flows

The commitment to develop the National Aerospace Plane and Maneuvering Reentry Vehicles has generated resurgent interest in the technology required to design structures for hypersonic flight. The principal objective of this research and development effort has been to formulate and implement a new class of computational methodologies for accurately predicting fine scale phenomena associated with this class of problems. The initial focus of this effort was to develop optimal h-refinement and p-enrichment adaptive finite element methods which utilize a-posteriori estimates of the local errors to drive the adaptive methodology. Over the past year this work has specifically focused on two issues which are related to overall performance of a flow solver. These issues include the formulation and implementation (in two dimensions) of an implicit/explicit flow solver compatible with the hp-adaptive methodology, and the design and implementation of computational algorithm for automatically selecting optimal directions in which to enrich the mesh. These concepts and algorithms have been implemented in a two-dimensional finite element code and used to solve three hypersonic flow benchmark problems (Holden Mach 14.1, Edney shock on shock interaction Mach 8.03, and the viscous backstep Mach 4.08).

Chang, H. J.↗
NASA NTRS2015

Adaptive Shape Control for Aerodynamic Design

We present an approach to aerodynamic optimization in which the shape control is adaptively parameterized. Starting from a coarse set of design variables, a sequence of higher-dimensional nested search spaces is automatically generated. Refinement can be either uniform or adaptive, in which case only the most important shape control is added. The relative importance of candidate design variables is determined by comparing objective and constraint gradients, computed at low cost via adjoint solutions. A search procedure for finding an effective ensemble of shape parameters is also given. We first demonstrate this system on a multipoint drag miminization problem in 2D with many constraints, showing that an adaptive parameterization approach consistently achieves smoother, more robust, and faster design improvement than fixed parameterizations. We also establish a 3D shape- matching benchmark, where we demonstrate that our approach automatically discovers the necessary parameters to match a target shape. By largely automating shape parameterization, this work also aims to remove a time-consuming aspect of shape optimization.

Aerodynamic Design↗
NASA NTRS1988

Strategies for adding adaptive learning mechanisms to rule-based diagnostic expert systems

Rule-based diagnostic expert systems can be used to perform many of the diagnostic chores necessary in today's complex space systems. These expert systems typically take a set of symptoms as input and produce diagnostic advice as output. The primary objective of such expert systems is to provide accurate and comprehensive advice which can be used to help return the space system in question to nominal operation. The development and maintenance of diagnostic expert systems is time and labor intensive since the services of both knowledge engineer(s) and domain expert(s) are required. The use of adaptive learning mechanisms to increment evaluate and refine rules promises to reduce both time and labor costs associated with such systems. This paper describes the basic adaptive learning mechanisms of strengthening, weakening, generalization, discrimination, and discovery. Next basic strategies are discussed for adding these learning mechanisms to rule-based diagnostic expert systems. These strategies support the incremental evaluation and refinement of rules in the knowledge base by comparing the set of advice given by the expert system (A) with the correct diagnosis (C). Techniques are described for selecting those rules in the in the knowledge base which should participate in adaptive learning. The strategies presented may be used with a wide variety of learning algorithms. Further, these strategies are applicable to a large number of rule-based diagnostic expert systems. They may be used to provide either immediate or deferred updating of the knowledge base.

Stclair, D. C.↗
NASA NTRS1993

A comparison of locally adaptive multigrid methods: LDC, FAC and FIC

This study is devoted to a comparative analysis of three 'Adaptive ZOOM' (ZOom Overlapping Multi-level) methods based on similar concepts of hierarchical multigrid local refinement: LDC (Local Defect Correction), FAC (Fast Adaptive Composite), and FIC (Flux Interface Correction)--which we proposed recently. These methods are tested on two examples of a bidimensional elliptic problem. We compare, for V-cycle procedures, the asymptotic evolution of the global error evaluated by discrete norms, the corresponding local errors, and the convergence rates of these algorithms.

Khadra, Khodor↗
NASA NTRS1989

Geometric transformations for video compression and human teleoperator display

A method for bandwidth-efficient processing of video imagery to be viewed by the teleoperator of a remotely-operated vehicle on which the camera is mounted is described. The method comprises image coding, transmission, and reconstruction. It is assumed that the transmission bandpass is the limiting factor rather than encoding/decoding schemata; that image coding and reconstruction will be done within the general abilities of the NASA/TI Programmable Remapper; and that the ratio of retained local detail to the operator's visual resolution is held constant throughout the large-field image that is seen. Novel features include that the compression and reconstruction address certain characteristics of the human visual system, that two-way communication controls a moving 'fovea' in the transformation, and that resolution varies over the image. Conventional motivations accommodated include the Cartesian raster-scan nature of available imagers and display devices and a need for low bandwidth in the image transmission. Unique image processing hardware, NASA's Programmable Remapper, allows demonstration of the method. Once refined, the technology could be adapted to special purpose imagers and display devices, or otherwise to dedicated image processing hardware.

Juday, Richard D.↗
NASA NTRS1994

Laminar and turbulent flow computations of Type 4 shock-shock interference aerothermal loads using unstructured grids

This report presents computations for the Type 4 shock-shock interference flow under laminar and turbulent conditions using unstructured grids. Mesh adaptation was accomplished by remeshing, refinement, and mesh movement. Two two-equation turbulence models were used to analyze turbulent flows. The mean flow governing equations and the turbulence governing equations are solved in a coupled manner. The solution algorithm and the details pertaining to its implementation on unstructured grids are described. Computations were performed at two different freestream Reynolds numbers at a freestream Mach number of 11. Effects of the variation in the impinging shock location are studied. The comparison of the results in terms of wall heat flux and wall pressure distributions is presented.

Vemaganti, Gururaja R.↗
NASA NTRS1995

Cooperative solutions coupling a geometry engine and adaptive solver codes

Follow-on work has progressed in using Aero Grid and Paneling System (AGPS), a geometry and visualization system, as a dynamic real time geometry monitor, manipulator, and interrogator for other codes. In particular, AGPS has been successfully coupled with adaptive flow solvers which iterate, refining the grid in areas of interest, and continuing on to a solution. With the coupling to the geometry engine, the new grids represent the actual geometry much more accurately since they are derived directly from the geometry and do not use refits to the first-cut grids. Additional work has been done with design runs where the geometric shape is modified to achieve a desired result. Various constraints are used to point the solution in a reasonable direction which also more closely satisfies the desired results. Concepts and techniques are presented, as well as examples of sample case studies. Issues such as distributed operation of the cooperative codes versus running all codes locally and pre-calculation for performance are discussed. Future directions are considered which will build on these techniques in light of changing computer environments.

Dickens, Thomas P.↗
NASA NTRS2002

Magnetohydrodynamic MACH Code Used to Simulate Magnetoplasmadynamic Thrusters

The On-Board Propulsion program at the NASA Glenn Research Center is utilizing a state of-the-art numerical simulation to model the performance of high-power electromagnetic plasma thrusters. Such thrusters are envisioned for use in lunar and Mars cargo transport, piloted interplanetary expeditions, and deep-space robotic exploration of the solar system. The experimental portion of this program is described in reference 1. This article describes the numerical modeling program used to guide the experimental research. The synergistic use of numerical simulations and experimental research has spurred the rapid advancement of high-power thruster technologies for a variety of bold new NASA missions. From its inception as a U.S. Department of Defense code in the mid-1980's, the Multiblock Arbitrary Coordinate Hydromagnetic (MACH) simulation tool has been used by the plasma physics community to model a diverse range of plasma problems--including plasma opening switches, inertial confinement fusion concepts, compact toroid formation and acceleration, z-pinch implosion physics, laser-target interactions, and a variety of plasma thrusters. The MACH2 code used at Glenn is a time-dependent, two-dimensional, axisymmetric, multimaterial code with a multiblock structure. MACH3, a more recent three-dimensional version of the code, is currently undergoing beta tests. The MACH computational mesh moves in an arbitrary Lagrangian-Eulerian (ALE) fashion that allows the simulation of diffusive-dominated and dispersive-dominated problems, and the mesh can be refined via a variety of adaptive schemes to capture regions of varying characteristic scale. The mass continuity and momentum equations model a compressible viscous fluid, and three energy equations are used to simulate nonthermal equilibrium between electrons, ions, and the radiation field. Magnetic fields are modeled by an induction equation that includes resistive diffusion, the Hall effect, and a thermal source for magnetic fields. Various models of plasma resistivity are included, along with ablation models and multiport circuit solvers. The set of equations is closed using either an ideal gas or real equation of state.

Mikellides, Pavlos G.↗
NASA NTRS2009

Coloured Petri Net Refinement Specification and Correctness Proof with Coq

In this work, we address the formalisation of symmetric nets, a subclass of coloured Petri nets, refinement in COQ. We first provide a formalisation of the net models, and of their type refinement in COQ. Then the COQ proof assistant is used to prove the refinement correctness lemma. An example adapted from a protocol example illustrates our work.

Choppy, Christine↗
NASA NTRS1997

Tetrahedral and Hexahedral Mesh Adaptation for CFD Problems

This paper presents two unstructured mesh adaptation schemes for problems in computational fluid dynamics. The procedures allow localized grid refinement and coarsening to efficiently capture aerodynamic flow features of interest. The first procedure is for purely tetrahedral grids; unfortunately, repeated anisotropic adaptation may significantly deteriorate the quality of the mesh. Hexahedral elements, on the other hand, can be subdivided anisotropically without mesh quality problems. Furthermore, hexahedral meshes yield more accurate solutions than their tetrahedral counterparts for the same number of edges. Both the tetrahedral and hexahedral mesh adaptation procedures use edge-based data structures that facilitate efficient subdivision by allowing individual edges to be marked for refinement or coarsening. However, for hexahedral adaptation, pyramids, prisms, and tetrahedra are used as buffer elements between refined and unrefined regions to eliminate hanging vertices. Computational results indicate that the hexahedral adaptation procedure is a viable alternative to adaptive tetrahedral schemes.

Biswas, Rupak↗
NASA NTRS2018

Numerical Simulations of a Quiet SuperSonic Technology (QueSST) Aircraft Preliminary Design

Reynolds Averaged Navier-Stokes (RANS) simulations were performed on a Lockheed Martin Quiet SuperSonic Technology (QueSST) aircraft preliminary design to assess inlet performance. The FUN3D flow solver and its adjoint-based grid refinement capability were used for the simulations in hopes of determining internal "best practices" for predicting inlet performance on top-aft-mounted inlets. Several parameters were explored including tetrahedral vs. pentahedral cells in/around the boundary-layer regions, an engine axis-aligned linear pressure sensor vs. a pressure box objective as the grid adaptation metric, and the number of grid adaptation cycles performed. Additional simulations were performed on manually refined grids for comparison with the adjoint-based adapted grids. Results showed poor agreement in predicted inlet performance on the refined grids compared to experimental data. This was true regardless of whether the refinement was adjoint-based or manual, the cell type in/near the boundary-layer regions, or the grid adaptation metric used. In addition, the 40-probe total pressure recovery was shown to decrease asymptotically as the number of adaptation cycles is increased. Solutions on the unadapted grids generally had better agreement with experimental data than their refined grid counterparts.

Inlet Performance↗
NASA NTRS1999

An Adaptive Unstructured Grid Method by Grid Subdivision, Local Remeshing, and Grid Movement

An unstructured grid adaptation technique has been developed and successfully applied to several three dimensional inviscid flow test cases. The approach is based on a combination of grid subdivision, local remeshing, and grid movement. For solution adaptive grids, the surface triangulation is locally refined by grid subdivision, and the tetrahedral grid in the field is partially remeshed at locations of dominant flow features. A grid redistribution strategy is employed for geometric adaptation of volume grids to moving or deforming surfaces. The method is automatic and fast and is designed for modular coupling with different solvers. Several steady state test cases with different inviscid flow features were tested for grid/solution adaptation. In all cases, the dominant flow features, such as shocks and vortices, were accurately and efficiently predicted with the present approach. A new and robust method of moving tetrahedral "viscous" grids is also presented and demonstrated on a three-dimensional example.

Pirzadeh, Shahyar Z.↗
NASA NTRS1999

Parallel Tetrahedral Mesh Adaptation with Dynamic Load Balancing

The ability to dynamically adapt an unstructured grid is a powerful tool for efficiently solving computational problems with evolving physical features. In this paper, we report on our experience parallelizing an edge-based adaptation scheme, called 3D_TAG. using message passing. Results show excellent speedup when a realistic helicopter rotor mesh is randomly refined. However. performance deteriorates when the mesh is refined using a solution-based error indicator since mesh adaptation for practical problems occurs in a localized region., creating a severe load imbalance. To address this problem, we have developed PLUM, a global dynamic load balancing framework for adaptive numerical computations. Even though PLUM primarily balances processor workloads for the solution phase, it reduces the load imbalance problem within mesh adaptation by repartitioning the mesh after targeting edges for refinement but before the actual subdivision. This dramatically improves the performance of parallel 3D_TAG since refinement occurs in a more load balanced fashion. We also present optimal and heuristic algorithms that, when applied to the default mapping of a parallel repartitioner, significantly reduce the data redistribution overhead. Finally, portability is examined by comparing performance on three state-of-the-art parallel machines.

Oliker, Leonid↗
NASA NTRS1978

Structured programming: Principles, notation, procedure

Structured programs are best represented using a notation which gives a clear representation of the block encapsulation. In this report, a set of symbols which can be used until binding directives are republished is suggested. Structured programming also allows a new method of procedure for design and testing. Programs can be designed top down, that is, they can start at the highest program plane and can penetrate to the lowest plane by step-wise refinements. The testing methodology also is adapted to this procedure. First, the highest program plane is tested, and the programs which are not yet finished in the next lower plane are represented by so-called dummies. They are gradually replaced by the real programs.

JOST↗
NASA NTRS2018

Unstructured Grid Adaptation and Solver Technology for Turbulent Flows

Unstructured grid adaptation is a tool to control Computational Fluid Dynamics (CFD) discretization error. However, adaptive grid techniques have made limited impact on production analysis workflows where the control of discretization error is critical to obtaining reliable simulation results. Issues that prevent the use of adaptive grid methods are identified by applying unstructured grid adaptation methods to a series of benchmark cases. Once identified, these challenges to existing adaptive workflows can be addressed. Unstructured grid adaptation is evaluated for test cases described on the Turbulence Modeling Resource (TMR) web site, which documents uniform grid refinement of multiple schemes. The cases are turbulent flow over a Hemisphere Cylinder and an ONERA M6Wing. Adaptive grid force and moment trajectories are shown for three integrated grid adaptation processes with Mach interpolation control and output error based metrics. The integrated grid adaptation process with a finite element (FE) discretization produced results consistent with uniform grid refinement of fixed grids. The integrated grid adaptation processes with finite volume schemes were slower to converge to the reference solution than the FE method. Metric conformity is documented on grid/metric snapshots for five grid adaptation mechanics implementations. These tools produce anisotropic boundary conforming grids requested by the adaptation process.

Park, Michael A.↗
NASA NTRS1996

Parallel Implementation of an Adaptive Scheme for 3D Unstructured Grids on the SP2

Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we consider an edge-based adaption scheme that has shown good single-processor performance on the C90. We report on our experience parallelizing this code for the SP2. Results show a 47.OX speedup on 64 processors when 10% of the mesh is randomly refined. Performance deteriorates to 7.7X when the same number of edges are refined in a highly-localized region. This is because almost all mesh adaption is confined to a single processor. However, this problem can be remedied by repartitioning the mesh immediately after targeting edges for refinement but before the actual adaption takes place. With this change, the speedup improves dramatically to 43.6X.

Oliker, Leonid↗