Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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,567 records · Page 87

Shielding from space radiations

This Progress Report covering the period of 1 June 1993 to 1 Dec. 1993 presents the development of an analytical solution to the heavy ion transport equation in terms of a one-layer Green's function formalism. The mathematical developments are recasted into an efficient computer code for space applications. The efficiency of this algorithm is accomplished by a nonperturbative technique of extending the Green's function over the solution domain. The code may also be applied to accelerator boundary conditions to allow code validation in laboratory experiments. Results from the isotopic version of the code with 80 isotopes present for a single layer target material, for the case of an Iron beam projectile at 600 MeV/nucleon in water is presented.

Chang, C. Ken↗

Shielding from space radiations

This Progress Report covering the period of 1 June 1993 to 1 Dec. 1993 presents the development of an analytical solution to the heavy ion transport equation in terms of a one-layer Green's function formalism. The mathematical developments are recasted into an efficient computer code for space applications. The efficiency of this algorithm is accomplished by a nonperturbative technique of extending the Green's function over the solution domain. The code may also be applied to accelerator boundary conditions to allow code validation in laboratory experiments. Results from the isotopic version of the code with 80 isotopes present for a single layer target material, for the case of an iron beam projectile at 600 MeV/nucleon in water is presented.

Chang, C. Ken↗

Some practicable applications of quadtree data structures/representation in astronomy

Development of quadtree as hierarchical data structuring technique for representing spatial data (like points, regions, surfaces, lines, curves, volumes, etc.) has been motivated to a large extent by storage requirements of images, maps, and other multidimensional (spatially structured) data. For many spatial algorithms, time-efficiency of quadtrees in terms of execution may be as important as their space-efficiency concerning storage conditions. Briefly, the quadtree is a class of hierarchical data structures which is based on the recursive partition of a square region into quadrants and sub-quadrants until a predefined limit. Beyond the wide applicability of quadtrees in image processing, spatial information analysis, and building digital databases (processes becoming ordinary for the astronomical community), there may be numerous further applications in astronomy. Some of these practicable applications based on quadtree representation of astronomical data are presented and suggested for further considerations. Examples are shown for use of point as well as region quadtrees. Statistics of different leaf and non-leaf nodes (homogeneous and heterogeneous sub-quadrants respectively) at different levels may provide useful information on spatial structure of astronomical data in question. By altering the principle guiding the decomposition process, different types of spatial data may be focused on. Finally, a sampling method based on quadtree representation of an image is proposed which may prove to be efficient in the elaboration of sampling strategy in a region where observations were carried out previously either with different resolution or/and in different bands.

Pasztor, L.↗

Optimized design of a hypersonic nozzle

Conventional procedures for designing nozzles involve the design of an inviscid contour (using the method of characteristics) that is corrected with a displacement thickness calculated from boundary-layer theory. However, nozzles designed using this classical procedure have been shown to exhibit poor flow quality at Mach numbers characteristic of hypersonic applications. The nozzle to be designed will be a part of the NASA HYPULSE facility which is being used for hypervelocity flight research. Thus, the flow quality of the nozzle is a critical question that needs to be addressed. Design of nozzles for hypersonic applications requires a proper assessment of the effects of the thick boundary layer on the inviscid flowfield. Since the flow field is largely supersonic, the parabolized form of the Navier-Stokes (PNS) equations can be used. The requirement of a uniform flow at the exit plane of the nozzle can be used to define an objective function as part of an optimization procedure. The design procedure used in this study involves the coupling of a nonlinear (least-squares) optimization algorithm with an efficient, explicit PNS solver. The thick boundary layers growing on the walls of the nozzle limit the extent of the usable core region (region with uniform flow) for testing models (especially rectangular). In order to maximize the region of uniform flow, it was decided to have the exit plane of this nozzle to be (nearly) rectangular. Thus, an additional constraint on the nozzle shape resulted, namely the nozzle will have a shape transitioning from a circular one at the inlet to that of a rectangle at the exit. In order to provide for a smooth shape transition, the cross sectional contour of the nozzle is defined by a superellipse. The nozzle is taken to be a meter in length. The axial variations of the major and minor radii of the superellipse are governed by cubic splines. The design parameters are the coefficients of the splines associated with the local nozzle wall slopes. Extensive calculations have been made (with a three-dimensional Euler code) to understand the effects of various parameters such as location of the knot points of the spline function, different ways of characterizing the uniformity of the flow in the exit plane, as well as the effect of constraining the area of the nozzle to be invariant. Turbulent flow (measurements indicate that the flow at the nozzle inlet is turbulent) calculations are now being performed (with the inviscidly designed nozzle contours) to assess the flow quality.

