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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
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.↗
NASA NTRS1986

Solution of separated flows using a simultaneous iteration technique

Generalization and improvement of an earlier work developed for studying separated flows using boundary layer type equations are presented. The improvements include extensions to a general coordinate system and use of a more general zonal technique for solving the coupled equations. In order to be able to consider arbitrary geometries, second order accurate (in space) conservative differences are generated by considering the integral formulation of the governing equations in a general coordinate system. The general coordinate system is handled in as general a manner as possible to allow for the use of either analytically or numerically generated coordinate systems. A marching procedure was used for solving the Partially Parabolized Navier-Stokes (PPNS) equations in the viscous region coupled in a fully implicit manner with the elliptic inviscid equation. To test the algorithm and compare to other solutions, solutions for flow over a flat plate and flow past the symmetrical 12 percent thick Joukowski airfoil (J012) at zero angle of attack were presented.

Source record↗
NASA NTRS1988

A constitutive material model for nonlinear finite element structural analysis using an iterative matrix approach

A unified numerical method for the integration of stiff time dependent constitutive equations is presented. The solution process is directly applied to a constitutive model proposed by Bodner. The theory confronts time dependent inelastic behavior coupled with both isotropic hardening and directional hardening behaviors. Predicted stress-strain responses from this model are compared to experimental data from cyclic tests on uniaxial specimens. An algorithm is developed for the efficient integration of the Bodner flow equation. A comparison is made with the Euler integration method. An analysis of computational time is presented for the three algorithms.

Koenig, Herbert A.↗
NASA NTRS1988

Iterative finite element solver on transputer networks

The parallelism inherent in the Conjugate Gradient method is described. The initial results of a parallel implementation on a network of twelve transputers are discussed. The high efficiencies obtained indicate that significant speedup can be obtained with larger transputer arrays if communication overhead can be kept low. To this end, a method of communication that allows large, dynamically reconfigurable transputer arrays to exchange data in log sub 4 N steps for N processors is suggested.

Danial, Albert↗
NASA NTRS1988

Response function of a tunable diode laser spectrometer from an iterative deconvolution procedure

A deconvolution procedure commonly used for resolution enhancement of spectra has been applied to the determination of the response function of a tunable diode laser spectrometer. The method is sufficiently fast and simple for routine application when correcting for nonnegligible instrumental broadening. Absolute linestrengths of CH4 in the 1327/cm region and line positions of HNO3 in the 1335/cm region, measured with the aid of the deconvolution technique, are reported here.

May, Randy D.↗
NASA NTRS1990

An iterative algorithm combining model reduction and control design

A design strategy which integrates model reduction by modal cost analysis and a multiobjective controller design is proposed. The necessary modeling and control algorithms are easily programmed in Matlab standard software. Hence, this method is very practical for controller design for large space structures. The design algorithm also solves the very important problem of tuning multiple loop controllers (multi-input, multi-output, or MIMO). Instead of the single gain change that is used in standard root locus and gain and phase margin theories, this method tunes multiple loop controllers from low to high gain in a systematic way in the design procedure. This design strategy is applied to NASA's Mini-Mast system.

Hsieh, C.↗
NASA NTRS1990

An improved Newton iteration for the generalized inverse of a matrix, with applications

The purpose here is to clarify and illustrate the potential for the use of variants of Newton's method of solving problems of practical interest on highly personal computers. The authors show how to accelerate the method substantially and how to modify it successfully to cope with ill-conditioned matrices. The authors conclude that Newton's method can be of value for some interesting computations, especially in parallel and other computing environments in which matrix products are especially easy to work with.

Pan, Victor↗
NASA NTRS1992

An iterative implicit DDADI algorithm for solving the Navier-Stokes equation

An algorithm utilizing a first order upwind split flux technique and the diagonally dominant treatment is proposed to be the temporal operator for solving the Navier-Stokes equations. Given the limit of a five point stencil, the right hand side flux derivatives are formulated by several commonly used central and upwind schemes. Their performances are studied through a test case of free vortex convection in a uniform stream. From these results, a superior treatment for evaluating the flux term is proposed and compared with the rest. The application of the proposed algorithm to the full Navier-Stokes equations is demonstrated through a calculation of flow over a backward facing step. Results are compared against the calculation done by using the fourth order central differencing scheme with artificial damping.

Chen, S. C.↗
NASA NTRS1992

Development of iterative techniques for the solution of unsteady compressible viscous flows

