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

A numerical method for the solution of three dimensional, incompressible, viscous flows over slender bodies

A marching iterative method for the solution of the three dimensional, incompressibhle, steady and parabolized Navier-Stokes equations is described. The equations are written in primitive variables and discretized in general axisymmetric orthogonal coordinate systems. The coupled set of finite-difference equations are solved without any splitting or factorization errors. Moreover, the continuity equation and the two crossflow momentum equations are exactly satisfied at every step of the iterative process. The solution scheme is equivalent to the solution of one Poisson equation by the Successive Plane Over Relaxation method and has good convergence properties. Other existing solution methods resemble a Jacobi-type iterative scheme and therefore are less efficient. Numerical experiments include the laminar, incompressible flow over prolate spheroids at incidence.

Rosenfeld, Moshe↗
NASA NTRS1996

Convergence of a Substructuring Method with LaGrange Multipliers

We analyze the convergence of a substructuring iterative method with Lagrange multipliers, proposed recently by Farhat and Roux. The method decomposes finite element discretization of an elliptic boundary value problem into Neumann problems on the subdomains and a coarse problem for the subdomain nullspace components. For linear conforming elements and preconditioning by the Dirichlet problems on the subdomains, we prove the asymptotic bound on the condition number C(1 + log(H/h))(sup gamma), gamma = 2 or 3, where h is the characteristic element size and H is the subdomain size.

Mandel, Jan↗
NASA NTRS1991

Distributed Minimal Residual (DMR) method for acceleration of iterative algorithms

A new method for enhancing the convergence rate of iterative algorithms for the numerical integration of systems of partial differential equations was developed. It is termed the Distributed Minimal Residual (DMR) method and it is based on general Krylov subspace methods. The DMR method differs from the Krylov subspace methods by the fact that the iterative acceleration factors are different from equation to equation in the system. At the same time, the DMR method can be viewed as an incomplete Newton iteration method. The DMR method was applied to Euler equations of gas dynamics and incompressible Navier-Stokes equations. All numerical test cases were obtained using either explicit four stage Runge-Kutta or Euler implicit time integration. The formulation for the DMR method is general in nature and can be applied to explicit and implicit iterative algorithms for arbitrary systems of partial differential equations.

Lee, Seungsoo↗
NASA NTRS1991

The coupling of radiative transfer to quasi 1-D flows with thermochemical nonequilibrium

Quasi-one-dimensional nonequilibrium nozzle flows with coupled radiative transfer are considered. The strongly coupled formulation of radiation and flowfield leads to a governing set of integro-differential equations. A fully implicit numerical method using the full matrix inversion or block iteration methods is presented to solve these equations. The nonequilibrium gas model consists of two chemical species, molecular and atomic nitrogen. The thermodynamic state of the gas is described by two temperatures, translational-rotational and vibrational, and the thermal radiation is assumed to be governed by the vibrational temperature. In radiative transfer, gases are assumed to be absorbing and emitting, and a detailed spectral dependency of the absorption coefficient is prescribed for a non-gray gas. The numerical solutions of strongly radiating nonequilibrium flows are presented for both gray and non-gray gases.

Gokcen, Tahir↗
NASA NTRS1993

Vibration of thermally buckled composite plates with initial deflections using triangular elements

A consistent finite element formulation is presented for the analysis of thermal postbuckling and free vibration of thermally buckled thin, laminated composite plates subjected to large temperature change. The influence of moderately large initial imperfections in deflection on the thermal postbuckling deflection and the vibration characteristics of the buckled plate is also investigated. The finite element equations of motion are derived from the principle of virtual work. These equations can be mathematically separated into two sets and solved in sequence. The first set of equations yields the particular solution of static thermal postbuckling deflection, and the second set of equations gives the homogeneous solution of vibration characteristics on the buckled plate. The first set of static equations is solved by using Newton-Raphson iteration method. The tangent stiffness matrix in the final iteration is equal to the total stiffness matrix of the second set of dynamic equations. This feature saves tremendous computation time in comparing with using the conventional approach. The influence of lamination angle, temperature distribution, plate planform of arbitrary shape, and boundary support conditions on postbuckling and vibration behavior are investigated.

