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 829 records · Page 46

Rescheduling with iterative repair

This paper presents a new approach to rescheduling called constraint-based iterative repair. This approach gives our system the ability to satisfy domain constraints, address optimization concerns, minimize perturbation to the original schedule, produce modified schedules, quickly, and exhibits 'anytime' behavior. The system begins with an initial, flawed schedule and then iteratively repairs constraint violations until a conflict-free schedule is produced. In an empirical demonstration, we vary the importance of minimizing perturbation and report how fast the system is able to resolve conflicts in a given time bound. We also show the anytime characteristics of the system. These experiments were performed within the domain of Space Shuttle ground processing.

Zweben, Monte↗

Rescheduling with iterative repair

This paper presents a new approach to rescheduling called constraint-based iterative repair. This approach gives our system the ability to satisfy domain constraints, address optimization concerns, minimize perturbation to the original schedule, and produce modified schedules quickly. The system begins with an initial, flawed schedule and then iteratively repairs constraint violations until a conflict-free schedule is produced. In an empirical demonstration, we vary the importance of minimizing perturbation and report how fast the system is able to resolve conflicts in a given time bound. These experiments were performed within the domain of Space Shuttle ground processing.

Zweben, Monte↗

A second order iteration procedure for correlation of analysis frequencies with test data

A second derivative frequency modification procedure is developed to iteratively change analysis modeling parameters for the more rapid convergence of analytically determined frequencies to those obtained by structural dynamic testing. A nonlinear system of algebraic equations in the modeling parameters is derived and a rapidly converging iterative method for their solution is presented. Numerical results obtained show that the higher order formulation and nonlinear predictor-corrector solution procedure yields results which are more rapidly convergent than those obtained using only the usual linear first-order parameter modification procedure. The proposed higher order theory also connverges in some cases when the ordinary linear theory does not.

Ojalvo, I. U.↗

Inversion of snow parameters by neural network with iterative inversion

The inversion of snow parameters from passive microwave remote sensing measurements is performed with a neural network trained with a dense media multiple scattering model. A constrained iterative inversion scheme is used. Inversion of four parameters is performed from five brightness temperatures. The four parameters are: mean grain size of ice particles in snow, snow density, snow temperature, and snow depth. The five brightness temperatures are that of 19-GHz vertical polarization, 19-GHz horizontal polarization, 22-GHz vertical polarization, 37-GHz vertical polarization, and 37-GHz horizontal polarization. Based on the neural network constrained iterative inversion algorithm, synthetic mapping of the terrain is performed. The retrieval of synthetic mapping has been achieved. The incorporation of ground truth information is considered.

Chen, Zhengxiao↗

An iterative multidisciplinary analysis for rotor blade shape determination

A CFD solver called ADPAC-APES is coupled with a NASTRAN structural analysis and a MARC thermal/heat transfer analysis to determine rotor blade shape. Nonlinear blade displacements due to centrifugal loads, aerodynamic pressures, and nonuniform temperature distribution are determined simultaneously. The effect of blade displacements on aerodynamic pressures and temperatures is then analyzed. These calculations are iterated till a steady state is reached across all the disciplines. This iterative procedure is applied to a ducted fan rotor blade and the manufactured shape is determined from a given operating shape. Effect of a part-span shroud on blade deflections is also analyzed.

Mahajan, Aparajit J.↗

On the particular integrals of the Prandtl-Busemann iteration equations for the flow of a compressible fluid

The particular integrals of the second-order and third-order Prandtl-Busemann iteration equations for the flow of a compressible fluid are obtained by means of the method in which the complex conjugate variables are utilized as the independent variables of the analysis. The assumption is made that the Prandtl-Glauert solution of the linearized or first-order iteration equation for the two-dimensional flow of a compressible fluid is known. The forms of the particular integrals, derived for subsonic flow, are readily adapted to supersonic flows with only a change in sign of one of the parameters of the problem.

Kaplan, Carl↗

Accumulated approximation: A new method for structural optimization by iterative improvement

A new method for the solution of non-linear mathematical programming problems in the field of structural optimization is presented. It is an iterative scheme which for each iteration refines the approximation of objective and constraint functions by accumulating the function values of previously visited design points. The method has proven to be competitive for a number of well-known examples of which one is presented here. Furthermore because of the accumulation strategy, the method produces convergence even when the sensitivity analysis is inaccurate.

Rasmussen, John↗

Gaussian beam and physical optics iteration technique for wideband beam waveguide feed design

The Gaussian beam technique has become increasingly popular for wideband beam waveguide (BWG) design. However, it is observed that the Gaussian solution is less accurate for smaller mirrors (approximately less than 30 lambda in diameter). Therefore, a high-performance wideband BWG design cannot be achieved by using the Gaussian beam technique alone. This article demonstrates a new design approach by iterating Gaussian beam and BWG parameters simultaneously at various frequencies to obtain a wideband BWG. The result is further improved by comparing it with physical optics results and repeating the iteration.

Veruttipong, W.↗

Sensitivity derivatives for three dimensional supersonic Euler code using incremental iterative strategy

