Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative”

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 1,027 records · Page 57

Macromolecular Crystallization in Microfluidics for the International Space Station

At NASA's Marshall Space Flight Center, the Iterative Biological Crystallization (IBC) project has begun development on scientific hardware for macromolecular crystallization on the International Space Station (ISS). Currently ISS crystallization research is limited to solution recipes that were prepared on the ground prior to launch. The proposed hardware will conduct solution mixing and dispensing on board the ISS, be fully automated, and have imaging functions via remote commanding from the ground. Utilizing microfluidic technology, IBC will allow for on orbit iterations. The microfluidics LabChip(R) devices that have been developed, along with Caliper Technologies, will greatly benefit researchers by allowing for precise fluid handling of nano/pico liter sized volumes. IBC will maximize the amount of science return by utilizing the microfluidic approach and be a valuable tool to structural biologists investigating medically relevant projects.

Monaco, Lisa A.↗

Flight Hardware Development and Research at MSFC for Optimizing Success on the International Space Station

To optimize biological crystallization success in microgravity in-house personnel at the MSFC are working on the development of innovative flight hardware such as Delta-L and the Iterative Biological Crystallization (IBC) apparatus as well as troubleshooting the performance of existing hardware. Delta-L will provide a diagnostic hardware to examine the relationship between crystal growth characteristics and crystal quality improvement in microgravity. IBC is a new hardware being designed to allow iteration of crystal growth experiments in microgravity using innovative lab on a chip technology. While being built to obtain scientific data of benefit to the scientific community, the design methods involved in the development of these hardware have directly benefited other groups within NASA and keep NASA at the forefront of innovation.

Source record↗

Bi-Level Integrated System Synthesis (BLISS)

BLISS is a method for optimization of engineering systems by decomposition. It separates the system level optimization, having a relatively small number of design variables, from the potentially numerous sub-system optimizations that may each have a large number of local design variables. The subsystem optimizations are autonomous and may be conducted concurrently. Subsystem and system optimizations alternate, linked by sensitivity data, producing a design improvement in each iteration. Starting from a best guess initial design, the method improves that design in iterative cycles, each cycle comprised of two steps. In step one, the system level variables are frozen and the improvement is achieved by separate, concurrent, and autonomous optimizations in the local variable subdomains. In step two, further improvement is sought in the space of the system level variables. Optimum sensitivity data link the second step to the first. The method prototype was implemented using MATLAB and iSIGHT programming software and tested on a simplified, conceptual level supersonic business jet design, and a detailed design of an electronic device.

Sobieszczanski-Sobieski, Jaroslaw↗

Use of a genetic algorithm for the analysis of eye movements from the linear vestibulo-ocular reflex

It is common in vestibular and oculomotor testing to use a single-frequency (sine) or combination of frequencies [sum-of-sines (SOS)] stimulus for head or target motion. The resulting eye movements typically contain a smooth tracking component, which follows the stimulus, in which are interspersed rapid eye movements (saccades or fast phases). The parameters of the smooth tracking--the amplitude and phase of each component frequency--are of interest; many methods have been devised that attempt to identify and remove the fast eye movements from the smooth. We describe a new approach to this problem, tailored to both single-frequency and sum-of-sines stimulation of the human linear vestibulo-ocular reflex. An approximate derivative is used to identify fast movements, which are then omitted from further analysis. The remaining points form a series of smooth tracking segments. A genetic algorithm is used to fit these segments together to form a smooth (but disconnected) wave form, by iteratively removing biases due to the missing fast phases. A genetic algorithm is an iterative optimization procedure; it provides a basis for extending this approach to more complex stimulus-response situations. In the SOS case, the genetic algorithm estimates the amplitude and phase values of the component frequencies as well as removing biases.

Non-NASA Center↗

Molluscan engrailed expression, serial organization, and shell evolution

Whether the serial features found in some molluscs are ancestral or derived is considered controversial. Here, in situ hybridization and antibody studies show iterated engrailed-gene expression in transverse rows of ectodermal cells bounding plate field development and spicule formation in the chiton, Lepidochitona cavema, as well as in cells surrounding the valves and in the early development of the shell hinge in the clam, Transennella tantilla. Ectodermal expression of engrailed is associated with skeletogenesis across a range of bilaterian phyla, suggesting a single evolutionary origin of invertebrate skeletons. The shared ancestry of bilaterian-invertebrate skeletons may help explain the sudden appearance of shelly fossils in the Cambrian. Our interpretation departs from the consideration of canonical metameres or segments as units of evolutionary analysis. In this interpretation, the shared ancestry of engrailed-gene function in the terminal/posterior addition of serially repeated elements during development explains the iterative expression of engrailed genes in a range of metazoan body plans.

