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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Block iterative restoration of astronomical images with the massively parallel processor

A method is described for algebraic image restoration capable of treating astronomical images. For a typical 500 x 500 image, direct algebraic restoration would require the solution of a 250,000 x 250,000 linear system. The block iterative approach is used to reduce the problem to solving 4900 121 x 121 linear systems. The algorithm was implemented on the Goddard Massively Parallel Processor, which can solve a 121 x 121 system in approximately 0.06 seconds. Examples are shown of the results for various astronomical images.

Heap, Sara R.↗
NASA NTRS1987

Decoupled dynamic analysis of combined systems by iterative determination of interface accelerations

A dynamic analysis technique is presented that can be used to determine the response of a discrete model of a large linear structural system composed of multiple substructures. The technique circumvents the costly computation of the modal characteristics of the combined system. This is accomplished by relying on a predictor-corrector scheme to converge iteratively to the interface accelerations of the combined system, while the equations of motions of the individual structures are integrated separately. In this regard, the temporal slopes of the interface accelerations (jerks) are computed at each time point of integration to predict the interface accelerations at the next time point. The proposed technique is exemplified by conducting a Space Shuttle landing loads analysis; the obtained numerical data demonstrate its reliability and efficiency.

Spanos, P. D.↗
NASA NTRS1987

An efficient iteration strategy for upwind/relaxation solutions to the thin-layer Navier-Stokes equations

A previously developed upwind/relaxation algorithm for solving the unsteady, compressible, thin-layer Navier-Stokes equations is presently modified so that the downstream influence of the subsonic part of the boundary layer in an otherwise supersonic flow is suppressed by restricting the streamwise pressure gradient. A 'parabolized' solution is then efficiently obtained by marching downstream and iterating locally in each crossflow plane until achieving convergence. This parabolized solution is an excellent final one for problems without large adverse streamwise pressure gradients.

Newsome, Richard W.↗
NASA NTRS1987

Iterative solution of the multistream electron transport equation. I - Comparison with laboratory beam injection experiments

The Neumann iteration method presently used for solving the electron transport equation in which energy, attitude, and pitch angle are independent variables is fast, and can compute numerical point-response-function solutions of the electron transport equation. Because both the inelastic cross sections and angular elastic cross sections of the model are empirically based, the solutions obtained represent a test of compatibility between various sets of cross sections and energy deposition measurements. The use of a numerical quadrature based on analytic phase function forms yields accurate phase function integrals at low computational cost.

Porter, H. S.↗
NASA NTRS1986

Simultaneous iterations algorithm for general eigenvalue problems on parallel processors

The method of simultaneous iteration with shift is extended to extraction of m-eigenpairs of a general eigenvalue problem of large order n in a parallel processing environment. The algorithm combines the power method and the Jacobi technique, and reduces to performing four basic operations. Parallel implementation of the algorithm is discussed in detail. The analysis accounts for computation and communication costs, and utilizes a parallel processing architecture of the ensemble type. Expressions for the computational efficiency and speedup are defined as a function of the problem and hardware parameters. Selected representative problems exhibit efficiencies ranging from 60 to 98 percent.

Utku, S.↗
NASA NTRS1987

Iterative-deepening heuristic search for optimal and semi-optimal resource allocation

It is demonstrated that when iterative-deepening A asterisk (IDA asterisk) is applied to one type of resource allocation problem, it uses far less storage than A asterisk, but opens far more nodes and thus has unacceptable time complexity. This is shown to be due, at least in part, to the low-valued effective branching factor that is a characteristic of problems with real-valued cost functions. The semi-optimal, epsilon-admissible IDA asterisk sub epsilon search algorithm that the authors described was shown to open fewer nodes than both A asterisk and IDA asterisk with storage complexity proportional to the depth of the search tree.

Bridges, Susan M.↗
NASA NTRS1988

Breadboard RL10-2B low-thrust operating mode (second iteration) test report

