Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 793 records · Page 44

Predicting Wall Modifications for Adaptive Wind Tunnels

Wall shape changed iteratively until it matches streamlines. FLEXWAL predicts upper and lower wall modifications necessary to remove wall-interference effects in adaptive-wall wind tunnels. FLEXWAL aids in elimination of wall-interference effects on objects tested in typical two-dimensional wind tunnel with rigid sidewalls and flexible, solid floor and ceiling boundaries. Iterative procedure valid for subsonic and transonic test conditions, and convergence of method verified both analytically and experimentally. FLEXWAL written in FORTRAN IV for batch execution.

Everhart, J. L.↗

Numerical procedure for three-dimensional hypersonic viscous flow over aerobrake configuration

A numerical method, which is simpler and more efficient than others currently in use, is proposed for the computation of the full viscous flow over an aerobrake body in hypersonic stream at high altitude. It treats the shock layer surrounding the blunt forebody and the near wake behind the base simultaneously by formulating the Navier-Stokes equations in conformal and azimuthal-angle coordinates. The computational domain is confined by the body wall, outflow surface and the shock, which is adjusted along the coordinate normal to the wall in the course of iterations. Because of the optimal grid and a well developed alternating direction implicit factorization technique for the governing equations, reasonably accurate results can be obtained with a 28 x 36 x 7 grid and 400 time-marching iterations. Excellent agreement of shock location is found between the present result and the schlieren photograph. Details of the base flow and shear layer impingement on the cylindrical aft body are presented for an adiabatic wall case.

Li, C. P.↗

Reduction of the effects of the communication delays in scientific algorithms on message passing MIMD architectures

The efficient implementation of algorithms on multiprocessor machines requires that the effects of communication delays be minimized. The effects of these delays on the performance of a model problem on a hypercube multiprocessor architecture is investigated and methods are developed for increasing algorithm efficiency. The model problem under investigation is the solution by red-black Successive Over Relaxation YOUN71 of the heat equation; most of the techniques described here also apply equally well to the solution of elliptic partial differential equations by red-black or multicolor SOR methods. Methods for reducing communication traffic and overhead on a multiprocessor are identified and results of testing these methods on the Intel iPSC Hypercube reported. Methods for partitioning a problem's domain across processors, for reducing communication traffic during a global convergence check, for reducing the number of global convergence checks employed during an iteration, and for concurrently iterating on multiple time-steps in a time-dependent problem. Empirical results show that use of these models can markedly reduce a numewrical problem's execution time.

Saltz, J. H.↗

Solution of the symmetric eigenproblem AX=lambda BX by delayed division

Delayed division is an iterative method for solving the linear eigenvalue problem AX = lambda BX for a limited number of small eigenvalues and their corresponding eigenvectors. The distinctive feature of the method is the reduction of the problem to an approximate triangular form by systematically dropping quadratic terms in the eigenvalue lambda. The report describes the pivoting strategy in the reduction and the method for preserving symmetry in submatrices at each reduction step. Along with the approximate triangular reduction, the report extends some techniques used in the method of inverse subspace iteration. Examples are included for problems of varying complexity.

Thurston, G. A.↗

Constraints on geomagnetic secular variation modeling from electromagnetism and fluid dynamics of the Earth's core

A spherical harmonic representation of the geomagnetic field and its secular variation for epoch 1980, designated GSFC(9/84), is derived and evaluated. At three epochs (1977.5, 1980.0, 1982.5) this model incorporates conservation of magnetic flux through five selected patches of area on the core/mantle boundary bounded by the zero contours of vertical magnetic field. These fifteen nonlinear constraints are included like data in an iterative least squares parameter estimation procedure that starts with the recently derived unconstrained field model GSFC (12/83). Convergence is approached within three iterations. The constrained model is evaluated by comparing its predictive capability outside the time span of its data, in terms of residuals at magnetic observatories, with that for the unconstrained model.

Benton, E. R.↗

Solving large-scale dynamic systems using band Lanczos method in Rockwell NASTRAN on CRAY X-MP

