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 577 records · Page 32

Numerical solution of Euler's equation by perturbed functionals

A perturbed functional iteration has been developed to solve nonlinear systems. It adds at each iteration level, unique perturbation parameters to nonlinear Gauss-Seidel iterates which enhances its convergence properties. As convergence is approached these parameters are damped out. Local linearization along the diagonal has been used to compute these parameters. The method requires no computation of Jacobian or factorization of matrices. Analysis of convergence depends on properties of certain contraction-type mappings, known as D-mappings. In this article, application of this method to solve an implicit finite difference approximation of Euler's equation is studied. Some representative results for the well known shock tube problem and compressible flows in a nozzle are given.

Dey, S. K.↗

Larger Convergence Zones for Newton's Method

Iterative technique applies over wider range of initial guesses. New theorem describes convergence zone of Newton's iterative method for finding zeros of real function. Involves two points, Xp and Xp*, called primary conjugate points. If exact solution lies between these points (Xp is less than Xz is less than Xp*) and no other conjugate points in interval, then according to theorem, subsequent iterations will converge upon exact solution if initial guess lies in interval.

Campbell, C. W.↗

Multigrid methods in structural mechanics

Although the application of multigrid methods to the equations of elasticity has been suggested, few such applications have been reported in the literature. In the present work, multigrid techniques are applied to the finite element analysis of a simply supported Bernoulli-Euler beam, and various aspects of the multigrid algorithm are studied and explained in detail. In this study, six grid levels were used to model half the beam. With linear prolongation and sequential ordering, the multigrid algorithm yielded results which were of machine accuracy with work equivalent to 200 standard Gauss-Seidel iterations on the fine grid. Also with linear prolongation and sequential ordering, the V(1,n) cycle with n greater than 2 yielded better convergence rates than the V(n,1) cycle. The restriction and prolongation operators were derived based on energy principles. Conserving energy during the inter-grid transfers required that the prolongation operator be the transpose of the restriction operator, and led to improved convergence rates. With energy-conserving prolongation and sequential ordering, the multigrid algorithm yielded results of machine accuracy with a work equivalent to 45 Gauss-Seidel iterations on the fine grid. The red-black ordering of relaxations yielded solutions of machine accuracy in a single V(1,1) cycle, which required work equivalent to about 4 iterations on the finest grid level.

Raju, I. S.↗

Hierarchial implicit dynamic least-square solution algorithm

This paper develops an implicit type transient solution strategy which possesses hierarchial levels of application. In particular, due to the manner of formulation, stiffness updating, assembly inversion, solution constraint, as well as iteration are all performed at a localized level. The level of iterative calculations depends on the type of hierarchial partitioning employed, namely degree of freedom, nodal, elemental, material/nonlinear group, substructural, and so on. Since the iterative solution process and application of constraints are applied at a local level, the resulting so-called hierarchial implicit solution algorithm possesses very stable and efficient numerical properties and is highly storage efficient. To demonstrate the scheme, the results of several benchmark examples are presented. These enable comparisons with the Newton-Raphson solved implicit transient solution method. Overall the comparisons illustrate the superior stability and efficiency of the hierarchial scheme.

Padovan, J.↗

Efficient solutions to the Euler equations for supersonic flow with embedded subsonic regions

A line Gauss-Seidel (LGS) relaxation algorithm in conjunction with a one-parameter family of upwind discretizations of the Euler equations in two dimensions is described. Convergence of the basic algorithm to the steady state is quadratic for fully supersonic flows and is linear for other flows. This is in contrast to the block alternating direction implicit methods (either central or upwind differenced) and the upwind biased relaxation schemes, all of which converge linearly, independent of the flow regime. Moreover, the algorithm presented herein is easily coupled with methods to detect regions of subsonic flow embedded in supersonic flow. This allows marching by lines in the supersonic regions, converging each line quadratically, and iterating in the subsonic regions, and yields a very efficient iteration strategy. Numerical results are presented for two-dimensional supersonic and transonic flows containing oblique and normal shock waves which confirm the efficiency of the iteration strategy.

Walters, Robert W.↗

Rotor-body coupling revisited

Two analytical procedures are discussed that are currently used to couple rotor and body equations. The first approach, a 'rotor-body iteration' procedure, is often used in flight dynamics simulations. In this approach, acceleration response at the hub interface between the rotor and body are calculated from the body set of equations. These hub acceleration responses are substituted into the rotor set of equations and the remaining rotor acceleration responses are calculated. These rotor responses are used to calculate the rotor hub loads which are transferred back to the body equations to initiate the next iteration. The second method is a 'fully coupled' equations approach that is used in finite element-based analyses. The body and rotor sets of equations are coupled using a kinematic constraint relation at the hub interface. This paper compares the advantages of the two approaches and shows where convergence problems occur in the rotor-body iteration procedure.

Stephens, Wendell B.↗

Vortex breakdown simulation