Non-NASA Center↗

The Design of Variable Mach Number Asymmetric Super-Sonic Nozzles by Two Procedures Employing Inclined and Curved Sonic Lines

Two theoretical procedures are developed for designing asymmetric supersonic nozzles for which the calculated exit flow is nearly uniform over a range of Mach numbers. One procedure is applicable at Mach numbers less than approximately 3. This approach yields, without iteration, a nozzle for which the calculated exit flow is uniform at two Mach numbers and, with proper design, is nearly uniform at Mach numbers between, slightly above, and slightly below these two. The use of an inclined and curved sonic line is an essential feature of this approach, The second procedure requires iteration and is used far designs at Mach numbers exceeding 3. Although it is not a necessary feature, an inclined and curved sonic line is also used in this procedure. In both approaches the flow field dawn stream of the sonic line is determined using the method of characteristics.

Syvertson, Clarence A.↗

Parallel Finite Element Domain Decomposition for Structural/Acoustic Analysis

A domain decomposition (DD) formulation for solving sparse linear systems of equations resulting from finite element analysis is presented. The formulation incorporates mixed direct and iterative equation solving strategics and other novel algorithmic ideas that are optimized to take advantage of sparsity and exploit modern computer architecture, such as memory and parallel computing. The most time consuming part of the formulation is identified and the critical roles of direct sparse and iterative solvers within the framework of the formulation are discussed. Experiments on several computer platforms using several complex test matrices are conducted using software based on the formulation. Small-scale structural examples are used to validate thc steps in the formulation and large-scale (l,000,000+ unknowns) duct acoustic examples are used to evaluate the ORIGIN 2000 processors, and a duster of 6 PCs (running under the Windows environment). Statistics show that the formulation is efficient in both sequential and parallel computing environmental and that the formulation is significantly faster and consumes less memory than that based on one of the best available commercialized parallel sparse solvers.

Nguyen, Duc T.↗

A Tower-based Prototype VHF/UHF Radar for Subsurface Sensing: System Description and Data Inversion Results

Knowledge of subsurface characteristics such as permittivity variations and layering structure could provide a breakthrough in many terrestrial and planetary science disciplines. For Earth science, knowledge of subsurface and subcanopy soil moisture layers can enable the estimation of vertical flow in the soil column linking surface hydrologic processes with that in the subsurface. For planetary science, determining the existence of subsurface water and ice is regarded as one of the most critical information needs for the study of the origins of the solar system. The subsurface in general can be described as several near-parallel layers with rough interfaces. Each homogenous rough layer can be defined by its average thickness, permittivity, and rms interface roughness assuming a known surface spectral distribution. As the number and depth of layers increase, the number of measurements needed to invert for the layer unknowns also increases, and deeper penetration capability would be required. To nondestructively calculate the characteristics of the rough layers, a multifrequency polarimetric radar backscattering approach can be used. One such system is that we have developed for data prototyping of the Microwave Observatory of Subcanopy and Subsurface (MOSS) mission concept. A tower-mounted radar makes backscattering measurements at VHF, UHF, and L-band frequencies. The radar is a pulsed CW system, which uses the same wideband antenna to transmit and receive the signals at all three frequencies. To focus the beam at various incidence angles within the beamwidth of the antenna, the tower is moved vertically and measurements made at each position. The signals are coherently summed to achieve focusing and image formation in the subsurface. This requires an estimate of wave velocity profiles. To solve the inverse scattering problem for subsurface velocity profile simultaneously with radar focusing, we use an iterative technique based on a forward numerical solution of the layered rough surface problem. The layers are each defined in terms of a small number of unknown distributions as given above. An a priori estimate of the solution is first assumed, based on which the forward problem is solved for the backscattered measurements. This is compared with the measured data and using iterative techniques an update to the solution for the unknowns is calculated. The process continues until convergence is achieved. Numerical results will be shown using actual radar data acquired with the MOSS tower radar system in Arizona in Fall 2003, and compared with in-situ measurements.

