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 811 records · Page 45

Nonlinear sensitivity coefficients and corrections in system identification

The evaluation of sensitivity coefficients which are the changes in the eigencharacteristics with respect to changes in the structural parameters is important in the identification of structural systems. In such studies the commonly used linearized sensitivity coefficients for system identification have occasionally resulted in poor convergence or even divergence during the iteration process to update analytical models for better correlation with the test data. Nonlinear sensitivity coefficients and nonlinear correction terms, usually eliminated during the linearization process, have been developed to evaluate sensitivity coefficients of linear systems. Application to computer simulated example problems indicates a more rapid and stable convergence of the iteration processes to update the analytical model for the improvement of the correlation with test data. The successful application of combining the nonlinear sensitivity coefficients and nonlinear correction terms with the Multiple Boundary Condition Tests enhances the ability to validate large space structures by ground tests.

Kuo, C. P.↗

Two locations, two times, and the element set

A robust analytical formulation is developed to apply classical initial orbital determination to artificial satellites whose locations are uncertain to about 1 cu km and separated in time by no more than 30 min. An analytical simplification reduces Gauss's method, iteration on the semilatus rectum, iteration on the true anomaly, and the Lambert-Euler technique, to the solution of a single equation in one unknown, instead of the usual coupled triplet of three equations in three unknowns. The method is demonstrated for all common artificial satellite orbits over a variety of time intervals between the two location vectors, and for a varied set of position and distance errors.

Taff, L. G.↗

A new approach for solving the three-dimensional steady Euler equations. I - General theory

The present iterative procedure combines the Clebsch potentials and the Munk-Prim (1947) substitution principle with an extension of a semidirect Cauchy-Riemann solver to three dimensions, in order to solve steady, inviscid three-dimensional rotational flow problems in either subsonic or incompressible flow regimes. This solution procedure can be used, upon discretization, to obtain inviscid subsonic flow solutions in a 180-deg turning channel. In addition to accurately predicting the behavior of weak secondary flows, the algorithm can generate solutions for strong secondary flows and will yield acceptable flow solutions after only 10-20 outer loop iterations.

Chang, S.-C.↗

Mesh-connected processor arrays for the transitive closure problem

The main purpose in this paper is to lay a theoretical foundation for the design of mesh-connected processor arrays for the transitive closure problem. Using a simple path-algebraic formulation of the problem and observing its similarity to certain well-known smoothing problems that occur in digital signal processing, it is shown how to draw upon existing techniques from the signal processing literature to derive regular iterative algorithms for determining the transitive closure of the graph. The regular iterative algorithms that are derived using these considerations, are then analyzed and synthesized on mesh-connected processor arrays. Among the vast number of mesh-connected processor arrays that can be designed using this unified approach, the systolic arrays reported in the literature for this problem are shown to be special cases.

Rao, S. K.↗

Automated matching of pairs of SIR-B images for elevation mapping

During the SIR-B mission in October 1984, a significant number of overlapping synthetic aperture radar (SAR) images of various ground areas was collected. This has offered the first opportunity to perform stereo analyses on images from space that cover large ground areas to determine elevation information. This paper presents the preliminary results of an investigation to obtain elevation data from stereo pairs of SIR-B images. First, the accuracy with which elevation information can be derived from SIR-B image pairs is evaluated theoretically. It is shown that elevation accuracy is a function of the slant range resolution, the incidence angles with which the stereo pair is obtained, the accuracies in spacecraft state estimation, and determination of corresponding pixels in the stereo pair. Next, a hierarchical method is developed to match the corresponding pixels. This method involves iterative removal of local distortions and correlations of pairs of local neighborhoods in the two images. Since it is necessary to perform the matching at every pixel in the image, it is very computationally intensive. Therefore, it has been implemented on the Massively Parallel Processor (MPP) at the Goddard Space Flight Center (GSFC). The MPP's speed permits two iterations of this technique to operate on a pair of 512 x 512 images within 7 s. Results of applying this algorithm of SIR-B images of Mount Shasta, CA, are shown. The matching algorithm performs well in regions of the image with significant features. An approximate elevation image derived from the matching process corresponds to published topographic map data, except for certain obvious discontinuities.

