Search NASA⌕ Search

SEARCH · Search NASA

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

An iterative algorithm for decoding block codes transmitted over a memoryless channel

An algorithm was developed which optimally decodes a block code for minimum probability of symbol error in an iterative manner. The initial estimate is made by looking at each bit independently and is improved by considering bits related to it through the parity check equations. The dependent bits are considered in order of interesting probability of error. Since the computation proceeds in a systematic way with the bits having the greatest effect being used first, the algorithm approaches the optimum estimate after only a fraction of the parity check equations were used.

Greenberger, H. J.↗
NASA NTRS1978

The CLASSY clustering algorithm: Description, evaluation, and comparison with the iterative self-organizing clustering system (ISOCLS)

A clustering method, CLASSY, was developed, which alternates maximum likelihood iteration with a procedure for splitting, combining, and eliminating the resulting statistics. The method maximizes the fit of a mixture of normal distributions to the observed first through fourth central moments of the data and produces an estimate of the proportions, means, and covariances in this mixture. The mathematical model which is the basic for CLASSY and the actual operation of the algorithm is described. Data comparing the performances of CLASSY and ISOCLS on simulated and actual LACIE data are presented.

Lennington, R. K.↗
NASA NTRS1979

A new boundary-layer inviscid iteration technique for separated flow

A new viscous-inviscid iteration procedure is presented which is applicable to separated flows. The new procedure is simple, converges rapidly, and does not require numerical smoothing, at least in the cases computed thus far. Calculations are presented for both incompressible and compressible separated flow in the juncture region between an axisymmetric body and sting. The viscous computation is obtained with a recently developed inverse boundary-layer procedure which is no more complicated than a standard direct finite-difference boundary-layer technique. The inviscid computation is made with an axisymmetric transonic code called RAXBOD, in which surface injection is used to represent the viscous effects.

Carter, J. E.↗
NASA NTRS1980

Modified Iterative Extended Hueckel. 2: Application to the interaction of Na(+), Na(+)(aq.), Mg(+)-2(aq.) with adenine and thymine

Modified Iterative Extended Hueckel, which includes explicit effective internuclear and electronic interactions, is applied to the study of the energetics of Na(+),Mg(+), Na(+) (aqueous), and Mg(+2) (aqueous) ions approaching various possible binding sites on adenine and thymine. Results for the adenine + ion and thymine + ion are in good qualitative agreement with ab initio work on analogous systems. Energy differences between competing sites are in excellent agreement. Hydration appears to be a critical factor in determining favorable binding sites. That the adenine Nl and N3 sites cannot displace a water molecule from the hydrated cation indicates that they are not favorable binding sites in aqueous media. Of those sites investigated, 04 was the most favorable binding site on the thymine for the bare Na(+). However, the 02 site was the most favorable binding site for either hydrated cation.

Aronowitz, S.↗
NASA NTRS1980

Behavior of molecules on interstellar grains - Application of the Langevin equation and iterative extended Hueckel

The Langevin equation was used to explore an adsorbate desorption mechanism. Calculations were performed using iterative extended Hueckel on a silica model site with various small adsorbates, e.g., H, CH, OH, NO, CO. It was found that barriers to free traversal from one site to another are substantial (about 3-10 eV). A bootstrap desorption mechanism for some molecules in the process of forming at a site also became apparent from the calculations. The desorption mechanisms appear to be somewhat balanced by a counterforce - the attraction of sites for the newly desorbed molecule. The order of attraction to a silica grain site for the diatomic molecules considered was OH greater than CH greater than CO greater than NO, when these entities were sufficiently distant. The nature of the silica grain and that of the 'cold' desorption mechanism, when considered together, suggest that the abundance of very small grains might be less common than anticipated.

Aronowitz, S.↗
NASA NTRS1981

Iterative optical vector-matrix processors (survey of selected achievable operations)

An iterative optical vector-matrix multiplier with a microprocessor-controlled feedback loop capable of performing a wealth of diverse operations was described. A survey and description of many of its operations demonstrates the versatility and flexibility of this class of optical processor and its use in diverse applications. General operations described include: linear difference and differential equations, linear algebraic equations, matrix equations, matrix inversion, nonlinear matrix equations, deconvolution and eigenvalue and eigenvector computations. Engineering applications being addressed for these different operations and for the IOP are: adaptive phased-array radar, time-dependent system modeling, deconvolution and optimal control.

Casasent, D.↗
NASA NTRS1981

Eigenvector determination by iterative optical methods

Three power algorithms are considered by which an iterative optical processor can be used to compute the eigenvalues and eigenvectors of a matrix. The algorithms are appropriate for three applications: (1) calculating the largest eigenvalue; (2) calculating the eigenvalues in order of decreasingly dominant eigenvalues; and (3) calculating the eigenvector whose eigenvalue is closest to a given value.

Vijaya Kumar, B. V. K.↗
NASA NTRS1982

Comparison of starting values for iterative solutions to a universal Kepler's equation

General starting values for the iterative numerical solution of a universal Kepler's equation for position in a conic orbit at a specified time are investigated. Three starting values based on recent refinements of previously obtained bounds on the solution are derived and tested numerically. Of these, a simple starting value based on a cubic approximation to Kepler's equation provides the most rapid convergence using both first and second order Newton algorithms. The performance of the starting values are compared with similar studies which used the restricted case of elliptical orbits with the initial epoch at periapse.

