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 685 records · Page 38

The calculation of electron density profiles from topside ionograms: Method and applications

A method for converting topside sounder ionograms into topside electron density profiles is discussed. The lamination method used is modified to take into account the variation of electron density and magnetic field within each lamination. Also included is a change of variable to produce a finite integrand of the integral involved, an iteration scheme that permits convergence on an initially unknown density, a second iteration scheme to overcome the problem of an uncertainty in the electron density at the satellite, and a modification to compensate for the changing satellite altitude over the duration of the sounding. Two applications of the technique are discussed: field-aligned traces for computing field-aligned profiles and computer-aided systems for scaling ionograms.

Lockwood, G. E. K.↗

An actuator extension transformation for a motion simulator and an inverse transformation applying Newton-Raphson's method

A set of equations which transform position and angular orientation of the centroid of the payload platform of a six-degree-of-freedom motion simulator into extensions of the simulator's actuators has been derived and is based on a geometrical representation of the system. An iterative scheme, Newton-Raphson's method, has been successfully used in a real time environment in the calculation of the position and angular orientation of the centroid of the payload platform when the magnitude of the actuator extensions is known. Sufficient accuracy is obtained by using only one Newton-Raphson iteration per integration step of the real time environment.

Dieudonne, J. E.↗

Davidon-Broyden rank-one minimization methods in Hilbert space with application to optimal control problems

The Davidon-Broyden class of rank one, quasi-Newton minimization methods is extended from Euclidean spaces to infinite-dimensional, real Hilbert spaces. For several techniques of choosing the step size, conditions are found which assure convergence of the associated iterates to the location of the minimum of a positive definite quadratic functional. For those techniques, convergence is achieved without the problem of the computation of a one-dimensional minimum at each iteration. The application of this class of minimization methods for the direct computation of the solution of an optimal control problem is outlined. The performance of various members of the class are compared by solving a sample optimal control problem. Finally, the sample problem is solved by other known gradient methods, and the results are compared with those obtained with the rank one quasi-Newton methods.

Straeter, T. A.↗

Performance Analysis and Design Synthesis (PADS) computer program. Volume 2: Program description, part 2

The QL module of the Performance Analysis and Design Synthesis (PADS) computer program is described. Execution of this module is initiated when and if subroutine PADSI calls subroutine GROPE. Subroutine GROPE controls the high level logical flow of the QL module. The purpose of the module is to determine a trajectory that satisfies the necessary variational conditions for optimal performance. The module achieves this by solving a nonlinear multi-point boundary value problem. The numerical method employed is described. It is an iterative technique that converges quadratically when it does converge. The three basic steps of the module are: (1) initialization, (2) iteration, and (3) culmination. For Volume 1 see N73-13199.

Source record↗

Vibration computer programs E13101, E13102, E13104, and E13112 and application to the NERVA program. Project 187: Methodology documentation

Programs for the analyses of the free or forced, undamped vibrations of one or two elastically-coupled lumped parameter teams are presented. Bearing nonlinearities, casing and rotor distributed mass and elasticity, rotor imbalance, forcing functions, gyroscopic moments, rotary inertia, and shear and flexural deformations are all included in the system dynamics analysis. All bearings have nonlinear load displacement characteristics, the solution is achieved by iteration. Rotor imbalances allowed by such considerations as pilot tolerances and runouts as well as bearing clearances (allowing concail or cylindrical whirl) determine the forcing function magnitudes. The computer programs first obtain a solution wherein the bearings are treated as linear springs of given spring rates. Then, based upon the computed bearing reactions, new spring rates are predicted and another solution of the modified system is made. The iteration is continued until the changes to bearing spring rates and bearing reactions become negligibly small.

Mironenko, G.↗

Application of the method local potential to the analysis of turbulent shear flows

It has been found that, in general, the local potential cannot be employed to obtain approximate solutions for the various correlations of turbulent properties which appear in the time averaged form of the conservation equations. Although the method of local potential is equivalent to the Galerkin method when the self-consistent condition is applied, the local potential can also be applied as an iterative algorithm in place of using the selfconsistent condition. This procedure offers an alternative to the Galerkin method and may be useful in obtaining approximate solutions for the total turbulent velocity. In addition, for certain simple turbulent shear flows the iterative algorithm may permit approximate, but non-empirical, solutions by modeling only the mean velocity and the Reynolds stress.