Moghaddam, Mahta↗

MSC/NASTRAN DMAP Alter Used for Closed-Form Static Analysis With Inertia Relief and Displacement-Dependent Loads

Solving for the displacements of free-free coupled systems acted upon by static loads is a common task in the aerospace industry. Often, these problems are solved by static analysis with inertia relief. This technique allows for a free-free static analysis by balancing the applied loads with the inertia loads generated by the applied loads. For some engineering applications, the displacements of the free-free coupled system induce additional static loads. Hence, the applied loads are equal to the original loads plus the displacement-dependent loads. A launch vehicle being acted upon by an aerodynamic loading can have such applied loads. The final displacements of such systems are commonly determined with iterative solution techniques. Unfortunately, these techniques can be time consuming and labor intensive. Because the coupled system equations for free-free systems with displacement-dependent loads can be written in closed form, it is advantageous to solve for the displacements in this manner. Implementing closed-form equations in static analysis with inertia relief is analogous to implementing transfer functions in dynamic analysis. An MSC/NASTRAN (MacNeal-Schwendler Corporation/NASA Structural Analysis) DMAP (Direct Matrix Abstraction Program) Alter was used to include displacement-dependent loads in static analysis with inertia relief. It efficiently solved a common aerospace problem that typically has been solved with an iterative technique.

Source record↗

A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations

A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high computational cost as measured by elapsed time. One approach to reduce the elapsed time is to make use of coarse-grained parallelization to evaluate the design points. Previous parallel PSO algorithms were mostly implemented in a synchronous manner, where all design points within a design iteration are evaluated before the next iteration is started. This approach leads to poor parallel speedup in cases where a heterogeneous parallel environment is used and/or where the analysis time depends on the design point being analyzed. This paper introduces an asynchronous parallel PSO algorithm that greatly improves the parallel e ciency. The asynchronous algorithm is benchmarked on a cluster assembled of Apple Macintosh G5 desktop computers, using the multi-disciplinary optimization of a typical transport aircraft wing as an example.

Venter, Gerhard↗

Nonlinear Attitude Filtering Methods

This paper provides a survey of modern nonlinear filtering methods for attitude estimation. Early applications relied mostly on the extended Kalman filter for attitude estimation. Since these applications, several new approaches have been developed that have proven to be superior to the extended Kalman filter. Several of these approaches maintain the basic structure of the extended Kalman filter, but employ various modifications in order to provide better convergence or improve other performance characteristics. Examples of such approaches include: filter QUEST, extended QUEST, the super-iterated extended Kalman filter, the interlaced extended Kalman filter, and the second-order Kalman filter. Filters that propagate and update a discrete set of sigma points rather than using linearized equations for the mean and covariance are also reviewed. A two-step approach is discussed with a first-step state that linearizes the measurement model and an iterative second step to recover the desired attitude states. These approaches are all based on the Gaussian assumption that the probability density function is adequately specified by its mean and covariance. Other approaches that do not require this assumption are reviewed, including particle filters and a Bayesian filter based on a non-Gaussian, finite-parameter probability density function on SO(3). Finally, the predictive filter, nonlinear observers and adaptive approaches are shown. The strengths and weaknesses of the various approaches are discussed.

F Landis Markley↗

Research Capabilities for Oil-Free Turbomachinery Expanded by New Rotordynamic Simulator Facility