A research effort was initiated at Georgia Tech in February 1991 on the development of efficient techniques for the computation of 2-D and 3-D unsteady compressible flow problems. It was found that in 2-D unsteady viscous flow applications, the generalized minimal residual (GMRES) scheme was able to significantly improve the accuracy and stability characteristics of an existing 2-D ADI (Alternating Direction Implicit) time marching scheme. That is, the GMRES/ADI combination allowed 10 to 20 times larger time steps compared to an ADI scheme. Because the GMRES algorithm requires 5 to 10 times the CPU work compared to the ADI scheme, the combined GMRES/ADI scheme yields a net factor of 2 savings in CPU cost. During the past year, we also experimented with GMRES/multigrid/ADI combination. The purpose of this combination was to compute the low frequency components of the change in the flow properties from one time step to the next on a coarse grid. This strategy reduces the memory requirements of the GMRES method roughly by a factor of 4-8 for steady flow problems.

Sankar, Lakshmi N.↗
NASA NTRS1992

Mesh generation/refinement using fractal concepts and iterated function systems

A novel method of mesh generation is proposed which is based on the use of fractal concepts to derive contractive, affine transformations. The transformations are constructed in such a manner that the attractors of the resulting maps are a union of the points, lines and surfaces in the domain. In particular, the mesh nodes may be generated recursively as a sequence of points which are obtained by applying the transformations to a coarse background mesh constructed from the given boundary data. A Delaunay triangulation or similar edge connection approach can then be performed on the resulting set of nodes in order to generate the mesh. Local refinement of an existing mesh can also be performed using the procedure. The method is easily extended to three dimensions, in which case the Delaunay triangulation is replaced by an analogous 3D tesselation.

Bova, S. W.↗
NASA NTRS1990

Hierarchical approach to reconstruct surfaces by using iteratively rectified imagery

A new approach to reconstruct the 3D surface of the object space from digital images is described. All the object points obtained by an automatic orientation procedure lead to a first approximation of the surface. Edges are computed for one image and matched to the other image by grey level correlation or least-squares matching through the scale space. To every discrete step in the scale space there exists the digital stereopair (image pyramid), the corresponding surface digital elevation model (DEM), and the warped images. The warped images in this discrete scale space representation correspond to digital orthophotos obtained from the DEMs that result from matching the image pyramid. The warped images will be used on every successive level in the image pyramid in order to reduce the foreshortening problems associated with any area-based matching method.

Schenk, Toni↗
NASA NTRS1992

Iterative refinement scheduling

We present a heuristics-based approach to deep space mission scheduling which is modeled on the approach used by expert human schedulers in producing schedules for planetary encounters. New chronological evaluation techniques are used to focus the search by using information gained during the scheduling process to locate, classify, and resolve regions of conflict. Our approach is based on the assumption that during the construction of a schedule there exist several disjunct temporal regions where the demand for one resource type or a single temporal constraint dominates (bottleneck regions). If the scheduler can identify these regions and classify them based on their dominant constraint, then the scheduler can select the scheduling heuristic.

Biefeld, Eric↗
NASA NTRS1991

A non-iterative method for computing the infimum in H(infinity)-optimization

The authors, as an extension of their earlier work, present a simple noniterative procedure for the computation of the exact value of the infimum in the singular H(infinity)-optimization problem and is an extension of their earlier work. The problem formulation is general and does not place any restrictions on the direct feedthrough terms between the disturbance input and the measurement output variables. The method is applicable to a class of singular H(infinity)-optimization problems for which the transfer functions from the control input to the controlled output and from the disturbance input to the measurement output have no invariant zeros on the j-omega axis and also satisfy certain geometric conditions.

Chen, Ben M.↗
NASA NTRS1992

Complex generalized minimal residual algorithm for iterative solution of quantum-mechanical reactive scattering equations

Complex dense matrices corresponding to the D + H2 and O + HD reactions were solved using a complex generalized minimal residual (GMRes) algorithm described by Saad and Schultz (1986) and Saad (1990). To provide a test case with a different structure, the H + H2 system was also considered. It is shown that the computational effort for solutions with the GMRes algorithm depends on the dimension of the linear system, the total energy of the scattering problem, and the accuracy criterion. In several cases with dimensions in the range 1110-5632, the GMRes algorithm outperformed the LAPACK direct solver, with speedups for the linear equation solution as large as a factor of 23.

Chatfield, David C.↗