Reed, T. D.↗

An Evaluation of an Algorithm for Linear Inequalities and Its Applications

An algorithm is presented for obtaining a solution alpha to a set of inequalities (A alpha) 0 where A is an N x m-matrix and alpha is an m-vector. If the set of inequalities is consistant, then the algorithm is guaranteed to arrive at a solution in a finite number of steps. Also, if in the iteration, a negative vector is obtained, then the initial set of inequalities is inconsistant, and the iteration is terminated.

Jurgensen, J.↗

Recent advances in antenna synthesis.

A technique for the synthesis of planar aperture antennas has been developed. It applies equally well to continuous or array type apertures. Patterns with shaped main beams and complex sidelobe structures can be synthesized. The method involves applying corrections iteratively and converging toward the desired pattern. The iteration process terminates when the synthesized pattern approximates the desired pattern to within a specified tolerance. A computer program has been written to perform all calculations. The source distribution which is required to produce the synthesized pattern is provided as output. The method is such that patterns requiring complex source distributions will not be synthesized (such as superdirective patterns).

Stutzman, W. L.↗

Further results on cooling mechanisms for soft X-ray flares

Analysis of data from the soft X-ray proportional counter spectrometer on OSO-4 has been continued along the lines of earlier work. It was noticed that the time profiles of X-ray counts from the OSO-4 instrument's 1 to 3 Angstrom detectors for two events showed a very rapid initial decay after maximum, followed by a much more slowly falling section. At least in the case of the larger of the two events, the change of slope seems quite definitely to be discontinuous. Temperatures and emission measures for both flares have been derived, by fitting an emission function to eight-channel count histograms which form the output of the 1 to 3 Angstrom detectors, analyzed into eight energy intervals by pulse-height analysis. The computer program is described. It employs temperature and continuum emission measures in the Culhane-Acton formula and the flux in the 6.7 KeV iron-line feature as free parameters, adjusting them by small amounts in successive iterations until the original historgram is approximately reproduced. A chi-squared is used to examine the agreement between histograms and terminates the iteration accordingly. Account is taken of the proportional counters' energy resolution in the fitting process.

Craig, I. J. D.↗

An algorithm for a general class of routing problems derived from Huygens' principle

If a set of N points or nodes with a nonnegative cost associated with each ordered pair is known, it is desired to find a path from one given node to another given node which minimizes the cost sum. An algorithm is presented which yields a global minimum solution after at most N - 1 iterations or on a typical large third-generation computer, after 1 hour of computation time for a 10,000-node problem. The rapid-access data storage capacity demanded by the algorithm is approximately 3N words for costs read in from slow-access storage or 2N words for calculable costs. The time-storage requirements of the algorithm known to the authors. When the problem is viewed as a discretized optimal control problem, after N-1 iterations, an optimal control or node transition is established for each of the N nodes or states; thus, the algorithm can be applied to situations were there may be errors in the control that necessitate a closed loop control that necessitate a closed loop control philosophy.

Avis, L. M.↗

A criterion based on an information theoretic measure for goodness of fit between classifier and data base

A criterion for characterizing an iteratively trained classifier is presented. The criterion is based on an information theoretic measure that is developed from modeling classifier training iterations as a set of cascaded channels. The criterion is formulated as a figure of merit and as a performance index to check the appropriateness of application of the characterized classifier to an unknown data base and for implementing classifier updates and data selection respectively.

Eigen, D. J.↗

Adjustment technique without explicit formation of normal equations /conjugate gradient method/

For a simultaneous adjustment of a large geodetic triangulation system, a semiiterative technique is modified and used successfully. In this semiiterative technique, known as the conjugate gradient (CG) method, original observation equations are used, and thus the explicit formation of normal equations is avoided, 'huge' computer storage space being saved in the case of triangulation systems. This method is suitable even for very poorly conditioned systems where solution is obtained only after more iterations. A detailed study of the CG method for its application to large geodetic triangulation systems was done that also considered constraint equations with observation equations. It was programmed and tested on systems as small as two unknowns and three equations up to those as large as 804 unknowns and 1397 equations. When real data (573 unknowns, 965 equations) from a 1858-km-long triangulation system were used, a solution vector accurate to four decimal places was obtained in 2.96 min after 1171 iterations (i.e., 2.0 times the number of unknowns).

