Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative method”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Marching iterative methods for the parabolized and thin layer Navier-Stokes equations

Downstream marching iterative schemes for the solution of the Parabolized or Thin Layer (PNS or TL) Navier-Stokes equations are described. Modifications of the primitive equation global relaxation sweep procedure result in efficient second-order marching schemes. These schemes take full account of the reduced order of the approximate equations as they behave like the SLOR for a single elliptic equation. The improved smoothing properties permit the introduction of Multi-Grid acceleration. The proposed algorithm is essentially Reynolds number independent and therefore can be applied to the solution of the subsonic Euler equations. The convergence rates are similar to those obtained by the Multi-Grid solution of a single elliptic equation; the storage is also comparable as only the pressure has to be stored on all levels. Extensions to three-dimensional and compressible subsonic flows are discussed. Numerical results are presented.

Israeli, M.↗
NASA NTRS1985

Marching iterative methods for the Parabolized and Thin Layer Navier-Stokes equations

Downstream marching iterative schemes for the solution of the Parabolized or Thin Layer (PNS or TL) Navier-Stokes equations are described. Modifications of the primitive equation global relaxation sweep procedure result in efficient second-order marching schemes. These schemes take full account of the reduced order of the approximate equations as they behave like the SLOR for a single elliptic equation. The improved smoothing properties permit the introduction of Multi-Grid acceleration. The proposed algorithm is essentially Reynolds number independent and therefore can be applied to the solution of the subsonic Euler equations. The convergence rates are similar to those obtained by the Multi-Grid solution of a single elliptic equation; the storage is also comparable as only the pressure has to be stored on all levels. Extensions to three-dimensional and compressible subsonic flows are discussed. Numerical results are presented.

Israeli, M.↗
NASA NTRS1992

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

This paper presents a simple and non-iterative procedure for the computation of the exact value of the infimum in the singular H(infinity)-optimization problem, and is an extension of our earlier work. The problem formulation is general and does not place any restriction on the direct feedthrough terms between the control input and the controlled output variables, and between the disturbance input and the measurement output variables. Our 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. The computation of the infimum in our method involves solving two well-defined Riccati and two Liapunov equations.

Chen, Ben M.↗
NASA NTRS1973

Iterative methods for plasma sheath calculations: Application to spherical probe

The computer cost of a Poisson-Vlasov iteration procedure for the numerical solution of a steady-state collisionless plasma-sheath problem depends on: (1) the nature of the chosen iterative algorithm, (2) the position of the outer boundary of the grid, and (3) the nature of the boundary condition applied to simulate a condition at infinity (as in three-dimensional probe or satellite-wake problems). Two iterative algorithms, in conjunction with three types of boundary conditions, are analyzed theoretically and applied to the computation of current-voltage characteristics of a spherical electrostatic probe. The first algorithm was commonly used by physicists, and its computer costs depend primarily on the boundary conditions and are only slightly affected by the mesh interval. The second algorithm is not commonly used, and its costs depend primarily on the mesh interval and slightly on the boundary conditions.

Parker, L. W.↗
NASA NTRS1992

Iterative methods for large scale static analysis of structures on a scalable multiprocessor supercomputer

A parallel Preconditioned Conjugate Gradient (PCG) iterative solver has been developed and implemented on the iPSC-860 scalable hypercube. This new implementation makes use of the Parallel Automated Runtime Toolkit at ICASE (PARTI) primitives to efficiently program irregular communications patterns that exist in general sparse matrices and in particular in the finite element sparse stiffness matrices. The iterative PCG has been used to solve the finite element equations that result from discretizing large scale aerospace structures. In particular, the static response of the High Speed Civil Transport (HSCT) finite element model is solved on the iPSC-860.

Sobh, Nahil Atef↗
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

Recent advances in Lanczos-based iterative methods for nonsymmetric linear systems

In recent years, there has been a true revival of the nonsymmetric Lanczos method. On the one hand, the possible breakdowns in the classical algorithm are now better understood, and so-called look-ahead variants of the Lanczos process have been developed, which remedy this problem. On the other hand, various new Lanczos-based iterative schemes for solving nonsymmetric linear systems have been proposed. This paper gives a survey of some of these recent developments.

Freund, Roland W.↗
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 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 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.↗