Krishnamurthy, Ramesh↗

Data parallel sorting for particle simulation

Sorting on a parallel architecture is a communications intensive event which can incur a high penalty in applications where it is required. In the case of particle simulation, only integer sorting is necessary, and sequential implementations easily attain the minimum performance bound of O (N) for N particles. Parallel implementations, however, have to cope with the parallel sorting problem which, in addition to incurring a heavy communications cost, can make the minimun performance bound difficult to attain. This paper demonstrates how the sorting problem in a particle simulation can be reduced to a merging problem, and describes an efficient data parallel algorithm to solve this merging problem in a particle simulation. The new algorithm is shown to be optimal under conditions usual for particle simulation, and its fieldwise implementation on the Connection Machine is analyzed in detail. The new algorithm is about four times faster than a fieldwise implementation of radix sort on the Connection Machine.

Dagum, Leonardo↗

Effect of grid aspect ratio on convergence

The effects of high-aspect-ratio grids on algorithm convergence are considered by means of vector stability theory and computational experiments. The results indicate that approximately factored implicit schemes experience convergence deterioration because of nonoptimum local time-stepping procedures and increased need for viscous preconditioning. Based on this insight, an enhanced algorithm is devised using improved selection of the local time step, appropriate definition of the viscous preconditioning matrix, and proper implementation of the boundary conditions. The new algorithm provides uniformly efficient convergence at all aspect ratios for both Euler and Navier-Stokes computations for a variety of test problems.

Buelow, P. E. O.↗

Communication overhead on the Intel Paragon, IBM SP2 and Meiko CS-2

Interprocessor communication overhead is a crucial measure of the power of parallel computing systems-its impact can severely limit the performance of parallel programs. This report presents measurements of communication overhead on three contemporary commercial multicomputer systems: the Intel Paragon, the IBM SP2 and the Meiko CS-2. In each case the time to communicate between processors is presented as a function of message length. The time for global synchronization and memory access is discussed. The performance of these machines in emulating hypercubes and executing random pairwise exchanges is also investigated. It is shown that the interprocessor communication time depends heavily on the specific communication pattern required. These observations contradict the commonly held belief that communication overhead on contemporary machines is independent of the placement of tasks on processors. The information presented in this report permits the evaluation of the efficiency of parallel algorithm implementations against standard baselines.

Bokhari, Shahid H.↗

Progress in the Large-Eddy Simulation of an Asymmetric Plane Diffuser

The flow through a plane asymmetric diffuser is a good test case for assessing the capability of LES since it contains features such as large scale unsteady separation and strong intermittency which are difficult to capture using conventional modeling approaches. Previous attempts to simulate this flow (Kaltenbach, 1994) have significantly underpredicted the extent of separation. The objective of the present research is to understand why the previous simulations did not predict the flow separation correctly. This study focuses on mesh refinement and matching of the inlet velocity profile. In order to perform this study, the flow solver of Kaltenbach (1994) was modified to increase its accuracy and efficiency. The improved algorithm allows for better resolution at affordable CPU cost.

Fatica, Massimiliano↗

Gradient-Based Aerodynamic Shape Optimization Using ADI Method for Large-Scale Problems