Cryogenic rocket engines requiring a cooling process to thermally condition the engine to operating temperature can be made more efficient if cooling propellants can be burned. Tank head idle and pumped idle modes can be used to burn propellants employed for cooling, thereby providing useful thrust. Such idle modes required the use of a heat exchanger to vaporize oxygen prior to injection into the combustion chamber. During December 1988, Pratt and Whitney conducted a series of engine hot firing demonstrating the operation of two new, previously untested oxidizer heat exchanger designs. The program was a second iteration of previous low thrust testing conducted in 1984, during which a first-generation heat exchanger design was used. Although operation was demonstrated at tank head idle and pumped idle, the engine experienced instability when propellants could not be supplied to the heat exchanger at design conditions.

Kanic, Paul G.↗
NASA NTRS1988

I-BIEM, an iterative boundary integral equation method for computer solutions of current distribution problems with complex boundaries: A new algorithm. I - Theoretical

A new algorithm for an iterative computation of solutions of Laplace's or Poisson's equations in two dimensions, using Green's second identity, is presented. This algorithm converges strongly and geometrically and can be applied to curved, irregular, or moving boundaries with nonlinear and/or discontinuous boundary conditions. It has been implemented in Pascal on a number of micro- and minicomputers and applied to several geometries. Cases with known analytic solutions have been tested. Convergence to within 0.1 percent to 0.01 percent of the theoretical values are obtained in a few minutes on a microcomputer.

Cahan, B. D.↗
NASA NTRS1988

Cosmic-ray-modified stellar winds. III - A numerical iterative approach

A numerical iterative method is used to determine the modification of a stellar wind flow with a termination shock by the galactic cosmic rays. A two-fluid model consisting of cosmic rays and thermal stellar wind gas is used in which the cosmic rays are coupled to the background flow via scattering with magnetohydrodynamic waves or irregularities. A polytropic model is used to describe the thermal stellar wind gas, and the cosmic-rays are modeled as a hot, low-density gas with negligible mass flux. The positive galactic cosmic-ray pressure gradient serves to brake the outflowing stellar wind gas, and the cosmic rays modify the location of the critical point of the wind, the location of the shock, the wind fluid velocity profile, and the thermal gas entropy constants on both sides of the shock. The transfer of energy to the cosmic rays results in an outward radial flux of cosmic-ray energy.

Ko, C. M.↗
NASA NTRS1988

Iterates of maps with symmetry

Fixed-point bifurcation, period doubling, and Hopf bifurcation (HB) for iterates of equivariant mappings are investigated analytically, with a focus on HB in the presence of symmetry. An algebraic formulation for the hypotheses of the theorem of Ruelle (1973) is derived, and the case of standing waves in a system of ordinary differential equations with O(2) symmetry is considered in detail. In this case, it is shown that HB can lead directly to motion on an invariant 3-torus, with an unexpected third frequency due to drift of standing waves along the torus.

Chossat, Pascal↗
NASA NTRS1988

An approach to probabilistic finite element analysis using a mixed-iterative formulation

An efficient algorithm for computing the response sensitivity of finite element problems based on a mixed-iterative formulation is proposed. This method does not involve explicit differentiation of the tangent stiffness array and can be used with formulations for which a consistent tangent stiffness is not readily available. The method has been successfully applied to probabilistic finite element analysis of problems using the proposed mixed formulation, and this exercise has provided valuable insights regarding the extension of the method to a more general class of problems to include material and geometric nonlinearities.

Dias, J. B.↗
NASA NTRS1988

Image segmentation by iterative parallel region growing with application to data compression and image analysis

Image segmentation can be a key step in data compression and image analysis. However, the segmentation results produced by most previous approaches to region growing are suspect because they depend on the order in which portions of the image are processed. An iterative parallel segmentation algorithm avoids this problem by performing globally best merges first. Such a segmentation approach, and two implementations of the approach on NASA's Massively Parallel Processor (MPP) are described. Application of the segmentation approach to data compression and image analysis is then described, and results of such application are given for a LANDSAT Thematic Mapper image.

Tilton, James C.↗
NASA NTRS1989

Iterative procedures for space shuttle main engine performance models

