Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “partitioned 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 181 records · Page 10

Sharply curved turn around duct flow predictions using spectral partitioning of the turbulent kinetic energy and a pressure modified wall law

Computational predictions of turbulent flow in sharply curved 180 degree turn around ducts are presented. The CNS2D computer code is used to solve the equations of motion for two-dimensional incompressible flows transformed to a nonorthogonal body-fitted coordinate system. This procedure incorporates the pressure velocity correction algorithm SIMPLE-C to iteratively solve a discretized form of the transformed equations. A multiple scale turbulence model based on simplified spectral partitioning is employed to obtain closure. Flow field predictions utilizing the multiple scale model are compared to features predicted by the traditional single scale k-epsilon model. Tuning parameter sensitivities of the multiple scale model applied to turn around duct flows are also determined. In addition, a wall function approach based on a wall law suitable for incompressible turbulent boundary layers under strong adverse pressure gradients is tested. Turn around duct flow characteristics utilizing this modified wall law are presented and compared to results based on a standard wall treatment.

Santi, L. Michael↗

Numerical simulation of three dimensional transonic flows

The three-dimensional flow over a projectile has been computed using an implicit, approximately factored, partially flux-split algorithm. A simple composite grid scheme has been developed in which a single grid is partitioned into a series of smaller grids for applications which require an external large memory device such as the SSD of the CRAY X-MP/48, or multitasking. The accuracy and stability of the composite grid scheme has been tested by numerically simulating the flow over an ellipsoid at angle of attack and comparing the solution with a single grid solution. The flowfield over a projectile at M = 0.96 and 4 deg angle-of-attack has been computed using a fine grid, and compared with experiment.

Sahu, Jubaraj↗

The multi-zone calculation of turbomachinery flows. II - The multi-zone calculation of the turbulent, two-specie flow through the SSME HPFTP first and second stage cavities

A multi-zone Navier-Stokes methodology to calculate the two-specie flow through the first and second stage cooling cavities of the Space Shuttle Main Engine (SSME) high pressure fuel turbopump (HPFTP) is developed. A simplified two-component fluid formulation is used to model the interaction of coolant and hot gas. Johnston's secant approximation is used to define an appropriate near wall velocity for use in a three-dimensional law of the wall. The basic Navier-Stokes algorithm used is a finite-volume, predictor-corrector algorithm which uses a pressure correction technique. A multi-zone method is used to partition each cavity into easily handled subdomains. The results show that coolant flow is pumped up the turbine wheel for both cavities, creating a region of large temperature gradients on the turbine shank.

Williams, M.↗

A single-assignment language in a distributed memory multiprocessor

The implementation of the single-assignment programming language SISAL (McGraw et al., 1985) on a Symult 2010 parallel computer is described. The advantages of single-assignment languages over imperative languages in a multiprocessor environment are reviewed; the characteristics of SISAL are summarized; the program-graph generation and dynamic data partitioning procedures are explained; and the application of SISAL in constructing a concurrent iterative multigrid algorithm is discussed in detail and illustrated with diagrams.

Evripidou, P.↗

Numerical simulation of three-dimensional transonic flows

The three-dimensional flow over a projectile has been computed using an implicit, approximately factored, partially flux-split algorithm. A simple composite grid scheme has been developed in which a single grid is partitioned into a series of smaller grids for applications which require an external large memory device such as the SSD of the CRAY X-MP/48 or multi-tasking. The accuracy and stability of the composite grid scheme have been tested by numerically simulating the flow over an ellipsoid at an angle of attack and comparing the solution with a single-grid solution. The flow field over a projectile at M = 0.96 and 1.1, and 4-deg angle of attack has been computed using a fine grid and compared with experiment.

Sahu, Jubaraj↗

A Vehicle Management End-to-End Testing and Analysis Platform for Validation of Mission and Fault Management Algorithms to Reduce Risk for NASAs Space Launch System