Ramapriyan, H. K.↗

Solving Finite-Element Problems on a Concurrent Processor

By use of "conjugate gradients" technique, concurrent efficiency greater than 90 percent. Algorithm applies method of conjugate gradients to iterative solution of finite-element problems on concurrent processor. With algorithm, iteration rates nearly proportional to number of processors. For sufficiently large problems, fraction of proportional speedup achieved, called concurrent efficiency, exceeds 90 percent. Results indicate future application of this and related algorithms to large finite-element problems depend primarily upon applicability of iteratiave techniques, not upon issues of concurrency or efficiency.

Lyzenga, G. A.↗

An efficient method for solving the steady Euler equations

An efficient numerical procedure for solving a set of nonlinear partial differential equations is given, specifically for the steady Euler equations. Solutions of the equations were obtained by Newton's linearization procedure, commonly used to solve the roots of nonlinear algebraic equations. In application of the same procedure for solving a set of differential equations we give a theorem showing that a quadratic convergence rate can be achieved. While the domain of quadratic convergence depends on the problems studied and is unknown a priori, we show that firstand second-order derivatives of flux vectors determine whether the condition for quadratic convergence is satisfied. The first derivatives enter as an implicit operator for yielding new iterates and the second derivatives indicates smoothness of the flows considered. Consequently flows involving shocks are expected to require larger number of iterations. First-order upwind discretization in conjunction with the Steger-Warming flux-vector splitting is employed on the implicit operator and a diagonal dominant matrix results. However the explicit operator is represented by first- and seond-order upwind differencings, using both Steger-Warming's and van Leer's splittings. We discuss treatment of boundary conditions and solution procedures for solving the resulting block matrix system. With a set of test problems for one- and two-dimensional flows, we show detailed study as to the efficiency, accuracy, and convergence of the present method.

Liou, M. S.↗

Application of viscous-inviscid interaction methods to transonic turbulent flows

Two different viscous-inviscid interaction schemes were developed for the analysis of steady, turbulent, transonic, separated flows over axisymmetric bodies. The viscous and inviscid solutions are coupled through the displacement concept using a transpiration velocity approach. In the semi-inverse interaction scheme, the viscous and inviscid equations are solved in an explicitly separate manner and the displacement thickness distribution is iteratively updated by a simple coupling algorithm. In the simultaneous interaction method, local solutions of viscous and inviscid equations are treated simultaneously, and the displacement thickness is treated as an unknown and is obtained as a part of the solution through a global iteration procedure. The inviscid flow region is described by a direct finite-difference solution of a velocity potential equation in conservative form. The potential equation is solved on a numerically generated mesh by an approximate factorization (AF2) scheme in the semi-inverse interaction method and by a successive line overrelaxation (SLOR) scheme in the simultaneous interaction method. The boundary-layer equations are used for the viscous flow region. The continuity and momentum equations are solved inversely in a coupled manner using a fully implicit finite-difference scheme.

Lee, D.↗

Experiences performing conceptual design optimization of transport aircraft

Optimum Preliminary Design of Transports (OPDOT) is a computer program developed at NASA Langley Research Center for evaluating the impact of new technologies upon transport aircraft. For example, it provides the capability to look at configurations which have been resized to take advantage of active controls and provide and indication of economic sensitivity to its use. Although this tool returns a conceptual design configuration as its output, it does not have the accuracy, in absolute terms, to yield satisfactory point designs for immediate use by aircraft manufacturers. However, the relative accuracy of comparing OPDOT-generated configurations while varying technological assumptions has been demonstrated to be highly reliable. Hence, OPDOT is a useful tool for ascertaining the synergistic benefits of active controls, composite structures, improved engine efficiencies and other advanced technological developments. The approach used by OPDOT is a direct numerical optimization of an economic performance index. A set of independent design variables is iterated, given a set of design constants and data. The design variables include wing geometry, tail geometry, fuselage size, and engine size. This iteration continues until the optimum performance index is found which satisfies all the constraint functions. The analyst interacts with OPDOT by varying the input parameters to either the constraint functions or the design constants. Note that the optimization of aircraft geometry parameters is equivalent to finding the ideal aircraft size, but with more degrees of freedom than classical design procedures will allow.

