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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
NASA NTRS1975

A study of the effects of vertical resolution and measurement errors on an iteratively inverted temperature profile

A direct inversion method for inverting the temperature profile from satellite-measured radiation is discussed. The nth power of the weighting function in the integral radiative-transfer equation is used as the weight in the averaging process. The vertical resolution of the inverted temperature profile and the response of the inverted temperature profile to the measurement errors are examined in terms of n. It is found that for smaller values of n, the vertical resolution and the effect of measurement errors are reduced. When n = 0, both the vertical resolution and error effect are minimum. The temperature profile is adjusted by a constant; any structure different from the initial shape cannot be resolved. This is equivalent to the case where the entire atmosphere is treated as one layer with a fixed shape of temperature profile. When n approaches infinity, both the vertical resolution and error effect are maximum. This is equivalent to the case where the entire atmosphere is divided into m (the number of spectral channels) layers. Within each layer, the temperatures are adjusted by a constant, and any structure different from the initial shape cannot be resolved. Also, the shape of the final solution is closer to the initial profile if the value of n is smaller.

Chow, M.-D.↗
NASA NTRS1972

Computer program documentation: ISOCLS iterative self-organizing clustering program, program C094

The author has identified the following significant results. This program implements an algorithm which, ideally, sorts a given set of multivariate data points into similar groups or clusters. The program is intended for use in the evaluation of multispectral scanner data; however, the algorithm could be used for other data types as well. The user may specify a set of initial estimated cluster means to begin the procedure, or he may begin with the assumption that all the data belongs to one cluster. The procedure is initiatized by assigning each data point to the nearest (in absolute distance) cluster mean. If no initial cluster means were input, all of the data is assigned to cluster 1. The means and standard deviations are calculated for each cluster.

Minter, R. T.↗
NASA NTRS1983

Parallel architectures for iterative methods on adaptive, block structured grids

A parallel computer architecture well suited to the solution of partial differential equations in complicated geometries is proposed. Algorithms for partial differential equations contain a great deal of parallelism. But this parallelism can be difficult to exploit, particularly on complex problems. One approach to extraction of this parallelism is the use of special purpose architectures tuned to a given problem class. The architecture proposed here is tuned to boundary value problems on complex domains. An adaptive elliptic algorithm which maps effectively onto the proposed architecture is considered in detail. Two levels of parallelism are exploited by the proposed architecture. First, by making use of the freedom one has in grid generation, one can construct grids which are locally regular, permitting a one to one mapping of grids to systolic style processor arrays, at least over small regions. All local parallelism can be extracted by this approach. Second, though there may be a regular global structure to the grids constructed, there will be parallelism at this level. One approach to finding and exploiting this parallelism is to use an architecture having a number of processor clusters connected by a switching network. The use of such a network creates a highly flexible architecture which automatically configures to the problem being solved.

Gannon, D.↗
NASA NTRS1983

Iterative optimal subcritical aerodynamic design code including profile drag

A subcritical aerodynamic design computer code has been developed, which uses linearized aerodynamics along with sweep theory and airfoil data to obtain minimum total drag preliminary designs for multiple planform configurations. These optimum designs consist of incidence distributions yielding minimum total drag at design values of Mach number and lift and pitching moment coefficients. Linear lofting is used between airfoil stations. Solutions for isolated transport wings have shown that the solution is unique, and that including profile drag effects decreases tip loading and incidence relative to values obtained for minimum induced drag solutions. Further, including effects of variation of profile drag with Reynolds number can cause appreciable changes in the optimal design for tapered wings. Example solutions are also discussed for multiple planform configurations.

Kuhlman, J. M.↗
NASA NTRS1985

Complex symmetric matrices with strongly stable iterates

Complex-valued symmetric matrices are studied. A simple expression for the spectral norm of such matrices is obtained, by utilizing a unitarily congruent invariant form. A sharp criterion is provided for identifying those symmetric matrices whose spectral norm is not exceeding one: such strongly stable matrices are usually sought in connection with convergent difference approximations to partial differential equations. As an example, the derived criterion is applied to conclude the strong stability of a Lax-Wendroff scheme.

Tadmor, E.↗
NASA NTRS1985

Some iterative schemes for transonic potential flows

The minimal residual (MR) method for the numerical solution of transonic potential flows is closely related to the conjugate gradient method, which has found widespread use in the solution of large sparse, symmetric, and positive-definite linear equations. The primary advantage of the MR method is its applicability to both symmetric and nonsymmetric matrices.

Wong, Y. S.↗
NASA NTRS1985

Development of a boundary-layer-type solver based on simultaneous iteration technique for axisymmetric separated flows

A boundary-layer-type solver is developed for the numerical solution of axisymmetric separated flows. A new fully implicit coupling scheme for the viscous and inviscid regions is demonstrated. This fully implicit coupling technique is similar to the work of Carter, Veldman, and an extension of an earlier work of Halim and Hafez. A comparison is made for the convergence rate using this new fully implicit coupling technique and the semiimplicit coupling of Halim and Hafez. Numerical results using the fully implicit coupling are obtained for laminar incompressible separated flows, including a boattail and a series of trough geometries. Also, the near-wake flow problem is considered using the present formulation. A clear conclusion of this investigation is that the present scheme using the fully implicit coupling method converges at a faster rate than the semiimplicit coupling and the partially parabolized Navier-Stokes (PPNS) procedures.

Halim, A. A. M.↗
NASA NTRS1986

Communications oriented programming of parallel iterative solutions of sparse linear systems

Parallel algorithms are developed for a class of scientific computational problems by partitioning the problems into smaller problems which may be solved concurrently. The effectiveness of the resulting parallel solutions is determined by the amount and frequency of communication and synchronization and the extent to which communication can be overlapped with computation. Three different parallel algorithms for solving the same class of problems are presented, and their effectiveness is analyzed from this point of view. The algorithms are programmed using a new programming environment. Run-time statistics and experience obtained from the execution of these programs assist in measuring the effectiveness of these algorithms.

Patrick, M. L.↗
NASA NTRS1987

A quasi-analytical method for non-iterative computation of nonlinear controls

An optimal control solution process was developed for a general class of nonlinear dynamical systems. The method combines control theory, perturbation methods, and Van Loan's recent matrix exponential results. A variety of applications support the practical utility of this method. Nonlinear rigid body optimal maneuvers are routinely solved. Flexible body dynamical systems of an order greater than 40 were solved. The method fails occasionally due to poor convergence of the perturbation expansion or numerical difficulties associated with computing the matrix exponential. The method is attractive because it appears to be a good candidate for semi-automation; no initial guess is required, and it usually converges at 2nd or 3rd order in minutes of machine time.

Junkins, J. L.↗