A gradient-based shape optimization methodology, that is intended for practical three-dimensional aerodynamic applications, has been developed. It is based on the quasi-analytical sensitivities. The flow analysis is rendered by a fully implicit, finite volume formulation of the Euler equations.The aerodynamic sensitivity equation is solved using the alternating-direction-implicit (ADI) algorithm for memory efficiency. A flexible wing geometry model, that is based on surface parameterization and platform schedules, is utilized. The present methodology and its components have been tested via several comparisons. Initially, the flow analysis for for a wing is compared with those obtained using an unfactored, preconditioned conjugate gradient approach (PCG), and an extensively validated CFD code. Then, the sensitivities computed with the present method have been compared with those obtained using the finite-difference and the PCG approaches. Effects of grid refinement and convergence tolerance on the analysis and shape optimization have been explored. Finally the new procedure has been demonstrated in the design of a cranked arrow wing at Mach 2.4. Despite the expected increase in the computational time, the results indicate that shape optimization, which require large numbers of grid points can be resolved with a gradient-based approach.

Pandya, Mohagna J.↗

A Multiblock Approach for Calculating Incompressible Fluid Flows on Unstructured Grids

A multiblock approach is presented for solving two-dimensional incompressible turbulent flows on unstructured grids. The artificial compressibility form of the governing equations is solved by a vertex-centered, finite-volume implicit scheme which uses a backward Euler time discretization. Point Gauss-Seidel relaxations are used to solve the linear system of equations at each time step. This work introduces a multiblock strategy to the solution procedure, which greatly improves the efficiency of the algorithm by significantly reducing the memory requirements while not increasing the CPU time. Results presented in this work shows that the current multiblock algorithm requires 70% less memory than the single block algorithm.

Sheng, Chunhua↗

Shielding from Space Radiations

This Final Progress Report for NCC-1-178 presents the details of the engineering development of an analytical/computational solution to the heavy ion transport equation in terms of a multi-layer Green's function formalism as applied to the Small Spacecraft Technology Initiative (SSTI) program. The mathematical developments are recasted into a series of efficient computer codes for space applications. The efficiency of applied algorithms is accomplished by a nonperturbative technique of extending the Green's function over the solution domain. The codes may also be applied to the accelerator boundary conditions to allow code validation in laboratory experiments. Correlations with experiments for the isotopic version of the code with 59 and 80 isotopes present for a two layers target material in water has been verified.

Chang, C. Ken↗

The Calculation of Fractal Dimension in the Presence of Non-Fractal Clutter

The area of information processing has grown dramatically over the last 50 years. In the areas of image processing and information storage the technology requirements have far outpaced the ability of the community to meet demands. The need for faster recognition algorithms and more efficient storage of large quantities of data has forced the user to accept less than lossless retrieval of that data for analysis. In addition to clutter that is not the object of interest in the data set, often the throughput requirements forces the user to accept "noisy" data and to tolerate the clutter inherent in that data. It has been shown that some of this clutter, both the intentional clutter (clouds, trees, etc) as well as the noise introduced on the data by processing requirements can be modeled as fractal or fractal-like. Traditional methods using Fourier deconvolution on these sources of noise in frequency space leads to loss of signal and can, in many cases, completely eliminate the target of interest. The parameters that characterize fractal-like noise (predominately the fractal dimension) have been investigated and a technique to reduce or eliminate noise from real scenes has been developed. Examples of clutter reduced images are presented.

Herren, Kenneth A.↗

Three-Dimensional Incompressible Navier-Stokes Flow Computations about Complete Configurations Using a Multiblock Unstructured Grid Approach

A multiblock unstructured grid approach is presented for solving three-dimensional incompressible inviscid and viscous turbulent flows about complete configurations. The artificial compressibility form of the governing equations is solved by a node-based, finite volume implicit scheme which uses a backward Euler time discretization. Point Gauss-Seidel relaxations are used to solve the linear system of equations at each time step. This work employs a multiblock strategy to the solution procedure, which greatly improves the efficiency of the algorithm by significantly reducing the memory requirements by a factor of 5 over the single-grid algorithm while maintaining a similar convergence behavior. The numerical accuracy of solutions is assessed by comparing with the experimental data for a submarine with stem appendages and a high-lift configuration.

Sheng, Chunhua↗

Analysis of Phase-Type Stochastic Petri Nets With Discrete and Continuous Timing