In this paper, steady, axisymmetric inviscid, and viscous (laminar) swirling flows representing vortex breakdown phenomena are simulated using a stream function-vorticity-circulation formulation and two numerical methods. The first is based on an inverse iteration, where a norm of the solution is prescribed and the swirling parameter is calculated as a part of the output. The second is based on direct Newton iterations, where the linearized equations, for all the unknowns, are solved simultaneously by an efficient banded Gaussian elimination procedure. Several numerical solutions for inviscid and viscous flows are demonstrated, followed by a discussion of the results. Some improvements on previous work have been achieved: first order upwind differences are replaced by second order schemes, line relaxation procedure (with linear convergence rate) is replaced by Newton's iterations (which converge quadratically), and Reynolds numbers are extended from 200 up to 1000.

Hafez, M.↗

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↗

Performance improvement of robots using a learning control scheme

Many applications of robots require that the same task be repeated a number of times. In such applications, the errors associated with one cycle are also repeated every cycle of the operation. An off-line learning control scheme is used here to modify the command function which would result in smaller errors in the next operation. The learning scheme is based on a knowledge of the errors and error rates associated with each cycle. Necessary conditions for the iterative scheme to converge to zero errors are derived analytically considering a second order servosystem model. Computer simulations show that the errors are reduced at a faster rate if the error rate is included in the iteration scheme. The results also indicate that the scheme may increase the magnitude of errors if the rate information is not included in the iteration scheme. Modification of the command input using a phase and gain adjustment is also proposed to reduce the errors with one attempt. The scheme is then applied to a computer model of a robot system similar to PUMA 560. Improved performance of the robot is shown by considering various cases of trajectory tracing. The scheme can be successfully used to improve the performance of actual robots within the limitations of the repeatability and noise characteristics of the robot.

Krishna, Ramuhalli↗

Domain decomposition methods for the parallel computation of reacting flows

Domain decomposition is a natural route to parallel computing for partial differential equation solvers. Subdomains of which the original domain of definition is comprised are assigned to independent processors at the price of periodic coordination between processors to compute global parameters and maintain the requisite degree of continuity of the solution at the subdomain interfaces. In the domain-decomposed solution of steady multidimensional systems of PDEs by finite difference methods using a pseudo-transient version of Newton iteration, the only portion of the computation which generally stands in the way of efficient parallelization is the solution of the large, sparse linear systems arising at each Newton step. For some Jacobian matrices drawn from an actual two-dimensional reacting flow problem, comparisons are made between relaxation-based linear solvers and also preconditioned iterative methods of Conjugate Gradient and Chebyshev type, focusing attention on both iteration count and global inner product count. The generalized minimum residual method with block-ILU preconditioning is judged the best serial method among those considered, and parallel numerical experiments on the Encore Multimax demonstrate for it approximately 10-fold speedup on 16 processors.

Keyes, David E.↗

The solution of linear systems of equations with a structural analysis code on the NAS CRAY-2

Two methods for solving linear systems of equations on the NAS Cray-2 are described. One is a direct method; the other is an iterative method. Both methods exploit the architecture of the Cray-2, particularly the vectorization, and are aimed at structural analysis applications. To demonstrate and evaluate the methods, they were installed in a finite element structural analysis code denoted the Computational Structural Mechanics (CSM) Testbed. A description of the techniques used to integrate the two solvers into the Testbed is given. Storage schemes, memory requirements, operation counts, and reformatting procedures are discussed. Finally, results from the new methods are compared with results from the initial Testbed sparse Choleski equation solver for three structural analysis problems. The new direct solvers described achieve the highest computational rates of the methods compared. The new iterative methods are not able to achieve as high computation rates as the vectorized direct solvers but are best for well conditioned problems which require fewer iterations to converge to the solution.

Poole, Eugene L.↗

A hardware implementation of a relaxation algorithm to segment images

Relaxation labelling is a mathematical technique frequently applied in image processing algorithms. In particular, it is extensively used for the purpose of segmenting images. The paper presents a hardware implementation of a segmentation algorithm, for images consisting of two regions, based on relaxation labelling. The algorithm determines, for each pixel, the probability that it should be labelled as belonging to a particular region, for all regions in the image. The label probabilities (labellings) of every pixel are iteratively updated, based on those of the pixel's neighbors, until they converge. The pixel is then assigned to the region correspondent to the maximum label probability. The system consists of a control unit and of a pipeline of segmentation stages. Each segmentation stage emulates in the hardware an iteration of the relaxation algorithm. The design of the segmentation stage is based on commercially available digital signal processing integrated circuits. Multiple iterations are accomplished by stringing stages together or by looping the output of a stage, or string of stages, to its input. The system interfaces with a generic host computer. Given the modularity of the architecture, performance can be enhanced by merely adding segmentation stages.

Loda, Antonio G.↗

Development of parallel algorithms for electrical power management in space applications