A new test rig has been developed for simulating high-speed turbomachinery shafting using Oil-Free foil air bearing technology. Foil air journal bearings are self-acting hydrodynamic bearings with a flexible inner sleeve surface using air as the lubricant. These bearings have been used in turbomachinery, primarily air cycle machines, for the past four decades to eliminate the need for oil lubrication. More recently, interest has been growing in applying foil bearings to aircraft gas turbine engines. They offer potential improvements in efficiency and power density, decreased maintenance costs, and other secondary benefits. The goal of applying foil air bearings to aircraft gas turbine engines prompted the fabrication of this test rig. The facility enables bearing designers to test potential bearing designs with shafts that simulate the rotating components of a target engine without the high cost of building actual flight hardware. The data collected from this rig can be used to make changes to the shaft and bearings in subsequent design iterations. The rest of this article describes the new test rig and demonstrates some of its capabilities with an initial simulated shaft system. The test rig has two support structures, each housing a foil air journal bearing. The structures are designed to accept any size foil journal bearing smaller than 63 mm (2.5 in.) in diameter. The bearing support structures are mounted to a 91- by 152-cm (3- by 5-ft) table and can be separated by as much as 122 cm (4 ft) and as little as 20 cm (8 in.) to accommodate a wide range of shaft sizes. In the initial configuration, a 9.5-cm (3.75-in.) impulse air turbine drives the test shaft. The impulse turbine, as well as virtually any number of "dummy" compressor and turbine disks, can be mounted on the shaft inboard or outboard of the bearings. This flexibility allows researchers to simulate various engine shaft configurations. The bearing support structures include a unique bearing mounting fixture that rotates to accommodate a laserbased alignment system. This can measure the misalignment of the bearing centers in each of 2 translational degrees of freedom and 2 rotational degrees of freedom. In the initial configuration, with roughly a 30.5-cm- (12-in.-) long shaft, two simulated aerocomponent disks, and two 50.8-cm (2-in.) foil journal bearings, the rig can operate at 65,000 rpm at room temperature. The test facility can measure shaft displacements in both the vertical and horizontal directions at each bearing location. Horizontal and vertical structural vibrations are monitored using accelerometers mounted on the bearing support structures. This information is used to determine system rotordynamic response, including critical speeds, mode shapes, orbit size and shape, and potentially the onset of instabilities. Bearing torque can be monitored as well to predict the power loss in the foil bearings. All of this information is fed back and forth between NASA and the foil bearing designers in an iterative fashion to converge on a final bearing and shaft design for a given engine application. In addition to its application development capabilities, the test rig offers several unique capabilities for basic bearing research. Using the laser alignment system mentioned earlier, the facility will be used to map foil air journal bearing performance. A known misalignment of increasing severity will be induced to determine the sensitivity of foil bearings to misalignment. Other future plans include oil-free integral starter generator testing and development, and dynamic load testing of foil journal bearings.

Howard, Samuel A.↗

Apex Reference Manual 3.0 Beta

Apex is a toolkit for constructing software that behaves intelligently and responsively in demanding task environments. Reflecting its origin at NASA where Apex continues to be developed, current applications include: a) Providing autonomous mission management and tactical control capabilities for unmanned aerial vehicles including an autonomous surveillance helicopter and a simulation prototype of an unmanned fixed-wing aircraft to be used for wildfire mapping; b) Simulating human air traffic controllers, pilots and astronauts to help predict how people might respond to changes in equipment or procedures; and c) Predicting the precise duration and sequence of routine human behaviors based on a human-computer interaction engineering technique called CPM-GOMS. Among Apex s components are a set of implemented reasoning services, such as those for reactive planning and temporal pattern recognition; a software architecture that embeds and integrates these services and allows additional reasoning elements to be added as extensions; a formal language for specifying agent knowledge; a simulation environment to facilitate prototyping and analysis; and Sherpa, a set of tools for visualizing autonomy logic and runtime behavior. In combination, these are meant to provide a flexible and usable framework for creating, testing, and deploying intelligent agent software. Overall, our goal in developing Apex is to lower economic barriers to developing intelligent software agents. New ideas about how to extend or modify the system are evaluated in terms of their impact in reducing the time, expertise, and inventiveness required to build and maintain applications. For example, potential enhancements to the AI reasoning capabilities in the system are reviewed not only for usefulness and distinctiveness, but also for their impact on the readability and general usability of Apex s behavior representation language (PDL) and on the transparency of resulting behavior. A second central part of our approach is to iteratively refine Apex based on lessons learned from as diverse a set of applications as possible. Many applications have been developed by users outside the core development team including engineers, researchers, and students. Usability is thus a central concern for every aspect of Apex visible to a user, including PDL, Sherpa, the Apex installation process, APIs, and user documentation. Apex users vary in their areas of expertise and in their familiarity with autonomy technology. Focusing on usability, a development philosophy summarized by the project motto "Usable Autonomy," has been important part of enabling diverse users to employ Apex successfully and to provide feedback needed to guide iterative, user-centered refinement.

Freed, Michael A.↗

Accuracy Quantification of the Loci-CHEM Code for Chamber Wall Heat Transfer in a GO2/GH2 Single Element Injector Model Problem