The engineering development of the National Aeronautics and Space Administration's (NASA) new Space Launch System (SLS) requires cross discipline teams with extensive knowledge of launch vehicle subsystems, information theory, and autonomous algorithms dealing with all operations from pre-launch through on orbit operations. The nominal and off-nominal characteristics of SLS's elements and subsystems must be understood and matched with the autonomous algorithm monitoring and mitigation capabilities for accurate control and response to abnormal conditions throughout all vehicle mission flight phases, including precipitating safing actions and crew aborts. This presents a large and complex systems engineering challenge, which is being addressed in part by focusing on the specific subsystems involved in the handling of off-nominal mission and fault tolerance with response management. Using traditional model-based system and software engineering design principles from the Unified Modeling Language (UML) and Systems Modeling Language (SysML), the Mission and Fault Management (M&FM) algorithms for the vehicle are crafted and vetted in Integrated Development Teams (IDTs) composed of multiple development disciplines such as Systems Engineering (SE), Flight Software (FSW), Safety and Mission Assurance (S&MA) and the major subsystems and vehicle elements such as Main Propulsion Systems (MPS), boosters, avionics, Guidance, Navigation, and Control (GNC), Thrust Vector Control (TVC), and liquid engines. These model-based algorithms and their development lifecycle from inception through FSW certification are an important focus of SLS's development effort to further ensure reliable detection and response to off-nominal vehicle states during all phases of vehicle operation from pre-launch through end of flight. To test and validate these M&FM algorithms a dedicated test-bed was developed for full Vehicle Management End-to-End Testing (VMET). For addressing fault management (FM) early in the development lifecycle for the SLS program, NASA formed the M&FM team as part of the Integrated Systems Health Management and Automation Branch under the Spacecraft Vehicle Systems Department at the Marshall Space Flight Center (MSFC). To support the development of the FM algorithms, the VMET developed by the M&FM team provides the ability to integrate the algorithms, perform test cases, and integrate vendor-supplied physics-based launch vehicle (LV) subsystem models. Additionally, the team has developed processes for implementing and validating the M&FM algorithms for concept validation and risk reduction. The flexibility of the VMET capabilities enables thorough testing of the M&FM algorithms by providing configurable suites of both nominal and off-nominal test cases to validate the developed algorithms utilizing actual subsystem models such as MPS, GNC, and others. One of the principal functions of VMET is to validate the M&FM algorithms and substantiate them with performance baselines for each of the target vehicle subsystems in an independent platform exterior to the flight software test and validation processes. In any software development process there is inherent risk in the interpretation and implementation of concepts from requirements and test cases into flight software compounded with potential human errors throughout the development and regression testing lifecycle. Risk reduction is addressed by the M&FM group but in particular by the Analysis Team working with other organizations such as S&MA, Structures and Environments, GNC, Orion, Crew Office, Flight Operations, and Ground Operations by assessing performance of the M&FM algorithms in terms of their ability to reduce Loss of Mission (LOM) and Loss of Crew (LOC) probabilities. In addition, through state machine and diagnostic modeling, analysis efforts investigate a broader suite of failure effects and associated detection and responses to be tested in VMET to ensure reliable failure detection, and confirm responses do not create additional risks or cause undesired states through interactive dynamic effects with other algorithms and systems. VMET further contributes to risk reduction by prototyping and exercising the M&FM algorithms early in their implementation and without any inherent hindrances such as meeting FSW processor scheduling constraints due to their target platform - the ARINC 6535-partitioned Operating System, resource limitations, and other factors related to integration with other subsystems not directly involved with M&FM such as telemetry packing and processing. The baseline plan for use of VMET encompasses testing the original M&FM algorithms coded in the same C++ language and state machine architectural concepts as that used by FSW. This enables the development of performance standards and test cases to characterize the M&FM algorithms and sets a benchmark from which to measure their effectiveness and performance in the exterior FSW development and test processes. This paper is outlined in a systematic fashion analogous to a lifecycle process flow for engineering development of algorithms into software and testing. Section I describes the NASA SLS M&FM context, presenting the current infrastructure, leading principles, methods, and participants. Section II defines the testing philosophy of the M&FM algorithms as related to VMET followed by section III, which presents the modeling methods of the algorithms to be tested and validated in VMET. Its details are then further presented in section IV followed by Section V presenting integration, test status, and state analysis. Finally, section VI addresses the summary and forward directions followed by the appendices presenting relevant information on terminology and documentation.

Trevino, Luis↗

Automating the parallel processing of fluid and structural dynamics calculations

The NASA Lewis Research Center is actively involved in the development of expert system technology to assist users in applying parallel processing to computational fluid and structural dynamic analysis. The goal of this effort is to eliminate the necessity for the physical scientist to become a computer scientist in order to effectively use the computer as a research tool. Programming and operating software utilities have previously been developed to solve systems of ordinary nonlinear differential equations on parallel scalar processors. Current efforts are aimed at extending these capabilities to systems of partial differential equations, that describe the complex behavior of fluids and structures within aerospace propulsion systems. This paper presents some important considerations in the redesign, in particular, the need for algorithms and software utilities that can automatically identify data flow patterns in the application program and partition and allocate calculations to the parallel processors. A library-oriented multiprocessing concept for integrating the hardware and software functions is described.