The Petri net formalism is useful in studying many discrete-state, discrete-event systems exhibiting concurrency, synchronization, and other complex behavior. As a bipartite graph, the net can conveniently capture salient aspects of the system. As a mathematical tool, the net can specify an analyzable state space. Indeed, one can reason about certain qualitative properties (from state occupancies) and how they arise (the sequence of events leading there). By introducing deterministic or random delays, the model is forced to sojourn in states some amount of time, giving rise to an underlying stochastic process, one that can be specified in a compact way and capable of providing quantitative, probabilistic measures. We formalize a new non-Markovian extension to the Petri net that captures both discrete and continuous timing in the same model. The approach affords efficient, stationary analysis in most cases and efficient transient analysis under certain restrictions. Moreover, this new formalism has the added benefit in modeling fidelity stemming from the simultaneous capture of discrete- and continuous-time events (as opposed to capturing only one and approximating the other). We show how the underlying stochastic process, which is non-Markovian, can be resolved into simpler Markovian problems that enjoy efficient solutions. Solution algorithms are provided that can be easily programmed.

Jones, Robert L.↗

Computational Aerothermodynamics in Aeroassist Applications

Aeroassisted planetary entry uses atmospheric drag to decelerate spacecraft from super-orbital to orbital or suborbital velocities. Numerical simulation of flow fields surrounding these spacecraft during hypersonic atmospheric entry is required to define aerothermal loads. The severe compression in the shock layer in front of the vehicle and subsequent, rapid expansion into the wake are characterized by high temperature, thermo-chemical nonequilibrium processes. Implicit algorithms required for efficient, stable computation of the governing equations involving disparate time scales of convection, diffusion, chemical reactions, and thermal relaxation are discussed. Robust point-implicit strategies are utilized in the initialization phase; less robust but more efficient line-implicit strategies are applied in the endgame. Applications to ballutes (balloon-like decelerators) in the atmospheres of Venus, Mars, Titan, Saturn, and Neptune and a Mars Sample Return Orbiter (MSRO) are featured. Examples are discussed where time-accurate simulation is required to achieve a steady-state solution.

Gnoffo, Peter A.↗

Design and Implementation of a Parallel Multivariate Ensemble Kalman Filter for the Poseidon Ocean General Circulation Model

A multivariate ensemble Kalman filter (MvEnKF) implemented on a massively parallel computer architecture has been implemented for the Poseidon ocean circulation model and tested with a Pacific Basin model configuration. There are about two million prognostic state-vector variables. Parallelism for the data assimilation step is achieved by regionalization of the background-error covariances that are calculated from the phase-space distribution of the ensemble. Each processing element (PE) collects elements of a matrix measurement functional from nearby PEs. To avoid the introduction of spurious long-range covariances associated with finite ensemble sizes, the background-error covariances are given compact support by means of a Hadamard (element by element) product with a three-dimensional canonical correlation function. The methodology and the MvEnKF configuration are discussed. It is shown that the regionalization of the background covariances; has a negligible impact on the quality of the analyses. The parallel algorithm is very efficient for large numbers of observations but does not scale well beyond 100 PEs at the current model resolution. On a platform with distributed memory, memory rather than speed is the limiting factor.

Keppenne, Christian L.↗

Fast Three-Dimensional Method of Modeling Atomic Oxygen Undercutting of Protected Polymers

A method is presented to model atomic oxygen erosion of protected polymers in low Earth orbit (LEO). Undercutting of protected polymers by atomic oxygen occurs in LEO due to the presence of scratch, crack or pin-window defects in the protective coatings. As a means of providing a better understanding of undercutting processes, a fast method of modeling atomic-oxygen undercutting of protected polymers has been developed. Current simulation methods often rely on computationally expensive ray-tracing procedures to track the surface-to-surface movement of individual "atoms." The method introduced in this paper replaces slow individual particle approaches by substituting a model that utilizes both a geometric configuration-factor technique, which governs the diffuse transport of atoms between surfaces, and an efficient telescoping series algorithm, which rapidly integrates the cumulative effects stemming from the numerous atomic oxygen events occurring at the surfaces of an undercut cavity. This new method facilitates the systematic study of three-dimensional undercutting by allowing rapid simulations to be made over a wide range of erosion parameters.

Snyder, Aaron↗