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 847 records · Page 47

Aerodynamic optimization by simultaneously updating flow variables and design parameters with application to advanced propeller designs

A scheme is developed for solving constrained optimization problems in which the objective function and the constraint function are dependent on the solution of the nonlinear flow equations. The scheme updates the design parameter iterative solutions and the flow variable iterative solutions simultaneously. It is applied to an advanced propeller design problem with the Euler equations used as the flow governing equations. The scheme's accuracy, efficiency and sensitivity to the computational parameters are tested.

Rizk, Magdi H.↗

Efficient numerical techniques for complex fluid flows

The central feature in any flow prediction method is the treatment of the coupling between the momentum and continuity equations. In natural-convection flows, the energy equation also becomes strongly coupled with the momentum equations. Because of the nonlinear nature of the coupling, these equations are solved iteratively. Iterative methods are often prone to slow convergence, divergence, and extreme sensitivity to underrelaxation factors. The aim of the present research is to develop more efficient and reliable solution schemes for the coupled flow equations. Such schemes will significantly reduce the expense of computing complex flows encountered in combustion chambers, gas turbines, heat exchangers, and other practical equipment. In the work completed so far, a technique employing norm reduction in conjunction with the successive-substitution and Newton-Raphson techniques was developed. Also, a block-correction procedure for the flow equations is currently being formulated and tested.

Patankar, Suhas V.↗

Development of generalized block correction procedures for the solution of discretized Navier-Stokes equations

Effort is directed towards developing a solution method which combines advantages of both the iterative and the direct methods. It involves iterative solution on the fine grid, convergence of which is enhanced by a direct solution for correction quantities on a coarse grid. The proposed block correction procedure was applied to compute recirculating flow in a driven cavity.

Kelkar, Kanchan M.↗

Domain decomposition methods for systems of conservation laws: Spectral collocation approximations

Hyperbolic systems of conversation laws are considered which are discretized in space by spectral collocation methods and advanced in time by finite difference schemes. At any time-level a domain deposition method based on an iteration by subdomain procedure was introduced yielding at each step a sequence of independent subproblems (one for each subdomain) that can be solved simultaneously. The method is set for a general nonlinear problem in several space variables. The convergence analysis, however, is carried out only for a linear one-dimensional system with continuous solutions. A precise form of the error reduction factor at each iteration is derived. Although the method is applied here to the case of spectral collocation approximation only, the idea is fairly general and can be used in a different context as well. For instance, its application to space discretization by finite differences is straight forward.

Quarteroni, Alfio↗

Stability and dynamic analysis of a slender column with curved longitudinal stiffeners

The results of a stability design study are presented for a slender column with curved longitudinal stiffeners for large space structure applications. Linear stability analyses are performed using a link-plate representation of the stiffeners to determine stiffener local buckling stresses. Results from a set of parametric analyses are used to determine an approximate explicit expression for stiffener local buckling in terms of its geometric parameters. This expression along with other equations governing column stability and mass are assembled into a determinate system describing minimum mass stiffened column design. An iterative solution is determined to solve this system and a computer program incorporating this routine is presented. Example design problems are presented which verify the solution accuracy and illustrate the implementation of the solution routine. Also, observations are made which lead to a greatly simplified first iteration design equation relating the percent increase in column mass to the percent increase in column buckling load. From this, generalizations are drawn as to the mass savings offered by the stiffened column concept. Finally, the percent increase in fundamental column vibration frequency due to the addition of deployable stiffeners is studied.

Lake, Mark S.↗

Indirect addressing and load balancing for faster solution to Mandelbrot Set on SIMD architectures

SIMD computers with local indirect addressing allow programs to have queues and buffers, making certain kinds of problems much more efficient. Examined here are a class of problems characterized by computations on data points where the computation is identical, but the convergence rate is data dependent. Normally, in this situation, the algorithm time is governed by the maximum number of iterations required by each point. Using indirect addressing allows a processor to proceed to the next data point when it is done, reducing the overall number of iterations required to approach the mean convergence rate when a sufficiently large problem set is solved. Load balancing techniques can be applied for additional performance improvement. Simulations of this technique applied to solving Mandelbrot Sets indicate significant performance gains.

Tomboulian, Sherryl↗

Use of maximum entropy method with parallel processing machine

The maximum entropy method (MEM) and balanced correlation method were used to reconstruct the images of low-intensity X-ray objects obtained experimentally by means of a uniformly redundant array coded aperture system. The reconstructed images from MEM are clearly superior. However, the MEM algorithm is computationally more time-consuming because of its iterative nature. On the other hand, both the inherently two-dimensional character of images and the iterative computations of MEM suggest the use of parallel processing machines. Accordingly, computations were carried out on the massively parallel processor at Goddard Space Flight Center as well as on the serial processing machine VAX 8600, and the results are compared.