The improved cost effectiveness using better models, more accurate and faster algorithms and large scale computing offers more representative dynamic analyses. The band Lanczos eigen-solution method was implemented in Rockwell's version of 1984 COSMIC-released NASTRAN finite element structural analysis computer program to effectively solve for structural vibration modes including those of large complex systems exceeding 10,000 degrees of freedom. The Lanczos vectors were re-orthogonalized locally using the Lanczos Method and globally using the modified Gram-Schmidt method for sweeping rigid-body modes and previously generated modes and Lanczos vectors. The truncated band matrix was solved for vibration frequencies and mode shapes using Givens rotations. Numerical examples are included to demonstrate the cost effectiveness and accuracy of the method as implemented in ROCKWELL NASTRAN. The CRAY version is based on RPK's COSMIC/NASTRAN. The band Lanczos method was more reliable and accurate and converged faster than the single vector Lanczos Method. The band Lanczos method was comparable to the subspace iteration method which was a block version of the inverse power method. However, the subspace matrix tended to be fully populated in the case of subspace iteration and not as sparse as a band matrix.

Gupta, V. K.↗

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

Solution of elliptic partial differential equations by fast Poisson solvers using a local relaxation factor. 1: One-step method

An algorithm for solving a large class of two- and three-dimensional nonseparable elliptic partial differential equations (PDE's) is developed and tested. It uses a modified D'Yakanov-Gunn iterative procedure in which the relaxation factor is grid-point dependent. It is easy to implement and applicable to a variety of boundary conditions. It is also computationally efficient, as indicated by the results of numerical comparisons with other established methods. Furthermore, the current algorithm has the advantage of possessing two important properties which the traditional iterative methods lack; that is: (1) the convergence rate is relatively insensitive to grid-cell size and aspect ratio, and (2) the convergence rate can be easily estimated by using the coefficient of the PDE being solved.

Chang, S. C.↗

Error control for reliable digital data transmission and storage systems

A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. In LSI and VLSI technology, memories are often organized on a multiple bit (or byte) per chip basis. For example, some 256K-bit DRAM's are organized in 32Kx8 bit-bytes. Byte oriented codes such as Reed Solomon (RS) codes can provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. In this paper we present some special decoding techniques for extended single-and-double-error-correcting RS codes which are capable of high speed operation. These techniques are designed to find the error locations and the error values directly from the syndrome without having to use the iterative alorithm to find the error locator polynomial. Two codes are considered: (1) a d sub min = 4 single-byte-error-correcting (SBEC), double-byte-error-detecting (DBED) RS code; and (2) a d sub min = 6 double-byte-error-correcting (DBEC), triple-byte-error-detecting (TBED) RS code.

Costello, D. J., Jr.↗

Contact stresses in pin-loaded orthotropic plates

The effects of pin elasticity, friction, and clearance on the stresses near the hole in a pin-loaded orthotropic plate are described. The problem is modeled as a contact elasticity problem using complex variable theory, the pin and the plate being two elastic bodies interacting through contact. This modeling is in contrast to previous works which assumed that the pin is rigid or that it exerts a known cosinusoidal radial traction on the hole boundary. Neither of these approaches explicitly involves a pin. A collocation procedure and iteration were used to obtain numerical results for a variety of plate and pin elastic properties and various levels of friction and clearance. Collocation was used to enforce the boundary and iteration was used to find the contact and no-slip regions on the boundary. Details of the numerical scheme are discussed.

Hyer, M. W.↗

Variation in efficiency of parallel algorithms

The present study has the objective to investigate some iterative parallel-processor linear equation solving algorithms with respect to efficiency for analyses of typical linear engineering systems. Attention is given to a set of n linear equations, Ku = p, where K = an n x n positive definite, sparsely populated, symmetric matrix, u = an n x 1 vector of unknown responses, and p = an n x 1 vector of prescribed constants. This study is concerned with a hybrid method in which iteration is used to solve the problem, while a direct method is used on the local processor level. Variations in the efficiency of parallel algorithms are explored. Measures of the efficiency are based on computer experiments regarding the algorithms. For all the algorithms, the wall clock time is found to decrease as the number of processors increases.

Hayashi, A.↗

Multi-grid calculation of transonic potential flows

The finite-volume method discussed by Jameson and Caughey (1977), and Caughey and Jameson (1979, 1980) has made it possible to calculate the transonic potential flow past any configuration for which a suitable boundary-conforming coordinate grid can be constructed. However, computations for practical three-dimensional problems have remained quite expensive in terms of the required computer time. The reason for this is primarily related to the large number of grid cells necessary for adequate resolution in these complex three-dimensional problems, taking into account the large number of iterations required to achieve even modest convergence on these fine grids. The present chapter provides a description of work directed at removing this latter difficulty by making use of the multigrid method. Attention is given to finite-volume formulation, multigrid iteration, geometrical aspects, and computed results.

Caughey, D. A.↗

Fast and optimal solution to the 'Rankine-Hugoniot problem'

A new, definitive, reliable and fast iterative method is described for determining the geometrical properties of a shock (i.e., theta sub Bn, yields N, V sub s and M sub A), the conservation constants and the self-consistent asymptotic magnetofluid variables, that uses the three dimensional magnetic field and plasma observations. The method is well conditioned and reliable at all theta sub Bn angles regardless of the shock strength or geometry. Explicit proof of uniqueness of the shock geometry solution by either analytical or graphical methods is given. The method is applied to synthetic and real shocks, including a bow shock event and the results are then compared with those determined by preaveraging methods and other iterative schemes. A complete analysis of the confidence region and error bounds of the solution is also presented.

Vinas, A. F.↗

Polynomial elimination theory and non-linear stability analysis for the Euler equations

Numerical methods are presented that exploit the polynomial properties of discretizations of the Euler equations. It is noted that most finite difference or finite volume discretizations of the steady-state Euler equations produce a polynomial system of equations to be solved. These equations are solved using classical polynomial elimination theory, with some innovative modifications. This paper also presents some preliminary results of a new non-linear stability analysis technique. This technique is applicable to determining the stability of polynomial iterative schemes. Results are presented for applying the elimination technique to a one-dimensional test case. For this test case, the exact solution is computed in three iterations. The non-linear stability analysis is applied to determine the optimal time step for solving Burgers' equation using the MacCormack scheme. The estimated optimal time step is very close to the time step that arises from a linear stability analysis.

Kennon, S. R.↗

On the electromagnetic scattering from infinite rectangular grids with finite conductivity

A variety of methods can be used in constructing solutions to the problem of mesh scattering. However, each of these methods has certain drawbacks. The present paper is concerned with a new technique which is valid for all spacings. The new method involved, called the fast Fourier transform-conjugate gradient method (FFT-CGM), represents an iterative technique which employs the conjugate gradient method to improve upon each iterate, utilizing the fast Fourier transform. The FFT-CGM method provides a new accurate model which can be extended and applied to the more difficult problems of woven mesh surfaces. The formulation of the FFT-conjugate gradient method for aperture fields and current densities for a planar periodic structure is considered along with singular operators, the formulation of the FFT-CG method for thin wires with finite conductivity, and reflection coefficients.

Christodoulou, C. G.↗

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

Polynomic nonlinear dynamical systems - A residual sensitivity method for model reduction

The motivation for using polynomic combinations of system states and inputs to model nonlinear dynamics systems is founded upon the classical theories of analysis and function representation. A feature of such representations is the need to make available all possible monomials in these variables, up to the degree specified, so as to provide for the description of widely varying functions within a broad class. For a particular application, however, certain monomials may be quite superfluous. This paper examines the possibility of removing monomials from the model in accordance with the level of sensitivity displayed by the residuals to their absence. Critical in these studies is the effect of system input excitation, and the effect of discarding monomial terms, upon the model parameter set. Therefore, model reduction is approached iteratively, with inputs redesigned at each iteration to ensure sufficient excitation of remaining monomials for parameter approximation. Examples are reported to illustrate the performance of such model reduction approaches.

Yurkovich, S.↗

Preconditioned conjugate residual methods for the solution of spectral equations

Conjugate residual methods for the solution of spectral equations are described. An inexact finite-difference operator is introduced as a preconditioner in the iterative procedures. Application of these techniques is limited to problems for which the symmetric part of the coefficient matrix is positive definite. Although the spectral equation is a very ill-conditioned and full matrix problem, the computational effort of the present iterative methods for solving such a system is comparable to that for the sparse matrix equations obtained from the application of either finite-difference or finite-element methods to the same problems. Numerical experiments are shown for a self-adjoint elliptic partial differential equation with Dirichlet boundary conditions, and comparison with other solution procedures for spectral equations is presented.

Wong, Y. S.↗