Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative algorithms”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS1978

An algorithm for optimal structural design with frequency constraints

The paper presents a finite element method for minimum weight design of structures with lower-bound constraints on the natural frequencies, and upper and lower bounds on the design variables. The design algorithm is essentially an iterative solution of the Kuhn-Tucker optimality criterion. The three most important features of the algorithm are: (1) a small number of design iterations are needed to reach optimal or near-optimal design, (2) structural elements with a wide variety of size-stiffness may be used, the only significant restriction being the exclusion of curved beam and shell elements, and (3) the algorithm will work for multiple as well as single frequency constraints. The design procedure is illustrated with three simple problems.

Kiusalaas, J.↗
NASA NTRS1990

Skyline based terrain matching

Skyline-based terrain matching, a new method for locating the vantage point of stereo camera or laser range-finding measurements on a global map previously prepared by satellite or aerial mapping is described. The orientation of the vantage is assumed known, but its translational parameters are determined by the algorithm. Skylines, or occluding contours, can be extracted from the sensory measurements taken by an autonomous vehicle. They can also be modeled from the global map, given a vantage estimate from which to start. The two sets of skylines, represented in cylindrical coordinates about either the true or the estimated vantage, are employed as 'features' or reference objects common to both sources of information. The terrain matching problem is formulated in terms of finding a translation between the respective representations of the skylines, by approximating the two sets of skylines as identical features (curves) on the actual terrain. The search for this translation is based on selecting the longest of the minimum-distance vectors between corresponding curves from the two sets of skylines. In successive iterations of the algorithm, the approximation that the two sets of curves are identical becomes more accurate, and the vantage estimate continues to improve. The algorithm was implemented and evaluated on a simulated terrain. Illustrations and examples are included.

Page, Lance A.↗
NASA NTRS1993

Atmospheric infrared sounder

Work continued on analysis of data from the TOGA-COARE experiment. The MIT Microwave Temperature Sounder was flown on NASA's ER-2 at Wallops Island in the CAMEX experiment during September and October. The preliminary version of the 'microwave first-guess' algorithm for temperature and moisture was delivered to JPL. In the iterative minimum-variance algorithm moisture retrievals from MHS make use of the retrieved temperature profile in calculation of weighting functions and in determining the saturation moisture capacity at each level. Simulations have been run to address the question of how important the temperature profile accuracy is to the moisture retrieval.

Rosenkranz, Philip W.↗
NASA NTRS1975

Hybrid computer methods for direct functional optimization

Control and trajectory optimization involves the minimization of a performance index (PI) of integral form where some optimal control law exists in a dynamic system. In this paper, a hybrid minicomputer with an adaptive random-search algorithm implements an iterative search for the optimal control. The search assumes that some initial control is randomly perturbed and a fast analog computer generates respective PI from the analog response of the dynamic system. An improved PI informs the digital computer to utilize the perturbed control as a basis for the next iteration; otherwise a new perturbation replaces the old perturbation in the next iteration. The search terminates when no further improvements occur.

Andrews, M.↗
NASA NTRS1976

Voltage profile program for the Kennedy Space Center electric power distribution system

The Kennedy Space Center voltage profile program computes voltages at all busses greater than 1 Kv in the network under various conditions of load. The computation is based upon power flow principles and utilizes a Newton-Raphson iterative load flow algorithm. Power flow conditions throughout the network are also provided. The computer program is designed for both steady state and transient operation. In the steady state mode, automatic tap changing of primary distribution transformers is incorporated. Under transient conditions, such as motor starts etc., it is assumed that tap changing is not accomplished so that transformer secondary voltage is allowed to sag.

Source record↗
NASA NTRS1977

Fast methods incorporating direct elliptic solvers for nonlinear applications in fluid dynamics

Semidirect methods are discussed, their present role, as well as some developments for their application in computational fluid dynamics. A semidirect method is a computational scheme that uses a fast, direct, elliptic solver as the driving algorithm for the iterative solution of finite difference equations. Specific subtopics include: (1) direct Cauchy Riemann solvers for first order elliptic equations; (2) application of the semidirect method to the mixed elliptic hyperbolic problem of steady, inviscid transonic flow; and (3) the treatment of interior conditions, such as those on an airfoil or wing, in semidirect methods.

Martin, E. D.↗
NASA NTRS1982

Profiles of electrified drops and bubbles