Arbuckle, P. D.↗

Optimization applications in aircraft engine design and test

Starting with the NASA-sponsored STAEBL program, optimization methods based primarily upon the versatile program COPES/CONMIN were introduced over the past few years to a broad spectrum of engineering problems in structural optimization, engine design, engine test, and more recently, manufacturing processes. By automating design and testing processes, many repetitive and costly trade-off studies have been replaced by optimization procedures. Rather than taking engineers and designers out of the loop, optimization has, in fact, put them more in control by providing sophisticated search techniques. The ultimate decision whether to accept or reject an optimal feasible design still rests with the analyst. Feedback obtained from this decision process has been invaluable since it can be incorporated into the optimization procedure to make it more intelligent. On several occasions, optimization procedures have produced novel designs, such as the nonsymmetric placement of rotor case stiffener rings, not anticipated by engineering designers. In another case, a particularly difficult resonance contraint could not be satisfied using hand iterations for a compressor blade, when the STAEBL program was applied to the problem, a feasible solution was obtained in just two iterations.

Pratt, T. K.↗

Optimization methods and silicon solar cell numerical models

The goal of this project is the development of an optimization algorithm for use with a solar cell model. It is possible to simultaneously vary design variables such as impurity concentrations, front junction depth, back junctions depth, and cell thickness to maximize the predicted cell efficiency. An optimization algorithm has been developed and interfaced with the Solar Cell Analysis Program in 1 Dimension (SCAPID). SCAPID uses finite difference methods to solve the differential equations which, along with several relations from the physics of semiconductors, describe mathematically the operation of a solar cell. A major obstacle is that the numerical methods used in SCAPID require a significant amount of computer time, and during an optimization the model is called iteratively until the design variables converge to the value associated with the maximum efficiency. This problem has been alleviated by designing an optimization code specifically for use with numerically intensive simulations, to reduce the number of times the efficiency has to be calculated to achieve convergence to the optimal solution. Adapting SCAPID so that it could be called iteratively by the optimization code provided another means of reducing the cpu time required to complete an optimization. Instead of calculating the entire I-V curve, as is usually done in SCAPID, only the efficiency is calculated (maximum power voltage and current) and the solution from previous calculations is used to initiate the next solution.

Girardini, K.↗

Photometric properties of lunar terrains derived from Hapke's equation

Hapke's bidirectional reflectance equations provide the most rigorous available description of photometric behavior in terms of physically meaningful parameters. The primary objective of this study was to derive Hapke parameters for the lunar surface from both disk-integrated and disk-resolved photometric data. Hapke's equation was fit to the disk-integrated phase curves and disk-resolved data for dark, average, and bright terrain classes using an iterative, nonlinear least squares algorithm described by Helfenstein. Parameters were initially determined from the disk-integrated data, and the result was applied as a first guess to the iterative solution of parameters for individual terrain classes. Plots are presented of the disk-resolved data normalized to corresponding brightnesses predicted from the disk-integrated solution under the same illumination and viewing geometries. Systematic trends in disk-resolved parameters can be identified. Values for single scattering albedo (w) of the dominantly anorthositic average and bright terrains are significantly larger than the value for the basaltic dark terrains (mare). Values for surge brightness parameters, particle phase function, and average topographic slope angle are also discussed.

Helfenstein, Paul↗

Inelastic strain analogy for piecewise linear computation of creep residues in built-up structures