A robust rocket engine combustor design and development process must include tools which can accurately predict the multi-dimensional thermal environments imposed on solid surfaces by the hot combustion products. Currently, empirical methods used in the design process are typically one dimensional and do not adequately account for the heat flux rise rate in the near-injector region of the chamber. Computational Fluid Dynamics holds promise to meet the design tool requirement, but requires accuracy quantification, or validation, before it can be confidently applied in the design process. This effort presents the beginning of such a validation process for the Loci-CHEM CFD code. The model problem examined here is a gaseous oxygen (GO2)/gaseous hydrogen (GH2) shear coaxial single element injector operating at a chamber pressure of 5.42 MPa. The GO2/GH2 propellant combination in this geometry represents one the simplest rocket model problems and is thus foundational to subsequent validation efforts for more complex injectors. Multiple steady state solutions have been produced with Loci-CHEM employing different hybrid grids and two-equation turbulence models. Iterative convergence for each solution is demonstrated via mass conservation, flow variable monitoring at discrete flow field locations as a function of solution iteration and overall residual performance. A baseline hybrid was used and then locally refined to demonstrate grid convergence. Solutions were obtained with three variations of the k-omega turbulence model.

West, Jeff↗

Construction of Protograph LDPC Codes with Linear Minimum Distance

A construction method for protograph-based LDPC codes that simultaneously achieve low iterative decoding threshold and linear minimum distance is proposed. We start with a high-rate protograph LDPC code with variable node degrees of at least 3. Lower rate codes are obtained by splitting check nodes and connecting them by degree-2 nodes. This guarantees the linear minimum distance property for the lower-rate codes. Excluding checks connected to degree-1 nodes, we show that the number of degree-2 nodes should be at most one less than the number of checks for the protograph LDPC code to have linear minimum distance. Iterative decoding thresholds are obtained by using the reciprocal channel approximation. Thresholds are lowered by using either precoding or at least one very high-degree node in the base protograph. A family of high- to low-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.

Low-density parity-check (LDPC)↗

Accuracy Quantification of the Loci-CHEM Code for Chamber Wall Heat Fluxes in a G02/GH2 Single Element Injector Model Problem

A robust rocket engine combustor design and development process must include tools which can accurately predict the multi-dimensional thermal environments imposed on solid surfaces by the hot combustion products. Currently, empirical methods used in the design process are typically one dimensional and do not adequately account for the heat flux rise rate in the near-injector region of the chamber. Computational Fluid Dynamics holds promise to meet the design tool requirement, but requires accuracy quantification, or validation, before it can be confidently applied in the design process. This effort presents the beginning of such a validation process for the Loci- CHEM CPD code. The model problem examined here is a gaseous oxygen (GO2)/gaseous hydrogen (GH2) shear coaxial single element injector operating at a chamber pressure of 5.42 MPa. The GO2/GH2 propellant combination in this geometry represents one the simplest rocket model problems and is thus foundational to subsequent validation efforts for more complex injectors. Multiple steady state solutions have been produced with Loci-CHEM employing different hybrid grids and two-equation turbulence models. Iterative convergence for each solution is demonstrated via mass conservation, flow variable monitoring at discrete flow field locations as a function of solution iteration and overall residual performance. A baseline hybrid grid was used and then locally refined to demonstrate grid convergence. Solutions were also obtained with three variations of the k-omega turbulence model.

West, Jeff↗

Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets

