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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1971

An iterative clustering procedure

Iterative clustering technique for minimizing probability of differences between binary data reconstructions from cluster codes and initial data

Dinstein, I.↗
NASA NTRS1971

Iterative computation of generalized inverses, with an application to CMG steering laws

A cubically convergent iterative method for computing the generalized inverse of an arbitrary M X N matrix A is developed and a FORTRAN subroutine by which the method was implemented for real matrices on a CDC 3200 is given, with a numerical example to illustrate accuracy. Application to a redundant single-gimbal CMG assembly steering law is discussed.

Steincamp, J. W.↗
NASA NTRS1972

Transient, compressible heat and mass transfer in porous media using the strongly implicit iteration procedure.

Coupled nonlinear partial differential equations describing heat and mass transfer in a porous matrix are solved in finite difference form with the aid of a new iterative technique (the strongly implicit procedure). Example numerical results demonstrate the characteristics of heat and mass transport in a porous matrix such as a charring ablator. It is emphasized that multidimensional flow must be considered when predicting the thermal response of a porous material subjected to nonuniform boundary conditions.

Curry, D. M.↗
NASA NTRS1972

Applications of partial orderings to the study of positive definiteness, monotonicity, and convergence of iterative methods for linear systems.

Most of the known results concerning convergence of iterative methods for solving linear systems involve either positive definiteness or monotonicity. In this paper a new concept, called K-semipositivity, is introduced, which provides a link between convergence theory, monotonicity, and positive definiteness. By using this concept, together with partial orderings in Euclidean n-space, several new convergence theorems are proved. Application to Jacobi's methods and the theory of regular splittings shows the usefulness of these new results.

Vandergraft, J. S.↗
NASA NTRS1972

Limb radiance inversion: Iterative convergence for a nonlinear kernal

The features of the limb inversion problem that differentiate it from the nadir problem are described; the most important of these are the sharply peaked weighting functions and the nonlinear kernel that arises because the atmosphere is required to be in hydrostatic balance. The problem may be split into two parts: given the pressure at one level and the measured radiances, can the temperatures be retrieved? And how can the pressure be obtained at one level? The second problem is shown to depend on the first, which is solved iteratively. The convergence properties and final accuracies are presented. Inversion to obtain trace constituents is briefly discussed.

Gille, J. C.↗
NASA NTRS1972

The solution of the relaxation problem for the Boltzmann equation by the integral iteration method

The Boltzmann equation is considered in terms of the problem of relaxation of some initial distribution function which depends only on velocities, to Maxwell's distribution function. The Boltzmann equation is given for the relaxation problem in which the distribution function f(t, u, v) is time dependent and is also dependent on two other variables u and v (the velocities of rigid spherical molecules). An iteration process is discussed in which the velocity space u, v is subdivided into squares, the distribution function in each square being approximated by the second-order surface from the values of the distribution function at nine points. The set of all of these points forms a network of u, v values at the nodes of which the distribution function can be found.

Limar, Y. F.↗
NASA NTRS1973

Rapid iterative reanalysis for automated design

A method for iterative reanalysis in automated structural design is presented for a finite-element analysis using the direct stiffness approach. A basic feature of the method is that the generalized stiffness and inertia matrices are expressed as functions of structural design parameters, and these generalized matrices are expanded in Taylor series about the initial design. Only the linear terms are retained in the expansions. The method is approximate because it uses static condensation, modal reduction, and the linear Taylor series expansions. The exact linear representation of the expansions of the generalized matrices is also described and a basis for the present method is established. Results of applications of the present method to the recalculation of the natural frequencies of two simple platelike structural models are presented and compared with results obtained by using a commonly applied analysis procedure used as a reference. In general, the results are in good agreement. A comparison of the computer times required for the use of the present method and the reference method indicated that the present method required substantially less time for reanalysis. Although the results presented are for relatively small-order problems, the present method will become more efficient relative to the reference method as the problem size increases. An extension of the present method to static reanalysis is described, ana a basis for unifying the static and dynamic reanalysis procedures is presented.

Bhatia, K. G.↗
NASA NTRS1973

Comments on 'An iterative clustering procedure.'

The limitation of the iterative clustering procedure proposed by Haralick and Dinstein is indicated with the help of two examples and is construed as the effect of the linear structure of the T transformation.

Kan, E. P. F.↗