In a recent work, an incremental strategy was proposed to iteratively solve the very large systems of linear equations that are required to obtain quasianalytical sensitivity derivatives from advanced computational fluid dynamics (CFD) codes. The technique was sucessfully demonstrated for two large two-dimensional problems: a subsonic and a transonic airfoil. The principal feature of this incremental iterative stategy is that it allows the use of the identical approximate coefficient matrix operator and algorithm to solve the nonlinear flow and the linear sensitivity equations; at convergence, the accuracy of the sensitivity derivatives is not compromised. This feature allows a comparatively straightforward extension of the methodology to three-dimensional problems; this extension is successfully demonstrated in the present study for a space-marching solution of the three-dimensional Euler equations over a Mach 2.4 blended wing-body configuration.

Korivi, Vamshi Mohan↗

Programmable Iterative Optical Image And Data Processing

Proposed method of iterative optical image and data processing overcomes limitations imposed by loss of optical power after repeated passes through many optical elements - especially, beam splitters. Involves selective, timed combination of optical wavefront phase conjugation and amplification to regenerate images in real time to compensate for losses in optical iteration loops; timing such that amplification turned on to regenerate desired image, then turned off so as not to regenerate other, undesired images or spurious light propagating through loops from unwanted reflections.

Jackson, Deborah J.↗

An Iterative Soft-Decision Decoding Algorithm

This paper presents a new minimum-weight trellis-based soft-decision iterative decoding algorithm for binary linear block codes. Simulation results for the RM(64,22), EBCH(64,24), RM(64,42) and EBCH(64,45) codes show that the proposed decoding algorithm achieves practically (or near) optimal error performance with significant reduction in decoding computational complexity. The average number of search iterations is also small even for low signal-to-noise ratio.

Lin, Shu↗

Iterative LQG Controller Design Through Closed-Loop Identification

This paper presents an iterative Linear Quadratic Gaussian (LQG) controller design approach for a linear stochastic system with an uncertain open-loop model and unknown noise statistics. This approach consists of closed-loop identification and controller redesign cycles. In each cycle, the closed-loop identification method is used to identify an open-loop model and a steady-state Kalman filter gain from closed-loop input/output test data obtained by using a feedback LQG controller designed from the previous cycle. Then the identified open-loop model is used to redesign the state feedback. The state feedback and the identified Kalman filter gain are used to form an updated LQC controller for the next cycle. This iterative process continues until the updated controller converges. The proposed controller design is demonstrated by numerical simulations and experiments on a highly unstable large-gap magnetic suspension system.

Hsiao, Min-Hung↗

Soft-Decision Decoding of Binary Linear Block Codes Based on an Iterative Search Algorithm

This correspondence presents a suboptimum soft-decision decoding scheme for binary linear block codes based on an iterative search algorithm. The scheme uses an algebraic decoder to iteratively generate a sequence of candidate codewords one at a time using a set of test error patterns that are constructed based on the reliability information of the received symbols. When a candidate codeword is generated, it is tested based on an optimality condition. If it satisfies the optimality condition, then it is the most likely (ML) codeword and the decoding stops. If it fails the optimality test, a search for the ML codeword is conducted in a region which contains the ML codeword. The search region is determined by the current candidate codeword and the reliability of the received symbols. The search is conducted through a purged trellis diagram for the given code using the Viterbi algorithm. If the search fails to find the ML codeword, a new candidate is generated using a new test error pattern, and the optimality test and search are renewed. The process of testing and search continues until either the MEL codeword is found or all the test error patterns are exhausted and the decoding process is terminated. Numerical results show that the proposed decoding scheme achieves either practically optimal performance or a performance only a fraction of a decibel away from the optimal maximum-likelihood decoding with a significant reduction in decoding complexity compared with the Viterbi decoding based on the full trellis diagram of the codes.

Lin, Shu↗

Iterated Stretching of Viscoelastic Jets

We examine, with asymptotic analysis and numerical simulation, the iterated stretching dynamics of FENE and Oldroyd-B jets of initial radius r(sub 0), shear viscosity nu, Weissenberg number We, retardation number S, and capillary number Ca. The usual Rayleigh instability stretches the local uniaxial extensional flow region near a minimum in jet radius into a primary filament of radius [Ca(1 - S)/ We](sup 1/2)r(sub 0) between two beads. The strain-rate within the filament remains constant while its radius (elastic stress) decreases (increases) exponentially in time with a long elastic relaxation time 3We(r(sup 2, sub 0)/nu). Instabilities convected from the bead relieve the tension at the necks during this slow elastic drainage and trigger a filament recoil. Secondary filaments then form at the necks from the resulting stretching. This iterated stretching is predicted to occur successively to generate high-generation filaments of radius r(sub n), (r(sub n)/r(sub 0)) = square root of 2[r(sub n-1)/r(sub 0)](sup 3/2) until finite-extensibility effects set in.

Chang, Hsueh-Chia↗

Traffic Management Advisor: Iterative Field Development and Assessment at Multiple Sites