Axisymmetric equilibrium shapes of conducting drops and bubbles, (1) pendant or sessile on one face of a circular parallel-plate capacitor or (2) free and surface-charged, are found by solving simultaneously the free boundary problem consisting of the augmented Young-Laplace equation for surface shape and the Laplace equation for electrostatic field, given the surface potential. The problem is nonlinear and the method is a finite element algorithm employing Newton iteration, a modified frontal solver, and triangular as well as quadrilateral tessellations of the domain exterior to the drop in order to facilitate refined analysis of sharply curved drop tips seen in experiments. The stability limit predicted by this computer-aided theoretical analysis agrees well with experiments.

Basaran, O. A.↗
NASA NTRS1985

PISCES: An environment for parallel scientific computation

The parallel implementation of scientific computing environment (PISCES) is a project to provide high-level programming environments for parallel MIMD computers. Pisces 1, the first of these environments, is a FORTRAN 77 based environment which runs under the UNIX operating system. The Pisces 1 user programs in Pisces FORTRAN, an extension of FORTRAN 77 for parallel processing. The major emphasis in the Pisces 1 design is in providing a carefully specified virtual machine that defines the run-time environment within which Pisces FORTRAN programs are executed. Each implementation then provides the same virtual machine, regardless of differences in the underlying architecture. The design is intended to be portable to a variety of architectures. Currently Pisces 1 is implemented on a network of Apollo workstations and on a DEC VAX uniprocessor via simulation of the task level parallelism. An implementation for the Flexible Computing Corp. FLEX/32 is under construction. An introduction to the Pisces 1 virtual computer and the FORTRAN 77 extensions is presented. An example of an algorithm for the iterative solution of a system of equations is given. The most notable features of the design are the provision for several granularities of parallelism in programs and the provision of a window mechanism for distributed access to large arrays of data.

Pratt, T. W.↗
NASA NTRS1983

A fast approach to identification using deconvolution

In this paper, we propose a fast approach to impulse response and noise-variance identification for a finite-order, linear, time-invariant, single-input/single-output system, whose input driving noise is white (stationary or nonstationary) and measurement noise is stationary, white and Gaussian. Our algorithm is an iterative block component method that includes two stages, deconvolution and prediction-error identification. Experiences with our method indicate that it works well and saves about an order of magnitude in computation. Analyses and examples are given in this paper to support this claim.

Chi, C.-Y.↗
NASA NTRS1988

A Generalized Method for Automatic Downhand and Wirefeed Control of a Welding Robot and Positioner

A generalized method for controlling a six degree-of-freedom (DOF) robot and a two DOF positioner used for arc welding operations is described. The welding path is defined in the part reference frame, and robot/positioner joint angles of the equivalent eight DOF serial linkage are determined via an iterative solution. Three algorithms are presented: the first solution controls motion of the eight DOF mechanism such that proper torch motion is achieved while minimizing the sum-of-squares of joint displacements; the second algorithm adds two constraint equations to achieve torch control while maintaining part orientation so that welding occurs in the downhand position; and the third algorithm adds the ability to control the proper orientation of a wire feed mechanism used in gas tungsten arc (GTA) welding operations. A verification of these algorithms is given using ROBOSIM, a NASA developed computer graphic simulation software package design for robot systems development.

Fernandez, Ken↗
NASA NTRS1987

Design of transonic airfoils and wings using a hybrid design algorithm

A method has been developed for designing airfoils and wings at transonic speeds. It utilizes a hybrid design algorithm in an iterative predictor/corrector approach, alternating between analysis code and a design module. This method has been successfully applied to a variety of airfoil and wing design problems, including both transport and highly-swept fighter wing configurations. An efficient approach to viscous airfoild design and the effect of including static aeroelastic deflections in the wing design process are also illustrated.

Campbell, Richard L.↗
NASA NTRS1988

Image segmentation by iterative parallel region growing with application to data compression and image analysis

Image segmentation can be a key step in data compression and image analysis. However, the segmentation results produced by most previous approaches to region growing are suspect because they depend on the order in which portions of the image are processed. An iterative parallel segmentation algorithm avoids this problem by performing globally best merges first. Such a segmentation approach, and two implementations of the approach on NASA's Massively Parallel Processor (MPP) are described. Application of the segmentation approach to data compression and image analysis is then described, and results of such application are given for a LANDSAT Thematic Mapper image.

