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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 289 records · Page 16

All sources NASA NTRS DOE OSTI

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.↗

NASA NTRS1992

Iterative Bayesian Classification In Polarimetric SAR

In improved scheme for Bayesian classification of picture elements in polarimetric synthetic-aperture radar image of terrain, priori probability that given picture element belongs to given class, adjusted according to spatial variation of statistical properties of image data. Accuracy increases dramatically in first few iterations. Scheme involves sequence of classifications. In first, a priori probability that element belongs to class taken to be constant over the whole image. In subsequent classifications, adaptive a priori probabilities calculated for each picture element.

Van Zyl, Jakob J.↗

NASA NTRS1990

Fast secant methods for the iterative solution of large nonsymmetric linear systems

A family of secant methods based on general rank-1 updates was revisited in view of the construction of iterative solvers for large non-Hermitian linear systems. As it turns out, both Broyden's good and bad update techniques play a special role, but should be associated with two different line search principles. For Broyden's bad update technique, a minimum residual principle is natural, thus making it theoretically comparable with a series of well known algorithms like GMRES. Broyden's good update technique, however, is shown to be naturally linked with a minimum next correction principle, which asymptotically mimics a minimum error principle. The two minimization principles differ significantly for sufficiently large system dimension. Numerical experiments on discretized partial differential equations of convection diffusion type in 2-D with integral layers give a first impression of the possible power of the derived good Broyden variant.

Deuflhard, Peter↗

NASA NTRS1991

An iterative implicit diagonally-dominant factorization algorithm for solving the Navier-Stokes equations

Presented here is an algorithm for solving the multidimensional unsteady Navier-Stokes equations for compressible flows. It is based on a diagonally-dominant approximate factorization procedure. The factorization error and the timewise linearization error associated with this procedure are reduced by performing Newton-type inner iterations at each time step. The inviscid fluxes are evaluated by the fourth-order central differencing scheme amended with a numerical dissipation directly proportional to the entire dissipative part of the truncation error intrinsic to the third order biased upwind scheme. The important features of the proposed solution are elucidated by the numerical results of the convection of a vortex and the backward-facing step flows.

Chen, Shu-Cheng↗

NASA NTRS1992

Iterative deconvolution of x ray and optical SNR images

Blind Iterative Deconvolution (BID) is a technique which was originally developed to correct the degrading effects of atmospheric turbulence on astronomical images from single short exposure, high signal-to-noise-ratio frames. At the Center for Astro physics, we have implemented a version of BID following the general approach of Ayers and Dainty (1988), but extending the technique to use Wiener filtering, and developed it for application to high energy images from Einstein and ROSAT. In the optical, the point spread function (PSF) that degrades the images is due to a combination of telescope and atmospheric aberrations. At high energies, the degrading function is the instrument response function, which is known to be time and energy level unstable. In both cases, the PSF is poorly known, so BID can be used to extract the PSF from the image and then deconvolve the blurred image to produce a sharpened image. Other aspects of this technique are discussed.

Nisenson, Peter↗

NASA NTRS1991

Iterative repair for scheduling and rescheduling

An iterative repair search method is described called constraint based simulated annealing. Simulated annealing is a hill climbing search technique capable of escaping local minima. The utility of the constraint based framework is shown by comparing search performance with and without the constraint framework on a suite of randomly generated problems. Results are also shown of applying the technique to the NASA Space Shuttle ground processing problem. These experiments show that the search methods scales to complex, real world problems and reflects interesting anytime behavior.

Zweben, Monte↗

NASA NTRS1992

Upper bounds for convergence rates of vector extrapolation methods on linear systems with initial iterations

The application of the minimal polynomial extrapolation (MPE) and the reduced rank extrapolation (RRE) to a vector sequence obtained by the linear iterative technique x(sub j) + 1 = Ax(sub j) = b,j = 1,2,..., is considered. Both methods produce a two dimensional array of approximations s(sub n,k) to the solution of the system (I - A)x = b. Here, s(sub n,k) is obtained from the vectors x(sub j), n is less than or equal to j is less than or equal to n + k + 1. It was observed in an earlier publication by the first author that the sequence s(sub n,k), k = 1,2,..., for n greater than 0, but fixed, possesses better convergence properties than the sequence s(sub 0,k), k = 1,2,.... A detailed theoretical explanation for this phenomenon is provided in the present work. This explanation is heavily based on approximations by incomplete polynomials. It is demonstrated by numerical examples when the matrix A is sparse that cycling with s(sub n,k) for n greater than 0, but fixed, produces better convergence rates and costs less computationally than cycling with s(sub 0,k). It is also illustrated numerically with a convection-diffusion problem that the former may produce excellent results where the latter may fail completely. As has been shown in an earlier publication, the results produced by s(sub 0,k) are identical to the corresponding results obtained by applying the Arnoldi method or generalized minimal residual scheme (GMRES) to the system (I - A)x = b.

Sidi, Avram↗