An analogy between inelastic strains caused by temperature and those caused by creep is presented in terms of isotropic elasticity. It is shown how the theoretical aspects can be blended with existing finite-element computer programs to exact a piecewise linear solution. The creep effect is determined by using the thermal stress computational approach, if appropriate alterations are made to the thermal expansion of the individual elements. The overall transient solution is achieved by consecutive piecewise linear iterations. The total residue caused by creep is obtained by accumulating creep residues for each iteration and then resubmitting the total residues for each element as an equivalent input. A typical creep law is tested for incremental time convergence. The results indicate that the approach is practical, with a valid indication of the extent of creep after approximately 20 hr of incremental time. The general analogy between body forces and inelastic strain gradients is discussed with respect to how an inelastic problem can be worked as an elastic problem.

Jenkins, Jerald M.↗

Development of a stereo analysis algorithm for generating topographic maps using interactive techniques of the MPP

A local area matching algorithm was developed on the Massively Parallel Processor (MPP). It is an iterative technique that first matches coarse or low resolution areas and at each iteration performs matches of higher resolution. Results so far show that when good matches are possible in the two images, the MPP algorithm matches corresponding areas as well as a human observer. To aid in developing this algorithm, a control or shell program was developed for the MPP that allows interactive experimentation with various parameters and procedures to be used in the matching process. (This would not be possible without the high speed of the MPP). With the system, optimal techniques can be developed for different types of matching problems.

Strong, James P.↗

Preconditioning matrices for Chebyshev derivative operators

The problem of preconditioning the matrices arising from pseudo-spectral Chebyshev approximations of first order operators is considered in both one and two dimensions. In one dimension a preconditioner represented by a full matrix which leads to preconditioned eigenvalues that are real, positive, and lie between 1 and pi/2, is already available. Since there are cases in which it is not computationally convenient to work with such a preconditioner, a large number of preconditioners were studied which were more sparse (in particular three and four diagonal matrices). The eigenvalues of such preconditioned matrices are compared. The results were applied to the problem of finding the steady state solution to an equation of the type u sub t = u sub x + f, where the Chebyshev collocation is used for the spatial variable and time discretization is performed by the Richardson method. In two dimensions different preconditioners are proposed for the matrix which arises from the pseudo-spectral discretization of the steady state problem. Results are given for the CPU time and the number of iterations using a Richardson iteration method for the unpreconditioned and preconditioned cases.

Rothman, Ernest E.↗

A new art code for tomographic interferometry

A new algebraic reconstruction technique (ART) code based on the iterative refinement method of least squares solution for tomographic reconstruction is presented. Accuracy and the convergence of the technique is evaluated through the application of numerically generated interferometric data. It was found that, in general, the accuracy of the results was superior to other reported techniques. The iterative method unconditionally converged to a solution for which the residual was minimum. The effects of increased data were studied. The inversion error was found to be a function of the input data error only. The convergence rate, on the other hand, was affected by all three parameters. Finally, the technique was applied to experimental data, and the results are reported.

Tan, H.↗

Migration of the separation point on a deforming cylinder

An iterative scheme of solving the Navier-Stokes equations for unsteady two-dimensional flow about a deforming and translating cylinder is given. In the kth iteration, the convected vorticity appears as the source term in an equation of transient diffusion of vorticity. A novel integral transform is used to reduce this transient vorticity equation to a k-dimensional heat equation. The bounded solution of this equation is obtained with a general method of superposition for problems involving a moving boundary. An equation describing the migration of the separation point on a deforming cylinder in unsteady cross flows is derived from the analytically obtained velocity field. The radial expansion of the cylinder surface is shown to hasten the separation time and to increase the separation angle. The results imply that in the steady flow past a body that is moving forward and sinking at constant rates, the locus of points at which the azimuthal component of skin friction changes sign originates on the leeward ray at a point downstream of the front tip.

Lin, S. P.↗

Experience in grid optimization

Two optimization methods for solving a variational problem in grid generation are described and evaluated. The smoothness, cell volumes, and orthogonality of the variational integrals are examined. The Jacobi-Newton iterative method is compared to the Fletcher-Reeves conjugate gradient method. It is observed that a combination of the Jacobi-Newton iteration and the direct solution of the variational problem produces an algorithm which is easy to program and requires less storage and computer time/iteration than the conjugate gradient method.

Mastin, C. W.↗