Scattered data interpolation is a problem of interest in numerous areas such as electronic imaging, smooth surface modeling, and computational geometry. Our motivation arises from applications in geology and mining, which often involve large scattered data sets and a demand for high accuracy. The method of choice is ordinary kriging. This is because it is a best unbiased estimator. Unfortunately, this interpolant is computationally very expensive to compute exactly. For n scattered data points, computing the value of a single interpolant involves solving a dense linear system of size roughly n x n. This is infeasible for large n. In practice, kriging is solved approximately by local approaches that are based on considering only a relatively small'number of points that lie close to the query point. There are many problems with this local approach, however. The first is that determining the proper neighborhood size is tricky, and is usually solved by ad hoc methods such as selecting a fixed number of nearest neighbors or all the points lying within a fixed radius. Such fixed neighborhood sizes may not work well for all query points, depending on local density of the point distribution. Local methods also suffer from the problem that the resulting interpolant is not continuous. Meyer showed that while kriging produces smooth continues surfaces, it has zero order continuity along its borders. Thus, at interface boundaries where the neighborhood changes, the interpolant behaves discontinuously. Therefore, it is important to consider and solve the global system for each interpolant. However, solving such large dense systems for each query point is impractical. Recently a more principled approach to approximating kriging has been proposed based on a technique called covariance tapering. The problems arise from the fact that the covariance functions that are used in kriging have global support. Our implementations combine, utilize, and enhance a number of different approaches that have been introduced in literature for solving large linear systems for interpolation of scattered data points. For very large systems, exact methods such as Gaussian elimination are impractical since they require 0(n(exp 3)) time and 0(n(exp 2)) storage. As Billings et al. suggested, we use an iterative approach. In particular, we use the SYMMLQ method, for solving the large but sparse ordinary kriging systems that result from tapering. The main technical issue that need to be overcome in our algorithmic solution is that the points' covariance matrix for kriging should be symmetric positive definite. The goal of tapering is to obtain a sparse approximate representation of the covariance matrix while maintaining its positive definiteness. Furrer et al. used tapering to obtain a sparse linear system of the form Ax = b, where A is the tapered symmetric positive definite covariance matrix. Thus, Cholesky factorization could be used to solve their linear systems. They implemented an efficient sparse Cholesky decomposition method. They also showed if these tapers are used for a limited class of covariance models, the solution of the system converges to the solution of the original system. Matrix A in the ordinary kriging system, while symmetric, is not positive definite. Thus, their approach is not applicable to the ordinary kriging system. Therefore, we use tapering only to obtain a sparse linear system. Then, we use SYMMLQ to solve the ordinary kriging system. We show that solving large kriging systems becomes practical via tapering and iterative methods, and results in lower estimation errors compared to traditional local approaches, and significant memory savings compared to the original global system. We also developed a more efficient variant of the sparse SYMMLQ method for large ordinary kriging systems. This approach adaptively finds the correct local neighborhood for each query point in the interpolation process.

Memarsadeghi, Nargess↗

Simulation of a Periodic Jet in a Crossflow with a RANS Solver Using an Unstructured Grid

A second-order unstructured-grid code, developed and used primarily for steady aerodynamic simulations, is applied to the synthetic jet in a cross flow. The code, FUN3D, is a vertex-centered finite-volume method originally developed by Anderson[1, 2], and is currently supported by members of the Fast Adaptive Aerospace Tools team at NASA Langley. Used primarily for design[3] and analysis[4] of steady aerodynamic configurations, FUN3D incorporates a discrete adjoint capability, and supports parallel computations using MPI. A detailed description of the FUN3D code can be found in the references given above. The code is under continuous development and contains a variety of flux splitting algorithms for the inviscid terms, two methods for computing gradients, several turbulence models, and several solution methodologies; all in varying states of development. Only the most robust and reliable components, based on experiences with steady aerodynamic simulations, were employed in this work. As applied in this work, FUN3D solves the Reynolds averaged Navier-Stokes equations using the one equation turbulence model of Spalart and Allmaras[5]. The spatial discretization is formed on unstructured meshes using a vertex-centered approach. The inviscid terms are evaluated by a flux-difference splitting formulation using least-squares reconstruction and Roe-type approximate Riemann fluxes. Green-Gauss gradient evaluations are used for viscous and turbulence modeling terms. The discrete spatial operator is combined with a backward time operator which is then solved iteratively using point or line Gauss-Seidel and local time stepping in a pseudo time. For steady flows, the physical time step is set to infinity and the pseudo time step is ramped up with the iteration count. A second-order backward in time operator is used for time accurate flows with 20 to 50 steps in the pseudo time applied at each physical time step. For this effort, FUN3D was modified to support spatially varying boundary and initial conditions, and unsteady boundary conditions. Also, a specialized in/out flow boundary condition was implemented to model the action of the diaphragm. This boundary condition is described below in more detail. The grids were generated using the internally developed codes GridEX[6] for meshing the surfaces and inviscid regions of the domain, and for CAD access; and MesherX[7] for meshing the viscous regions. Grid spacing in on the surfaces and in the inviscid regions are indirectly controlled by specifying sources. The viscous layers are generated using an advancing layer technique. MeshersX allows the user to control the spatial variation of the first step off the surface, growth rates, and the termination criterion by providing small problem dependent subroutines.

Atkins, H. L.↗