The application of parallel techniques for electrical power system analysis is discussed. The Newton-Raphson method of load flow analysis was used along with the decomposition-coordination technique to perform load flow analysis. The decomposition-coordination technique enables tasks to be performed in parallel by partitioning the electrical power system into independent local problems. Each independent local problem represents a portion of the total electrical power system on which a loan flow analysis can be performed. The load flow analysis is performed on these partitioned elements by using the Newton-Raphson load flow method. These independent local problems will produce results for voltage and power which can then be passed to the coordinator portion of the solution procedure. The coordinator problem uses the results of the local problems to determine if any correction is needed on the local problems. The coordinator problem is also solved by an iterative method much like the local problem. The iterative method for the coordination problem will also be the Newton-Raphson method. Therefore, each iteration at the coordination level will result in new values for the local problems. The local problems will have to be solved again along with the coordinator problem until some convergence conditions are met.

Berry, Frederick C.↗

Two-measured variable method for wall interference assessment/correction

An iterative method for wall interference assessment and/or correction is presented for transonic flow conditions in wind tunnels equipped with two component velocity measurements on a single interface. The iterative method does not require modeling of the test article and tunnel wall boundary conditions. Analytical proof for the convergence and stability of the iterative method is shown in the subsonic flow regime. The numerical solutions are given for both 2-D and axisymmetrical cases at transonic speeds with the application of global Mach number correction.

Lo, C. F.↗

Fast polar decomposition of an arbitrary matrix

The polar decomposition of an m x n matrix A of full rank, where m is greater than or equal to n, can be computed using a quadratically convergent algorithm. The algorithm is based on a Newton iteration involving a matrix inverse. With the use of a preliminary complete orthogonal decomposition the algorithm can be extended to arbitrary A. How to use the algorithm to compute the positive semi-definite square root of a Hermitian positive semi-definite matrix is described. A hybrid algorithm which adaptively switches from the matrix inversion based iteration to a matrix multiplication based iteration due to Kovarik, and to Bjorck and Bowie is formulated. The decision when to switch is made using a condition estimator. This matrix multiplication rich algorithm is shown to be more efficient on machines for which matrix multiplication can be executed 1.5 times faster than matrix inversion.

Higham, Nicholas J.↗

A fully-coupled implicit method for thermo-chemical nonequilibrium air at sub-orbital flight speeds

A CFD technique is described in which the finite-rate chemistry in thermal and chemical nonequilibrium air is fully and implicitly coupled with the fluid motion. Developed for use in the suborbital hypersonic flight speed range, the method accounts for nonequilibrium vibrational and electronic excitation and dissociation, but not ionization. The steady-state solution to the resulting system of equations is obtained by using a lower-upper factorization and symmetric Gauss-Seidel sweeping technique through Newton iteration. Inversion of the left-hand-side matrices is replaced by scalar multiplications through the use of the diagonal dominance algorithm. The code, named CENS2H (Compressible-Euler-Navier-Stokes Two-Dimensional Hypersonic), is fully vectorized and requires about 8.8 x 10 to the -5th sec per node point per iteration using a Cray X-MP computer. Converged solutions are obtained after about 2400 iterations. Sample calculations are made for a circular cylinder and a 10 percent airfoil at 5 deg angle of attack. The calculated cylinder flow field agrees with that obtained experimentally. The code predicts a 10 percent change in lift, drag, and pitching moment for the airfoil due to the thermochemical phenomena.

Park, Chul↗

Payload crew utilization for spacelab missions

Planned payload crew utilization on Spacelab mission are analyzed to establish trends and guidelines. The study included missions that have flow to date as well as those in planning. Available data were analyzed on the basis of four major timeline iterations that occur during mission design. Data were categorized and assessed by crewmember, flight day, and mission. Based on the results of this analysis, it was recommended that for the Requirements Review and Preliminary Design Review iterations the maximum utilization per shift should be 75 percent for the Payload Specialist (PS) and 65 percent for the Mission Specialist (MS); and for the basic and final iterations, the maximum utilization shift should be 85 percent for the PS and 75 percent for the MS. Additional recommendations include limiting the amount of activity during the first two shifts whenever possible and establishing a common set of guidelines for the calculations of crew utilization.

Ibrahim, K. Y.↗

Run-time parallelization and scheduling of loops

Run time methods are studied to automatically parallelize and schedule iterations of a do loop in certain cases, where compile-time information is inadequate. The methods presented involve execution time preprocessing of the loop. At compile-time, these methods set up the framework for performing a loop dependency analysis. At run time, wave fronts of concurrently executable loop iterations are identified. Using this wavefront information, loop iterations are reordered for increased parallelism. Symbolic transformation rules are used to produce: inspector procedures that perform execution time preprocessing and executors or transformed versions of source code loop structures. These transformed loop structures carry out the calculations planned in the inspector procedures. Performance results are presented from experiments conducted on the Encore Multimax. These results illustrate that run time reordering of loop indices can have a significant impact on performance. Furthermore, the overheads associated with this type of reordering are amortized when the loop is executed several times with the same dependency structure.

Saltz, Joel H.↗