Performance models of the Space Shuttle Main Engine (SSME) contain iterative strategies for determining approximate solutions to nonlinear equations reflecting fundamental mass, energy, and pressure balances within engine flow systems. Both univariate and multivariate Newton-Raphson algorithms are employed in the current version of the engine Test Information Program (TIP). Computational efficiency and reliability of these procedures is examined. A modified trust region form of the multivariate Newton-Raphson method is implemented and shown to be superior for off nominal engine performance predictions. A heuristic form of Broyden's Rank One method is also tested and favorable results based on this algorithm are presented.

Santi, L. Michael↗
NASA NTRS1989

Adaptive implicit-explicit and parallel element-by-element iteration schemes

Adaptive implicit-explicit (AIE) and grouped element-by-element (GEBE) iteration schemes are presented for the finite element solution of large-scale problems in computational mechanics and physics. The AIE approach is based on the dynamic arrangement of the elements into differently treated groups. The GEBE procedure, which is a way of rewriting the EBE formulation to make its parallel processing potential and implementation more clear, is based on the static arrangement of the elements into groups with no inter-element coupling within each group. Various numerical tests performed demonstrate the savings in the CPU time and memory.

Tezduyar, T. E.↗
NASA NTRS1991

Comparison of SMAC, PISO, and iterative time-advancing schemes for unsteady flows

Calculations of unsteady flows using a simplified marker and cell (SMAC), a pressure implicit splitting of operators (PSIO), and an iterative time advancing scheme (ITA) are presented. A partial differential equation for incremental pressure is used in each time advancing scheme. Example flows considered are a polar cavity flow starting from rest and self-sustained oscillating flows over a circular and a square cylinder. For a large time step size, the SMAC and ITA are more strongly convergent and yield more accurate results than PSIO. The SMAC is the most efficient computationally. For a small time step size, the three time advancing schemes yield equally accurate Strouhal numbers. The capability of each time advancing scheme to accurately resolve unsteady flows is attributed to the use of new pressure correction algorithm that can strongly enforce the conservation of mass. The numerical results show that the low frequency of the vortex shedding is caused by the growth time of each vortex shed into the wake region.

Kim, Sang-Wook↗
NASA NTRS1990

A comparison between progressive extension method (PEM) and iterative method (IM) for magnetic field extrapolations in the solar atmosphere

This paper presents a comparison between two numerical methods for the extrapolation of nonlinear force-free magnetic fields, viz the Iterative Method (IM) and the Progressive Extension Method (PEM). The advantages and disadvantages of these two methods are summarized, and the accuracy and numerical instability are discussed. On the basis of this investigation, it is claimed that the two methods do resemble each other qualitatively.

Wu, S. T.↗
NASA NTRS1990

A parallel iterative solution method for systems of nonlinear hyperbolic equations

An iterative algorithm suitable for the solution of a system of nonlinear hyperbolic partial differentiation equations in multiple dimensions is discussed. Current numerical methods for systems of nonlinear PDEs have limited parallelism due to strong coupling between the equations. This method decouples the PDEs by linearizing the convention coefficient for a space-time domain. This provides large grain parallelism. The linearization also allows the treatment of some terms in the equations as source terms, providing more freedom to choose from a wider variety of numerical methods. Smaller grain parallelism may be exploited within the solves for each equation. Thus, the method has potential for parallelism at several levels.

Scroggs, Jeffrey S.↗
NASA NTRS1991

An accelerated lambda iteration method for multilevel radiative transfer. I - Non-overlapping lines with background continuum

A method is presented for solving multilevel transfer problems when nonoverlapping lines and background continuum are present and active continuum transfer is absent. An approximate lambda operator is employed to derive linear, 'preconditioned', statistical-equilibrium equations. A method is described for finding the diagonal elements of the 'true' numerical lambda operator, and therefore for obtaining the coefficients of the equations. Iterations of the preconditioned equations, in conjunction with the transfer equation's formal solution, are used to solve linear equations. Some multilevel problems are considered, including an eleven-level neutral helium atom. Diagonal and tridiagonal approximate lambda operators are utilized in the problems to examine the convergence properties of the method, and it is found to be effective for the line transfer problems.

Rybicki, G. B.↗