Yin, Lo I.↗

Geodetic altitude to a triaxial ellipsoidal planet

An efficient theoretical model for determining geodetic altitudes with better than millimeter accuracy is proposed, with application to the TOPEX/Poseidon project. The triaxial ellipsoidal subsurface point of a satellite is used as the initial trial solution to achieve an efficient and simple iterative solution. It is found that the second-iteration solution is exact to an accuracy of at least 10 to the -9th km.

Tang, Charles C. H.↗

Dewar to dewar model for superfluid helium transfer

A model has been developed to predict the flow of He II between a source and a receiving dewar. The model uses a finite difference aproximation to integrate the describing equations. The transfer path may contain porous plugs or mechanical pumps, heater sections, heat leaks, constrictions due to valves, and bends. These line elements may occur in any order and in any quantity. The line elements are easily reconfigured by changing the input data. The input consists of the number of finite element cells, the pressure in each dewar, the heat input to each section and the dimensions of each section. The output is the temperature, pressure, flow rate, velocities and heat flux in each section. An internal reference table provides the properties of He II. The model is programmed for a LOTUS work sheet. It converges rapidly and usually requires 10 to 15 iterations. For most applications an iteration takes 30 s on an AT. The predictions agree well with experimental data.

Snyder, H. A.↗

Efficient grid generation

The application of a new efficient grid generation method in computational fluid dynamics is discussed. After 100 iterations, final grids were produced in about 110 seconds using a VAX 8650 computer in a time-shared mode. Using a SUN 3/50 workstation, a similar version of the program completed 100 iterations in about 15 minutes.

Gutierrez, Bill↗

A nearly-linear computational-cost scheme for the forward dynamics of an N-body pendulum

