Search NASA⌕ Search

SEARCH · Search NASA

Results for “ITERATION”

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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Iterative refinement scheduling

We present a heuristics-based approach to deep space mission scheduling which is modeled on the approach used by expert human schedulers in producing schedules for planetary encounters. New chronological evaluation techniques are used to focus the search by using information gained during the scheduling process to locate, classify, and resolve regions of conflict. Our approach is based on the assumption that during the construction of a schedule there exist several disjunct temporal regions where the demand for one resource type or a single temporal constraint dominates (bottleneck regions). If the scheduler can identify these regions and classify them based on their dominant constraint, then the scheduler can select the scheduling heuristic.

Biefeld, Eric↗
NASA NTRS1991

A non-iterative method for computing the infimum in H(infinity)-optimization

The authors, as an extension of their earlier work, present a simple noniterative procedure for the computation of the exact value of the infimum in the singular H(infinity)-optimization problem and is an extension of their earlier work. The problem formulation is general and does not place any restrictions on the direct feedthrough terms between the disturbance input and the measurement output variables. The method is applicable to a class of singular H(infinity)-optimization problems for which the transfer functions from the control input to the controlled output and from the disturbance input to the measurement output have no invariant zeros on the j-omega axis and also satisfy certain geometric conditions.

Chen, Ben M.↗
NASA NTRS1992

Complex generalized minimal residual algorithm for iterative solution of quantum-mechanical reactive scattering equations

Complex dense matrices corresponding to the D + H2 and O + HD reactions were solved using a complex generalized minimal residual (GMRes) algorithm described by Saad and Schultz (1986) and Saad (1990). To provide a test case with a different structure, the H + H2 system was also considered. It is shown that the computational effort for solutions with the GMRes algorithm depends on the dimension of the linear system, the total energy of the scattering problem, and the accuracy criterion. In several cases with dimensions in the range 1110-5632, the GMRes algorithm outperformed the LAPACK direct solver, with speedups for the linear equation solution as large as a factor of 23.

Chatfield, David C.↗
NASA NTRS1992

Non-iterative computation of the infimum in H-infinity-optimization for plants with invariant zeros on the j-omega axis

A simple and noniterative procedure for the computation of the exact value of the infimum in the singular H-infinity optimization problem is presented. The problem formulation is general, and no restrictions are placed on the finite and infinite zero structures of the system and on the direct feedthrough terms between the control input and the controlled output variables and between the disturbance input and the measurement output variables. The method is applicable to a class of singular H-infinity optimization problems for which the transfer functions from the control input to the controlled output and from the disturbance input to the measurement output satisfy certain geometric conditions. In particular, the authors extend the result of B. M. Chen et al. (1991) by allowing these two transfer functions to have invariant zeros on the j-omega axis.

Chen, Ben M.↗
NASA NTRS1993

Development of iterative techniques for the solution of unsteady compressible viscous flows

The work done under this project was documented in detail as the Ph. D. dissertation of Dr. Duane Hixon. The objectives of the research project were evaluation of the generalized minimum residual method (GMRES) as a tool for accelerating 2-D and 3-D unsteady flows and evaluation of the suitability of the GMRES algorithm for unsteady flows, computed on parallel computer architectures.

Sankar, Lakshmi↗
NASA NTRS1993

Separable concatenated codes with iterative map decoding for Rician fading channels

Very efficient signalling in radio channels requires the design of very powerful codes having special structure suitable for practical decoding schemes. In this paper, powerful codes are obtained by combining comparatively simple convolutional codes to form multi-tiered 'separable' convolutional codes. The decoding of these codes, using separable symbol-by-symbol maximum a posteriori (MAP) 'filters', is described. It is known that this approach yields impressive results in non-fading additive white Gaussian noise channels. Interleaving is an inherent part of the code construction, and consequently, these codes are well suited for fading channel communications. Here, simulation results for communications over Rician fading channels are presented to support this claim.

Lodge, J. H.↗
NASA NTRS1993

Convection equation modeling: A non-iterative direct matrix solution algorithm for use with SINDA

The determination of the boundary conditions for a component-level analysis, applying discrete finite element and finite difference modeling techniques often requires an analysis of complex coupled phenomenon that cannot be described algebraically. For example, an analysis of the temperature field of a coldplate surface with an integral fluid loop requires a solution to the parabolic heat equation and also requires the boundary conditions that describe the local fluid temperature. However, the local fluid temperature is described by a convection equation that can only be solved with the knowledge of the locally-coupled coldplate temperatures. Generally speaking, it is not computationally efficient, and sometimes, not even possible to perform a direct, coupled phenomenon analysis of the component-level and boundary condition models within a single analysis code. An alternative is to perform a disjoint analysis, but transmit the necessary information between models during the simulation to provide an indirect coupling. For this approach to be effective, the component-level model retains full detail while the boundary condition model is simplified to provide a fast, first-order prediction of the phenomenon in question. Specifically for the present study, the coldplate structure is analyzed with a discrete, numerical model (SINDA) while the fluid loop convection equation is analyzed with a discrete, analytical model (direct matrix solution). This indirect coupling allows a satisfactory prediction of the boundary condition, while not subjugating the overall computational efficiency of the component-level analysis. In the present study a discussion of the complete analysis of the derivation and direct matrix solution algorithm of the convection equation is presented. Discretization is analyzed and discussed to extend of solution accuracy, stability and computation speed. Case studies considering a pulsed and harmonic inlet disturbance to the fluid loop are analyzed to assist in the discussion of numerical dissipation and accuracy. In addition, the issues of code melding or integration with standard class solvers such as SINDA are discussed to advise the user of the potential problems to be encountered.

Schrage, Dean S.↗
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.↗