Arpasi, Dale J.↗

Automating the parallel processing of fluid and structural dynamics calculations

The NASA Lewis Research Center is actively involved in the development of expert system technology to assist users in applying parallel processing to computational fluid and structural dynamic analysis. The goal of this effort is to eliminate the necessity for the physical scientist to become a computer scientist in order to effectively use the computer as a research tool. Programming and operating software utilities have previously been developed to solve systems of ordinary nonlinear differential equations on parallel scalar processors. Current efforts are aimed at extending these capabilties to systems of partial differential equations, that describe the complex behavior of fluids and structures within aerospace propulsion systems. This paper presents some important considerations in the redesign, in particular, the need for algorithms and software utilities that can automatically identify data flow patterns in the application program and partition and allocate calculations to the parallel processors. A library-oriented multiprocessing concept for integrating the hardware and software functions is described.

Arpasi, Dale J.↗

Efficient matrix partitioning for optical computing

Techniques for partitioning optical linear algebra problems to make them amenable to solution using optical processors programmed with simple algorithms are explored. Generalized methods for splitting a linear algebra matrix into a series of submatrices are reviewed, showing that simple forms can be pipelined smoothly and that parallel accumulation can be achieved by beam combining on detectors or by summing electronically. The techniques offer simplified bookkeeping, algorithmic independence, and high efficiency. The computational speed will depend on the number of multiplier-accumulators devoted to the task.

Caulfield, H. J.↗

Linear optimization - A case study in performance analysis

The paper deals with the performance of two parallel variants of the simplex algorithm on a message-passing system. First, the simplex algorithm is reviewed, two possible parallelizations of the algorithm are discussed, and results of benchmark speedups of the alternatives are presented. Between column and row partitionings, the row partitioning method is found to be generally superior, while the column partitioning method is more efficient when the number of rows is small, and the number of columns is much greater that the number of rows. Various performance analysis tools are then applied to examine the reasons for relative performance differences, and communication idle time due to global minimization and load imbalances is noted as the main factor in execution slowdown.

Stunkel, Craig B.↗

Dynamic Programming for Structured Continuous Markov Decision Problems

We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamically partitioned into regions where the value function is the same throughout the region. We first describe the algorithm for piecewise constant representations. We then extend it to piecewise linear representations, using techniques from POMDPs to represent and reason about linear surfaces efficiently. We show that for complex, structured problems, our approach exploits the natural structure so that optimal solutions can be computed efficiently.

Dearden, Richard↗

Collision-induced gas phase dissociation rates

The Landau-Zener theory of reactive cross sections was applied to diatomic molecules dissociating from a ladder of vibrational states. The result predicts a dissociation rate that is quite well duplicated by an Arrhenius function having a preexponential temperature dependence of about T(sub -1/2), at least for inert collision partners. This relation fits experimental data reasonably well. The theory is then used to calculate the effect of vibrational nonequilibrium on dissociation rate. For Morse oscillators, the results are about the same as given by Hammerling, Kivel, and Teare in their analytic approximation for harmonic oscillators, though at very high temperature a correction for the partition function limit is included. The empirical correction for vibration nonequilibrium proposed by Park, which is a convenient algorithm for CFD calculations, is modified to prevent a drastic underestimation of dissociation rates that occurs with this method when vibrational temperature is much smaller than the kinetic temperature of the gas.

Hansen, C. Frederick↗

Surface net solar radiation estimated from satellite measurements - Comparisons with tower observations

A parameterization that relates the reflected solar flux at the top of the atmosphere to the net solar flux at the surface in terms of only the column water vapor amount and the solar zenith angle was tested against surface observations. Net surface fluxes deduced from coincidental collocated satellite-measured radiances and from measurements from towers in Boulder during summer and near Saskatoon in winter have mean differences of about 2 W/sq m, regardless of whether the sky is clear or cloudy. Furthermore, comparisons between the net fluxes deduced from the parameterization and from surface measurements showed equally good agreement when the data were partitioned into morning and afternoon observations. This is in contrast to results from an empirical clear-sky algorithm that is unable to account adequately for the effects of clouds and that shows, at Boulder, a distinct morning to afternoon variation. It is also demonstrated that the parameterization may be applied to irradiances at the top of the atmosphere that have been temporally averaged. The good agreement between the results of the parameterization and surface measurements suggests that the algorithm is a useful tool for a variety of climate studies.