Tilton, James C.↗
NASA NTRS1989

Least squares restoration of multi-channel images

In this paper, a least squares filter for the restoration of multichannel imagery is presented. The restoration filter is based on a linear, space-invariant imaging model and makes use of an iterative matrix inversion algorithm. The restoration utilizes both within-channel (spatial) and cross-channel information as constraints. Experiments using color images (three-channel imagery with red, green, and blue components) were performed to evaluate the filter's performance and to compare it with other monochrome and multichannel filters.

Chin, Roland T.↗
NASA NTRS1991

Transonic adaptive flutter suppression using approximate unsteady time domain aerodynamics

A digital adaptive controller is applied to the active flutter suppression problem of a wing under time varying flight conditions in subsonic and transonic flow. Linear quadratic controller gain at each time step is obtained using an iterative Riccati solver. The digital adaptive optimal controller is robust with respect to the unknown external loads. Flutter and divergence instabilities are simultaneously suppressed using a trailing-edge control surface and displacement sensing. A new transonic unsteady aerodynamic approximation methodology is developed which enables one to carry out the rapid calculation required for transonic aeroservoelastic applications. This approximation is based on a combination of unsteady subsonic aerodynamics combined with a transonic correction procedure. Aeroservoelastic transient time response is obtained using Roger's approximation, state transition matrices and an iterative time marching algorithm. The aeroservoelastic system in the time domain is modeled using a deterministic ARMA model together with a parameter estimator. Transonic flutter boundaries of a wing structure are computed, in the time domain, using an estimated aeroelastic system matrix and are in good agreement with experimental data for the low transonic Mach number range.

Pak, Chan-Gi↗
NASA NTRS1993

Sand transport on Mars: Preliminary results from models

Most studies of active aeolian processes on Mars have focused on dust, i.e., particles approximately 1 micron in diameter that are transported in suspension by wind. The presence of sand dunes on Mars indicates that larger grains (approximately greater than 60 microns, transported primarily in saltation) are also present. Although indirect evidence suggests that some dunes may be active, definitive evidence is lacking. Nonetheless, numerous studies demonstrate that sand is substantially easier to transport by wind than dust, and it is reasonable to infer that sand transportation in saltation occurs under present Martian conditions. In order to assess potential source regions, transportation pathways, and sites of deposition for sand on Mars, an iterative sand transport algorithm was developed that is based on the Mars General Circulation Model of Pollack et al. The results of the dust transport model are then compared with observed surface features, such as dune field locations observed on images, and surficial deposits as inferred from Viking IRTM observations. Preliminary results suggest that the north polar dune fields in the vicinity of 270 degrees W, 70 degrees N originated from weathered polar layered plains centered at 280 degrees W, 85 degrees N, and that Thaumasia Fossae, southern Hellas Planitia, and the area west of Hellespontus Montes are sand depositional sites. Examples of transportation 'corridors' include a westward pathway in the latitudinal band 35 degrees N to 45 degrees N, and a pathway southward from Solis Planum to Thaumasia Fossae, among others.

Greeley, R.↗
NASA NTRS1993

A global approach to kinematic path planning to robots with holonomic and nonholonomic constraints

Robots in applications may be subject to holonomic or nonholonomic constraints. Examples of holonomic constraints include a manipulator constrained through the contact with the environment, e.g., inserting a part, turning a crank, etc., and multiple manipulators constrained through a common payload. Examples of nonholonomic constraints include no-slip constraints on mobile robot wheels, local normal rotation constraints for soft finger and rolling contacts in grasping, and conservation of angular momentum of in-orbit space robots. The above examples all involve equality constraints; in applications, there are usually additional inequality constraints such as robot joint limits, self collision and environment collision avoidance constraints, steering angle constraints in mobile robots, etc. The problem of finding a kinematically feasible path that satisfies a given set of holonomic and nonholonomic constraints, of both equality and inequality types is addressed. The path planning problem is first posed as a finite time nonlinear control problem. This problem is subsequently transformed to a static root finding problem in an augmented space which can then be iteratively solved. The algorithm has shown promising results in planning feasible paths for redundant arms satisfying Cartesian path following and goal endpoint specifications, and mobile vehicles with multiple trailers. In contrast to local approaches, this algorithm is less prone to problems such as singularities and local minima.

Divelbiss, Adam↗