Previous studies have demonstrated the necessity of involving users in the development of automation aids, especially for complex domains such as air traffic control (ATC). Traditional development only demanded a single field test to validate a completed system, but a more iterative combination of development and assessment ensures that the technology meets the requirements of its application domain. Exposure across an adequate spectrum of field users is also required during development, and the use of multiple development sites provides an opportunity to consider individual facility cultures as they relate to implementation strategies. The development of the Center/TRACON Automation System (CTAS) Traffic Management Advisor (TMA) at the Denver and Dallas ATC facilities demonstrates successful iterative development and assessment at multiple field sites. The use of field development changes the nature of assessment. As development progresses, periodic assessments are required to validate that system development is progressing along an appropriate track. In the development of the TMA, assessments were performed based on software in the field, and input from traffic managers was analyzed and incorporated into subsequent releases of the TMA, to be reassessed in the field. This has led to a tool with operational suitability and broad user acceptance. Assessment at multiple sites provides a more generalizable perspective that allows the production of a system that is both generic enough to be used at different sites and tailored enough to be of use at any site. In addition to providing a better understanding of specific facility requirements, the use of multiple assessment sites in the development of TMA has provided an opportunity to consider individual facility operations, procedures and cultures as they relate to development and implementation strategies.

Sanford, Beverly D.↗

Automatic Synthesis of UML Designs from Requirements in an Iterative Process

The Unified Modeling Language (UML) is gaining wide popularity for the design of object-oriented systems. UML combines various object-oriented graphical design notations under one common framework. A major factor for the broad acceptance of UML is that it can be conveniently used in a highly iterative, Use Case (or scenario-based) process (although the process is not a part of UML). Here, the (pre-) requirements for the software are specified rather informally as Use Cases and a set of scenarios. A scenario can be seen as an individual trace of a software artifact. Besides first sketches of a class diagram to illustrate the static system breakdown, scenarios are a favorite way of communication with the customer, because scenarios describe concrete interactions between entities and are thus easy to understand. Scenarios with a high level of detail are often expressed as sequence diagrams. Later in the design and implementation stage (elaboration and implementation phases), a design of the system's behavior is often developed as a set of statecharts. From there (and the full-fledged class diagram), actual code development is started. Current commercial UML tools support this phase by providing code generators for class diagrams and statecharts. In practice, it can be observed that the transition from requirements to design to code is a highly iterative process. In this talk, a set of algorithms is presented which perform reasonable synthesis and transformations between different UML notations (sequence diagrams, Object Constraint Language (OCL) constraints, statecharts). More specifically, we will discuss the following transformations: Statechart synthesis, introduction of hierarchy, consistency of modifications, and "design-debugging".

Schumann, Johann↗

Decentralized Control of Sound Radiation from an Aircraft-Style Panel Using Iterative Loop Recovery

A decentralized LQG-based control strategy is designed to reduce low-frequency sound transmission through periodically stiffened panels. While modern control strategies have been used to reduce sound radiation from relatively simple structural acoustic systems, significant implementation issues have to be addressed before these control strategies can be extended to large systems such as the fuselage of an aircraft. For instance, centralized approaches typically require a high level of connectivity and are computationally intensive, while decentralized strategies face stability problems caused by the unmodeled interaction between neighboring control units. Since accurate uncertainty bounds are not known a priori, it is difficult to ensure the decentralized control system will be robust without making the controller overly conservative. Therefore an iterative approach is suggested, which utilizes frequency-shaped loop recovery. The approach accounts for modeling error introduced by neighboring control loops, requires no communication between subsystems, and is relatively simple. The control strategy is validated using real-time control experiments performed on a built-up aluminum test structure representative of the fuselage of an aircraft. Experiments demonstrate that the iterative approach is capable of achieving 12 dB peak reductions and a 3.6 dB integrated reduction in radiated sound power from the stiffened panel.

Schiller, Noah H.↗

Iterative Mechanism Solutions with Scenario and ADAMS

This slide presentation reviews the use of iterative solutions using Scenario for Motion (UG NX 2 Motion) to assist in designing the Mars Science Laboratory (MSL). The MSL will have very unique design requirements, and in order to meet these requirements the system must have the ability to design for static stability, simulate mechanism kinematics, simulate dynamic behaviour and be capable of reconfiguration, and iterations as designed. The legacy process used on the Mars Exploration rovers worked, but it was cumbersome using multiple tools, limited configuration control, with manual process and communication, and multiple steps. The aim is to develop a mechanism that would reduce turn around time, and make more reiterations possible, to improve the quality and quantity of data, and to enhance configuration control. Currently for NX Scenario for Motion uses are in the articulation studies, the simulations of traverse motions,and subsystem simulations. The design of the Rover landing model requires accurate results, flexible elements, such as beams, and the use of the full ADAMS solver has been used. In order to achieve this, when required, there has been a direct translation from Scenario to ADAMS, with additional data in ascii format. The process that has been designed to move from Scenario to ADAMS is reviewed.

Mars Science Laboratory (MSL)↗