Li, Zhanqing↗

Surface Net Solar Radiation Estimated from Satellite Measurements: Comparisons with Tower Observations

A parameterization that relates the reflected solar flux at the top of the atmosphere to the net solar flux at the surface in terms of only the column water vapor amount and the solar zenith angle was tested against surface observations. Net surface fluxes deduced from coincidental collocated satellite-measured radiances and from measurements from towers in Boulder during summer and near Saskatoon in winter have mean differences of about 2 W/sq m, regardless of whether the sky is clear or cloudy. Furthermore, comparisons between the net fluxes deduced from the parameterization and from surface measurements showed equally good agreement when the data were partitioned into morning and afternoon observations. This is in contrast to results from an empirical clear-sky algorithm that is unable to account adequately for the effects of clouds and that shows, at Boulder, a distinct morning to afternoon variation, which is presumably due to the predominance of different cloud types throughout the day. It is also demonstrated that the parameterization may be applied to irradiances at the top of the atmosphere that have been temporally averaged by using the temporally averaged column water vapor amount and the temporally averaged cosine of the solar zenith angle. The good agreement between the results of the parameterization and surface measurements suggests that the algorithm is a useful tool for a variety of climate studies.

Li, Zhanqing↗

Concurrent Cholesky factorization of positive definite banded Hermitian matrices

First, the Cholesky factorization is extended to cover uniformly partitioned banded positive definite matrices of rank n which may be real symmetric or Hermitian. Then, two stratagems are given for the use of the algorithm in concurrent machines where the number of processing elements is less than required to factor the matrix in as few serial steps as possible, and where uniformly high efficiency is expected from all processing elements. Expressions are given for the efficiency factor e appearing in the speed-up expression q = eN, and these are specialized for the N node hypercube machine as a function of partition size s, the number N of processing elements of the hypercube machine, and the cost mu of interelement transmission relative to computation. It is shown that the efficiency factor e is inversely proportional to mu/s, and that e is almost independent of N when N is large and mu/s = 0. The task is completed in n/s serial steps with no limit on n. The half bandwidth b of the matrix is 2 Ns.

Utku, S.↗

Hierarchial implicit dynamic least-square solution algorithm

This paper develops an implicit type transient solution strategy which possesses hierarchial levels of application. In particular, due to the manner of formulation, stiffness updating, assembly inversion, solution constraint, as well as iteration are all performed at a localized level. The level of iterative calculations depends on the type of hierarchial partitioning employed, namely degree of freedom, nodal, elemental, material/nonlinear group, substructural, and so on. Since the iterative solution process and application of constraints are applied at a local level, the resulting so-called hierarchial implicit solution algorithm possesses very stable and efficient numerical properties and is highly storage efficient. To demonstrate the scheme, the results of several benchmark examples are presented. These enable comparisons with the Newton-Raphson solved implicit transient solution method. Overall the comparisons illustrate the superior stability and efficiency of the hierarchial scheme.

Padovan, J.↗

Three Dimensional Sector Design with Optimal Number of Sectors

The concept of dynamic sector design suggests a strategic approach to ease air traffic congestion, which is predicted to become a serious problem in the national airspace system by 2025. Considerable research has been conducted to address the sectorization problem. In previous work, an approach that combines the Voronoi diagrams, Genetic Algorithms (GA), and the iterative deepening algorithm was proposed. However, as originally formulated, the number of sectors used was predefined and only two-dimensional partitions were allowed, which constrained the method's ability to achieve good designs. The current work extends the earlier Voronoi-based method by treating the number of sectors as an additional decision variable, allowing 3D partitions, and developing more comprehensive costs.

Xue, Min↗

3D Electromagnetic Plasma Particle Simulations on the Intel Delta Parallel Computer

A three-dimensional electromagnetic PIC code has been developed on the 512 node Intel Touchstone Delta MIMD parallel computer. This code is based on the General Concurrent PIC algorithm which uses a domain decomposition to divide the computation among the processors. The 3D simulation domain can be partitioned into 1-, 2-, or 3-dimensional subdomains. Particles must be exchanged between processors as they move among the subdomains.

PIC↗