The dynamic equations of motion of an n-body pendulum with spherical joints are derived to be a mixed system of differential and algebraic equations (DAE's). The DAE's are kept in implicit form to save arithmetic and preserve the sparsity of the system and are solved by the robust implicit integration method. At each solution point, the predicted solution is corrected to its exact solution within given tolerance using Newton's iterative method. For each iteration, a linear system of the form J delta X = E has to be solved. The computational cost for solving this linear system directly by LU factorization is O(n exp 3), and it can be reduced significantly by exploring the structure of J. It is shown that by recognizing the recursive patterns and exploiting the sparsity of the system the multiplicative and additive computational costs for solving J delta X = E are O(n) and O(n exp 2), respectively. The formulation and solution method for an n-body pendulum is presented. The computational cost is shown to be nearly linearly proportional to the number of bodies.

Chou, Jack C. K.↗

Parallel processing of real-time dynamic systems simulation on OSCAR (Optimally SCheduled Advanced multiprocessoR)

Parallel processing of real-time dynamic systems simulation on a multiprocessor system named OSCAR is presented. In the simulation of dynamic systems, generally, the same calculation are repeated every time step. However, we cannot apply to Do-all or the Do-across techniques for parallel processing of the simulation since there exist data dependencies from the end of an iteration to the beginning of the next iteration and furthermore data-input and data-output are required every sampling time period. Therefore, parallelism inside the calculation required for a single time step, or a large basic block which consists of arithmetic assignment statements, must be used. In the proposed method, near fine grain tasks, each of which consists of one or more floating point operations, are generated to extract the parallelism from the calculation and assigned to processors by using optimal static scheduling at compile time in order to reduce large run time overhead caused by the use of near fine grain tasks. The practicality of the scheme is demonstrated on OSCAR (Optimally SCheduled Advanced multiprocessoR) which has been developed to extract advantageous features of static scheduling algorithms to the maximum extent.

Kasahara, Hironori↗

A transient response analysis of the space shuttle vehicle during liftoff

A proposed transient response method is formulated for the liftoff analysis of the space shuttle vehicles. It uses a power series approximation with unknown coefficients for the interface forces between the space shuttle and mobile launch platform. This allows the equation of motion of the two structures to be solved separately with the unknown coefficients at the end of each step. These coefficients are obtained by enforcing the interface compatibility conditions between the two structures. Once the unknown coefficients are determined, the total response is computed for that time step. The method is validated by a numerical example of a cantilevered beam and by the liftoff analysis of the space shuttle vehicles. The proposed method is compared to an iterative transient response analysis method used by Martin Marietta for their space shuttle liftoff analysis. It is shown that the proposed method uses less computer time than the iterative method and does not require as small a time step for integration. The space shuttle vehicle model is reduced using two different types of component mode synthesis (CMS) methods, the Lanczos method and the Craig and Bampton CMS method. By varying the cutoff frequency in the Craig and Bampton method it was shown that the space shuttle interface loads can be computed with reasonable accuracy. Both the Lanczos CMS method and Craig and Bampton CMS method give similar results. A substantial amount of computer time is saved using the Lanczos CMS method over that of the Craig and Bampton method. However, when trying to compute a large number of Lanczos vectors, input/output computer time increased and increased the overall computer time. The application of several liftoff release mechanisms that can be adapted to the proposed method are discussed.

Brunty, J. A.↗

Parallelization of implicit finite difference schemes in computational fluid dynamics

Implicit finite difference schemes are often the preferred numerical schemes in computational fluid dynamics, requiring less stringent stability bounds than the explicit schemes. Each iteration in an implicit scheme involves global data dependencies in the form of second and higher order recurrences. Efficient parallel implementations of such iterative methods are considerably more difficult and non-intuitive. The parallelization of the implicit schemes that are used for solving the Euler and the thin layer Navier-Stokes equations and that require inversions of large linear systems in the form of block tri-diagonal and/or block penta-diagonal matrices is discussed. Three-dimensional cases are emphasized and schemes that minimize the total execution time are presented. Partitioning and scheduling schemes for alleviating the effects of the global data dependencies are described. An analysis of the communication and the computation aspects of these methods is presented. The effect of the boundary conditions on the parallel schemes is also discussed.

Decker, Naomi H.↗

Finite element solvers for incompressible fluid flows and heat transfer

Two different finite-element solvers for incompressible viscous flow, i.e., the mixed interpolation method and the SIMPLE-type iterative method, are compared and tested with some benchmark problems. The advantages of the SIMPLE-type iterative method are the decoupling of the governing equations and the use of equal-order interpolation functions for both velocity and pressure. Even though there is a significant difference between the two methods in terms of the pressure field, similar solutions are obtained for the velocity field.

Sohn, Jeong L.↗

Investigation of adaptive-wall wind tunnels with two measured interfaces

An adaptive wall wind tunnel with two measured interfaces has been studied using two interface static pressure measurements near the tunnel walls. An iterative procedure with static pressure measurements on two interfaces is described. The functional relationships of static pressure on two measured interfaces for the exterior region are presented. The convergence of the selected iterative procedure is proved analytically. The one-step convergence formulae are obtained and validated by the simulation of a numerical wind tunnel. Experimental investigation has been conducted with a two-dimensional airfoil model of NASA 0012 at a supercritical Mach number. The results have indicated that the selected procedure is feasible to speed up the flow convergence to the unconfined condition in applying the one-step convergence formulae.

Lo, C. F.↗

Counterrotating prop-fan simulations which feature a relative-motion multiblock grid decomposition enabling arbitrary time-steps

Improvements are presented of a computer algorithm developed for the time-accurate flow analysis of rotating machines. The flow model is a finite volume method utilizing a high-resolution approximate Riemann solver for interface flux definitions. The numerical scheme is a block LU implicit iterative-refinement method which possesses apparent unconditional stability. Multiblock composite gridding is used to orderly partition the field into a specified arrangement of blocks exhibiting varying degrees of similarity. Block-block relative motion is achieved using local grid distortion to reduce grid skewness and accommodate arbitrary time step selection. A general high-order numerical scheme is applied to satisfy the geometric conservation law. An even-blade-count counterrotating unducted fan configuration is chosen for a computational study comparing solutions resulting from altering parameters such as time step size and iteration count. The solutions are compared with measured data.

Janus, J. Mark↗

Preconditioned conjugate gradient methods for the compressible Navier-Stokes equations

The compressible Navier-Stokes equations are solved for a variety of two-dimensional inviscid and viscous problems by preconditioned conjugate gradient-like algorithms. Roe's flux difference splitting technique is used to discretize the inviscid fluxes. The viscous terms are discretized by using central differences. An algebraic turbulence model is also incorporated. The system of linear equations which arises out of the linearization of a fully implicit scheme is solved iteratively by the well known methods of GMRES (Generalized Minimum Residual technique) and Chebyschev iteration. Incomplete LU factorization and block diagonal factorization are used as preconditioners. The resulting algorithm is competitive with the best current schemes, but has wide applications in parallel computing and unstructured mesh computations.

Venkatakrishnan, V.↗