Saxena, N. K.↗

A generalized-capacity-matrix technique for computing aerodynamic flows

A numerical generalized-capacity-matrix technique is developed for application to aerodynamic flow computations. This technique allows the very fast direct (noniterative) numerical elliptic solvers to be used in problems with arbitrary internal boundaries and with a wide class of boundary conditions, including numerical application of the Kutta condition on an airfoil without iteration. Accuracy, speed, and usefulness of the technique are demonstrated with linear problems for potential flows over airfoil shapes. The method's main advantages, however, can be exploited within iterative procedures for a variety of complex flow problems governed by systems of equations not necessarily elliptic or linear.

Martin, E. D.↗

A criterion based on an information theoretic measure for goodness of fit between classifier and data base

A criterion for characterizing an iteratively trained classifier is presented. The criterion is based on an information theoretic measure that is developed from modeling classifier training iterations as a set of cascaded channels. The criterion is formulated as a figure of merit and as a performance index to check the appropriateness of application of the characterized classifier to an unknown data base and for implementing classifier updates and data selection, respectively.

Eigen, D. J.↗

Techniques for trajectory optimization using a hybrid computer

The use of a hybrid computer in the solution of trajectory optimization problems is described. The solution technique utilizes the indirect method and requires iterative computation of the initial condition vector of the co-state variables. Convergence of the iteration is assisted by feedback switching and contour modification. A simulation of the method in an on-line updating scheme is presented.

Neely, P. L.↗

Further examination of pilot instrument scanning data and development of a new link value estimator

Pilot instrument scanning data collected during simulated transport instrument landing approaches is examined. Deterministic features of random pilot instrument scanning behavior are confirmed to be: transitions in point of eye fixation which originate and terminate on the same instrument are rare; and transitions in point of eye fixation which originate on one secondary instrument and terminate on another secondary instrument are rare. Link value estimators are developed using statistics and these experimental facts. The result has a special significance when there is but a single primary instrument, a flight director. The result is used to simplify the iterative computational procedure of STI's display theory to a non-iterative procedure for the flight director case.

Hofmann, L. G.↗

Quasi-perfect FIFO: Synchronous or asynchronous with application in controller design for the UNICON laser memory

The first-in-first-out memory buffer (FIFO), is an elastic digital memory whose main application is in data buffering between devices operating at different rates. Data written into the top is moved autonomously down toward the bottom of the FIFO to the lowest unoccupied location, and data read from the bottom of the FIFO will cause data from the top to move autonomously down toward the bottom. The FIFO is available in MOS LSI asynchronous form with data rate in the 1 MHz region. The FIFO described yields a simple high-speed iterative implementation, either synchronous of asynchronous. Because of this simple iterative structure, the FIFO is expandable in both number of words and bits per word, and it is attractive from the viewpoint of integrated-circuit production. For the synchronous FIFO, a model was built and successfully used in the controller for the UNICON laser memory. For the asynchronous FIFO, a model was built and also successfully used in a high-performance magnetic tape controller.

Lim, R. S.↗

On the variational equations for Householder transformations in feature selection

Results that suggest the possibility of using a sequential monotone process for solving the feature selection problem using Householder transformations are applied to the divergence separability criterion and an expression for the gradient of the divergence with respect to the generator of a single Householder transformation will be developed. This expression for the gradient is used in any number of differential correction schemes (iterators) that attempt to extremize the divergence. Data sets provided by the Earth Observations Division-JSC are used to demonstrate selecting the Householder transformations that generate the kxn matrix defining the best (in the sense of extremizing the divergence) k linear combinations of features. The tests allow initial comparisons to be made with results. In particular, this technique does not appear to require initial guesses for the iterator to be generated without replacement, exhaustive search, or other similar schemes.

Decell, H. P., Jr.↗