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,495 records · Page 83
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Departure solutions of the unsteady thin-layer and full Navier-Stokes equations solved using streamline curvature based iteration techniques

The development of a thorough understanding of the mechanisms for vortex eruptions from viscous layers, which are believed to be associated with phenomena such as dynamic stall onset and transition, is crucial if accurate models of such phenomena are to be formulated. The development of such models may, in turn, allow for the possibility that such effects could be accounted for during the design of various aerodynamic devices such as wings, helicopter rotors, and turbomachinery blading and thus lead to designs which are stall free or stall resistant and which have better stall-recovery properties. The present investigation is being conducted as part of an effort to develop analytical and numerical tools which can be used to help improve our understanding of the vortex-eruption mechanism at high Reynolds numbers. The addition of the normal-momentum equation to the classical unsteady boundary-layer equations is crucial according to recent asymptotic analyses of the vortex-eruption problem and is a key feature of the analyses being developed by the present authors. The purpose of this paper is as follows: to describe departure solution behavior observed when using unsteady, streamline-curvature based solution procedures in which nontrivial transverse pressure gradient effects are included; and to show that special treatment of the time-derivative of the normal velocity is needed to eliminate the ill-posed solution behavior, which is observed when small spatial and temporal step sizes are used.

Barnett, M.↗
NASA NTRS1995

Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms

A graph-theoretic design process and software tool is defined for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. Graph-search algorithms and analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool applies the design process to a given problem and includes performance optimization through the inclusion of additional precedence constraints among the schedulable tasks.

Jones, Robert L., III↗
NASA NTRS1995

Air pollution control system research: An iterative approach to developing affordable systems

This paper describes a Strategic Environmental Research and Development Program (SERDP) funded project led jointly by the Marine Corps Multi-Commodity Maintenance Centers, and the Air and Energy Engineering Research Laboratory (AEERL) of the USEPA. The research focuses on paint booth exhaust minimization using recirculation, and on volatile organic compound (VOC) oxidation by the modules of a hybrid air pollution control system. The research team is applying bench, pilot and full scale systems to accomplish the goals of reduced cost and improved effectiveness of air treatment systems for paint booth exhaust.

Watt, Lewis C.↗
NASA NTRS1995

Development of Fast Algorithms Using Recursion, Nesting and Iterations for Computational Electromagnetics

In the first phase of our work, we have concentrated on laying the foundation to develop fast algorithms, including the use of recursive structure like the recursive aggregate interaction matrix algorithm (RAIMA), the nested equivalence principle algorithm (NEPAL), the ray-propagation fast multipole algorithm (RPFMA), and the multi-level fast multipole algorithm (MLFMA). We have also investigated the use of curvilinear patches to build a basic method of moments code where these acceleration techniques can be used later. In the second phase, which is mainly reported on here, we have concentrated on implementing three-dimensional NEPAL on a massively parallel machine, the Connection Machine CM-5, and have been able to obtain some 3D scattering results. In order to understand the parallelization of codes on the Connection Machine, we have also studied the parallelization of 3D finite-difference time-domain (FDTD) code with PML material absorbing boundary condition (ABC). We found that simple algorithms like the FDTD with material ABC can be parallelized very well allowing us to solve within a minute a problem of over a million nodes. In addition, we have studied the use of the fast multipole method and the ray-propagation fast multipole algorithm to expedite matrix-vector multiplication in a conjugate-gradient solution to integral equations of scattering. We find that these methods are faster than LU decomposition for one incident angle, but are slower than LU decomposition when many incident angles are needed as in the monostatic RCS calculations.

Chew, W. C.↗
NASA NTRS1994

Improved Multi-Partition Method for Line-Based Iteration Schemes

Regular 3-dimensional multi-partitioning has been shown to be an efficient domain decomposition method for the parallelization of ADI-type algorithms on MIMD architectures. This paper discusses further improvements that can be made to the scheme that increase the granularity and reduce the communication density. These improvements, which are illustrated by simulation and parallel benchmark results, make multi-partitioning the method of choice on systems with relatively poor communication capabilities, such as networks of workstations, or on massively parallel machines with very fast processors, such as the IBM SP2.

Smith, Merritt H.↗
NASA NTRS2004

Iterative Magnetic/Structural Simulation of a MEMS Micro-shutter

A finite element model has been created that simulates the magnetic actuation of a cobalt-iron covered, 0.5micron thick, silicon nitride micro-shutter. The micro-shutter will be used as a transmissible filter in a space-based Multi-object Spectrograph (MOS). A laminated tri-pole permanent magnet is scanned across an array of shutters. The applied magnetic force twists the shutter's torsion hinge and actuates the shutter from the closed, 0 degree position, to the open, 90 degree position. A sequential analysis method was selected. This method uses the interaction between the magnetic and structural fields and is accomplished via the load vectors. The simulation results are compared to experimental measurements of fabricated micro-shutter devices.