Bergam, M. J.↗
NASA NTRS1982

An iterative radiative transfer code for ocean-atmosphere systems

The details of an iterative radiative transfer code for computing the intensity and degree of polarization of diffuse radiation in models of the ocean-atmosphere system are described. The present code neglects the upwelling radiation from below the ocean surface and as such can be applied to the part of the spectrum where the absorption by water is strong. To establish the reliability of the numerical scheme and the computer code, the results are compared with those of Fraser and Walker (1968), Dave (1972), and Mullamaa (1964); they are found to be in excellent agreement. The computations also show that both the intensity and the degree of polarization of the upwelling diffuse radiation at the top of the atmosphere vary significantly when the rough ocean at the base of the atmosphere is replaced by a Lambertian surface that reflects the same energy as the rough ocean.

Ahmad, Z.↗
NASA NTRS1982

Iterative algorithms for large sparse linear systems on parallel computers

Algorithms for assembling in parallel the sparse system of linear equations that result from finite difference or finite element discretizations of elliptic partial differential equations, such as those that arise in structural engineering are developed. Parallel linear stationary iterative algorithms and parallel preconditioned conjugate gradient algorithms are developed for solving these systems. In addition, a model for comparing parallel algorithms on array architectures is developed and results of this model for the algorithms are given.

Adams, L. M.↗
NASA NTRS1982

Iterative spectral methods and spectral solutions to compressible flows

A spectral multigrid scheme is described which can solve pseudospectral discretizations of self-adjoint elliptic problems in O(N log N) operations. An iterative technique for efficiently implementing semi-implicit time-stepping for pseudospectral discretizations of Navier-Stokes equations is discussed. This approach can handle variable coefficient terms in an effective manner. Pseudospectral solutions of compressible flow problems are presented. These include one dimensional problems and two dimensional Euler solutions. Results are given both for shock-capturing approaches and for shock-fitting ones.

Hussaini, M. Y.↗
NASA NTRS1983

Frequency-multiplexed and pipelined iterative optical systolic array processors

Optical matrix processors using acoustooptic transducers are described, with emphasis on new systolic array architectures using frequency multiplexing in addition to space and time multiplexing. A Kalman filtering application is considered in a case study from which the operations required on such a system can be defined. This also serves as a new and powerful application for iterative optical processors. The importance of pipelining the data flow and the ordering of the operations performed in a specific application of such a system are also noted. Several examples of how to effectively achieve this are included. A new technique for handling bipolar data on such architectures is also described.

Casasent, D.↗
NASA NTRS1984

Adapting iterative algorithms for solving large sparse linear systems for efficient use on the CDC CYBER 205

Adapting and designing mathematical software to achieve optimum performance on the CYBER 205 is discussed. Comments and observations are made in light of recent work done on modifying the ITPACK software package and on writing new software for vector supercomputers. The goal was to develop very efficient vector algorithms and software for solving large sparse linear systems using iterative methods.

Kincaid, D. R.↗
NASA NTRS1984

A model of asynchronous iterative algorithms for solving large, sparse, linear systems

Solving large, sparse, linear systems of equations is one of the fundamental problems in large scale scientific and engineering computation. A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. This model is then analyzed to determine the expected intertask data transfer and task computational complexity as functions of the number of tasks. Based on the analysis, recommendations for task partitioning are made. These recommendations are a function of the sparseness of the linear system, its structure (i.e., randomly sparse or banded), and dimension.

Reed, D. A.↗
NASA NTRS1984

Surface diagnosis of large reflector antennas using microwave holographic metrology - An iterative approach

The radiation pattern of an antenna can be significantly affected by reflector surface errors. A minimization of losses due to surface inaccuracies is, therefore, required. A suitable procedure for the determination of the deviations of the surface from its ideal geometry is based on the microwave holographic technique. In this procedure, the complex pattern of the antenna is measured, and the Fourier transform relationship, existing between the radiation pattern and the function related to the current distribution on the reflector surface, is applied. It is naturally desirable to limit the amount of measured data. The present investigation is concerned with the concept of the Fourier transform relationship between the induced current and the far field. It is demonstrated that the relationship, in general, can be interpreted as a summation of many Fourier transforms. An iterative scheme is employed to continue the far-field pattern outside the measurement window.

Rahmat-Samii, Y.↗
NASA NTRS1984

Augmented weak forms and element-by-element preconditioners: Efficient iterative strategies for structural finite elements. A preliminary study

A weak formulation in structural analysis that provides well conditioned matrices suitable for iterative solutions is presented. A mixed formulation ensures the proper representation of the problem and the constitutive relations are added in a penalized form. The problem is solved by a double conjugate gradient algorithm combined with an element by element approximate factorization procedure. The double conjugate gradient strategy resembles Uzawa's variable-length type algorithms the main difference is the presence of quadratic terms in the mixed variables. In the case of shear deformable beams these terms ensure that the proper finite thickness solution is obtained.

Muller, A.↗
NASA NTRS1984

Parallel, iterative solution of sparse linear systems: Models and architectures

A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication. The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed.

Reed, D. A.↗