Zhou, R. C.↗
NASA NTRS1986

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Poole, E. L.↗
NASA NTRS1991

Acceleration of convergence by shifting the spectrum of implicit finite difference operators associated with the equations of gas dynamics

Eigensystem analysis techniques are applied to finite difference formulations of the Navier-Stokes equations in one dimension. Spectra of the resulting implicit difference operators are computed. The largest eigenvalues are calculated by using a combination of the Frechet derivative of the operators and Arnoldi's method. The accuracy of Arnoldi's method is tested by comparing the rate of convergence of the iterative method with the dominant eigenvalue of the original iteration matrix. On the basis of the pattern of eigenvalue distributions for various flow configurations, a shifting of the implicit operators in question is devised. This procedure has improved the rates of convergence of CFD codes by 20 - 50 percent.

Cheer, A.↗
NASA NTRS1994

A linear method for analyzing lightning field changes

A constrained, least-squares method for analyzing multiple-station measurements of lightning field changes (delta Es) is introduced. Previous methods have attempted to fit the spatial pattern of lightning delta Es using nonlinear models, such as a point charge (Q) or a point dipole (P) model. With the linear method, the delta Es are described not by models but by a general volume charge distribution that is deposited on a large (40 x 40 x 20 cu km) Cartesian grid above the measuring network. A linear system of equations is used to relate the measured delta Es to the charges that are deposited at each grid point. With this approach, the information content of the measurements can be quantified by an eigenanalysis of the covariance matrix of the linear system. Constraints can be used to reduce the infinity of possible solutions to the linear system and also to reduce systematic biases that can be introduced by the method of solution. It is shown that a Landweber iterative method, derived from the general method of steepest descent, can be used to solve the linear system and that the resulting volume charge distributions are generally consistent with computer-simulated charge sources, when these sources are over the measuring network. The Landweber iteration has also provided solutions for natural lightning events that are consistent with Q- and P-model results.

Koshak, William J.↗
NASA NTRS1986

An inverse method for subcritical flows

An exact method is presented for two-dimensional subsonic flow within the limitations of the tangent gas approximation. While Woods (1961) studied these equations and proposed iterative methods for the solution of both the iterative and inverse problems, the inverse method here presented is noniterative and exact. It is shown that the direct Euler solution over the designed airfoil is very close to the input speed distribution, and that the constraints necessitated by upstream condition and closure requirements are easily incorporated.

Daripa, P. K.↗
NASA NTRS1976

A single field of view method for retrieving tropospheric temperature profiles from cloud-contaminated radiance data

An iterative method is presented to retrieve single field of view (FOV) tropospheric temperature profiles directly from cloud-contaminated radiance data. A well-defined temperature profile may be calculated from the radiative transfer equation (RTE) for a partly cloudy atmosphere when the average fractional cloud amount and cloud-top height for the FOV are known. A cloud model is formulated to calculate the fractional cloud amount from an estimated cloud-top height. The method is then examined through use of simulated radiance data calculated through vertical integration of the RTE for a partly cloudy atmosphere using known values of cloud-top height(s) and fractional cloud amount(s). Temperature profiles are retrieved from the simulated data assuming various errors in the cloud parameters. Temperature profiles are retrieved from NOAA-4 satellite-measured radiance data obtained over an area dominated by an active cold front and with considerable cloud cover and compared with radiosonde data. The effects of using various guessed profiles and the number of iterations are considered.

Hodges, D. B.↗
NASA NTRS1972

A modified secant method for unconstrained minimization

A gradient-secant algorithm for unconstrained optimization problems is presented. The algorithm uses Armijo gradient method iterations until it reaches a region where the Newton method is more efficient, and then switches over to a secant form of operation. It is concluded that an efficient method for unconstrained minimization has been developed, and that any convergent minimization method can be substituted for the Armijo gradient method.