Khaskia, Abed M.↗
NASA NTRS1994

Inventing and improving ribozyme function: rational design versus iterative selection methods

Two major strategies for generating novel biological catalysts exist. One relies on our knowledge of biopolymer structure and function to aid in the 'rational design' of new enzymes. The other, often called 'irrational design', aims to generate new catalysts, in the absence of detailed physicochemical knowledge, by using selection methods to search a library of molecules for functional variants. Both strategies have been applied, with considerable success, to the remodeling of existing ribozymes and the development of ribozymes with novel catalytic function. The two strategies are by no means mutually exclusive, and are best applied in a complementary fashion to obtain ribozymes with the desired catalytic properties.

Review, Tutorial↗
NASA NTRS2004

Finding Bounded Rational Equilibria: Iterative Focusing - Part 1

A long-running difficulty with conventional game theory has been how to modify it to accommodate the bounded rationality characterizing all real-world players. A recurring issue in statistical physics is how best to approximate joint probability distributions with decoupled (and therefore far more tractable) distributions. It has recently been shown that the same information theoretic mathematical structure, known as Probability Collectives (PC) underlies both issues. This relationship between statistical physics and game theory allows techniques and insights from the one field to be applied to the other. In particular, PC provides a formal model-independent definition of the degree of rationality of a player and of bounded rationality equilibria. This pair of papers extends previous work on PC by introducing new computational approaches to effectively find bounded rationality equilibria of common-interest (team) games.

Wolpert, David H.↗
NASA NTRS2005

Project Integration Architecture: Distributed Lock Management, Deadlock Detection, and Set Iteration

The migration of the Project Integration Architecture (PIA) to the distributed object environment of the Common Object Request Broker Architecture (CORBA) brings with it the nearly unavoidable requirements of multiaccessor, asynchronous operations. In order to maintain the integrity of data structures in such an environment, it is necessary to provide a locking mechanism capable of protecting the complex operations typical of the PIA architecture. This paper reports on the implementation of a locking mechanism to treat that need. Additionally, the ancillary features necessary to make the distributed lock mechanism work are discussed.

Jones, William Henry↗
NASA NTRS1994

A Parallel Incompressible Navier-Stokes Solver with Multigrid Iterations

We developed a parallel, numerically accurate and stable, and computationally efficient finate-difference incompressible Navier-Stokes (N-S) fluid flow solver. The solver runs on both sequential and massively parallel computers. The numerical method used here is a second-order projection method on a staggered grid. The code is highly modular and it can be used either as a stand-alone flow solver and or a template code which can be adapted or expanded to a specific application. Numerical results and parallel performances of our code on Intel Delta and Paragon are reported.

Navier-Stokes solver↗
NASA NTRS2000

Hybrid concatenated codes and iterative decoding

Several improved turbo code apparatuses and methods. The invention encompasses several classes: (1) A data source is applied to two or more encoders with an interleaver between the source and each of the second and subsequent encoders. Each encoder outputs a code element which may be transmitted or stored. A parallel decoder provides the ability to decode the code elements to derive the original source information d without use of a received data signal corresponding to d. The output may be coupled to a multilevel trellis-coded modulator (TCM). (2) A data source d is applied to two or more encoders with an interleaver between the source and each of the second and subsequent encoders. Each of the encoders outputs a code element. In addition, the original data source d is output from the encoder. All of the output elements are coupled to a TCM. (3) At least two data sources are applied to two or more encoders with an interleaver between each source and each of the second and subsequent encoders. The output may be coupled to a TCM. (4) At least two data sources are applied to two or more encoders with at least two interleavers between each source and each of the second and subsequent encoders. (5) At least one data source is applied to one or more serially linked encoders through at least one interleaver. The output may be coupled to a TCM. The invention includes a novel way of terminating a turbo coder.

Divsalar, Dariush↗
NASA NTRS1998

Progressive content-based retrieval of image and video with adaptive and iterative refinement

A method and apparatus for minimizing the time required to obtain results for a content based query in a data base. More specifically, with this invention, the data base is partitioned into a plurality of groups. Then, a schedule or sequence of groups is assigned to each of the operations of the query, where the schedule represents the order in which an operation of the query will be applied to the groups in the schedule. Each schedule is arranged so that each application of the operation operates on the group which will yield intermediate results that are closest to final results.

Li, Chung-Sheng↗