Polak, E.↗
NASA NTRS1974

Multiple zeros of polynomials

For polynomials of higher degree, iterative numerical methods must be used. Four iterative methods are presented for approximating the zeros of a polynomial using a digital computer. Newton's method and Muller's method are two well known iterative methods which are presented. They extract the zeros of a polynomial by generating a sequence of approximations converging to each zero. However, both of these methods are very unstable when used on a polynomial which has multiple zeros. That is, either they fail to converge to some or all of the zeros, or they converge to very bad approximations of the polynomial's zeros. This material introduces two new methods, the greatest common divisor (G.C.D.) method and the repeated greatest common divisor (repeated G.C.D.) method, which are superior methods for numerically approximating the zeros of a polynomial having multiple zeros. These methods were programmed in FORTRAN 4 and comparisons in time and accuracy are given.

Wood, C. A.↗
NASA NTRS1980

Accuracies of three computationally efficient algorithms for computing atmospheric transmittances

Three algorithms for calculating polychromatic atmospheric transmittance functions have been tested using a set of eleven distinct temperature profiles in order to compare transmittance accuracies achievable by the three methods. The comparison of rms errors demonstrates that the iterative method of McMillin and Fleming (1976) is the most accurate of the efficient algorithms currently available for gases with constant mixing ratios; its accuracy approaches that of the spectroscopic parameters and the computational approximations used in the ground-truth line-by-line calculations. The method of Arking et al. (1974), while less accurate, has the advantage of being perfectly general and easily adapted to cases where spectral bandwidths are varied

Mcmillin, L. M.↗
NASA NTRS1987

Experience with the matched filtered weighted-shift-and-add method

It is presently demonstrated that while the matched filter formulated by Ribak (1986) for the extension of the weighted-shift-and-add (WSA) method successfully reduces photon statistics-dominated specklegrams, the iterative method originally proposed by Ribak does not converge in the case of photon-noisy specklegrams for objects having more than one maxima. Attention is accordingly given to methods for rendering the procedure more 'artificially intelligent'. An error matrix is defined that is useful in evaluating the validity of the results produced by the matched filter extension of the WSA method.

Hege, E. Keith↗
NASA NTRS1991

Efficient use of direct solvers for the calculation of compressible flows

While the direct solution of systems of linear equations resulting from fluid dynamic problems has generally not been practical in the past, it is presently demonstrated that the direct method is often more efficient than the most popular iterative schemes when constructed in such a way as to take advantage of presently available vector processing capabilities and large memory. The vertical line Gauss-Seidel algorithm was chosen as the iterative method to be compared with the direct method. It is fond that the direct method becomes efficient only when large residual reductions are desired.

Riggins, David W.↗
NASA NTRS1994

Parallel Preconditioning for CFD Problems on the CM-5

Up to today, preconditioning methods on massively parallel systems have faced a major difficulty. The most successful preconditioning methods in terms of accelerating the convergence of the iterative solver such as incomplete LU factorizations are notoriously difficult to implement on parallel machines for two reasons: (1) the actual computation of the preconditioner is not very floating-point intensive, but requires a large amount of unstructured communication, and (2) the application of the preconditioning matrix in the iteration phase (i.e. triangular solves) are difficult to parallelize because of the recursive nature of the computation. Here we present a new approach to preconditioning for very large, sparse, unsymmetric, linear systems, which avoids both difficulties. We explicitly compute an approximate inverse to our original matrix. This new preconditioning matrix can be applied most efficiently for iterative methods on massively parallel machines, since the preconditioning phase involves only a matrix-vector multiplication, with possibly a dense matrix. Furthermore the actual computation of the preconditioning matrix has natural parallelism. For a problem of size n, the preconditioning matrix can be computed by solving n independent small least squares problems. The algorithm and its implementation on the Connection Machine CM-5 are discussed in detail and supported by extensive timings obtained from real problem data.

Simon, Horst D.↗