Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iteration 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 1,369 records · Page 76

Integral solution of unsteady full-potential equation for a transonic pitching airfoil

The unsteady full-potential equation formulation in a moving frame of reference has been has been developed and used to solve unsteady transonic flow problems. An unsteady integral-equation shock-capturing (IE-SC) scheme has been developed. The resulting unsteady IE-SC scheme is applied to a NACA 0012 airfoil undergoing a pitching oscillation. The numerical results are compared with those of an implicit, approximately factored, finite-volume Euler scheme. The present scheme is efficient in terms of the number of iterations as compared to the other existing schemes, which use finite-difference or finite-volume methods.

Kandil, Osama A.↗

A finite element solver for 3-D compressible viscous flows

Computation of the flow field inside a space shuttle main engine (SSME) requires the application of state of the art computational fluid dynamic (CFD) technology. Several computer codes are under development to solve 3-D flow through the hot gas manifold. Some algorithms were designed to solve the unsteady compressible Navier-Stokes equations, either by implicit or explicit factorization methods, using several hundred or thousands of time steps to reach a steady state solution. A new iterative algorithm is being developed for the solution of the implicit finite element equations without assembling global matrices. It is an efficient iteration scheme based on a modified nonlinear Gauss-Seidel iteration with symmetric sweeps. The algorithm is analyzed for a model equation and is shown to be unconditionally stable. Results from a series of test problems are presented. The finite element code was tested for couette flow, which is flow under a pressure gradient between two parallel plates in relative motion. Another problem that was solved is viscous laminar flow over a flat plate. The general 3-D finite element code was used to compute the flow in an axisymmetric turnaround duct at low Mach numbers.

Reddy, K. C.↗

Algorithms for structural natural-frequency design

The algorithms used in the Jet Propulsion Laboratory (JPL) Iterative Design of Antenna Structures (IDEAS) program are furnished. The algorithms are based upon the operational research method of optimality criteria and the structural analysis method of virtual work. Examples of the natural frequency constrained design of an antenna tripod structure are included.

Levy, R.↗

Design of an H(infinity) optimal controller by using DGKF's state-space formulas

The two-Riccati-equation method was employed to design an H(infinity) optimal controller for a four-block problem. An iterative scheme was used to reduce gamma to a number which is very close to the optimum. However, as gamma is close to the optimum, the elements of the state-space realization of the controller will approach infinity. It is demonstrated that the numerical difficulty is caused by the restriction of the controller being strictly proper. This difficulty can easily be removed if one is allowed to have a proper controller with a direct feed-through term.

Chang, B. C.↗

Algorithms For Segmentation Of Complex-Amplitude SAR Data

Several algorithms implement improved method of segmenting highly speckled, high-resolution, complex-amplitude synthetic-aperture-radar (SAR) digitized images into regions, within each backscattering characteristics similar or homogeneous from place to place. Method provides for approximate, deterministic solution by two alternative algorithms almost always converging to local minimums: one, Iterative Conditional Modes (ICM) algorithm, which locally maximizes posterior probability density of region labels; other, Maximum Posterior Marginal (MPM) algorithm, which maximizes posterior marginal density of region labels at each pixel location. ICM algorithm optimizes reconstruction of underlying scene. MPM algorithm minimizes expected number of misclassified pixels, possibly better in remote sensing of natural scenes.

Rignot, Eric J. M.↗

Program Generates Two-Dimensional Computational Grids

TDIGG is fast and versatile computer program for generating two-dimensional computational grids for use in programs solving equations of flow by finite-difference methods. Both algebraic and elliptic grid-generation systems included. Enables user to view results of each iteration. Written in FORTRAN 77.

Vu, Bruce T.↗

A Diagonal Algorithm for the Method of Pseudocompressibility

The method of pseudocompressibility has been found to be an efficient method for obtaining a steady-state solution to the incompressible Navier-Stokes equations. Recent improvements to this method include the use of a diagonal scheme for the inversion of the equations equations at each iteration. The necessary transformations have been derived for the pseudocompressibility equations in generalized coordinates. The diagonal algorithm reduces the computing time necessary to obtain a steady-state solution by a factor of nearly three. Implicit viscous terms are maintained in the equations, and it has become possible to use fourth-order implicit dissipation. The steady-state solution is unchanged by the approximations resulting from the diagonalization of the equations. Computed results for flow over a two-dimensional backward-facing step and a three-dimensional cylinder mounted normal to a flat plate are presented for both the old and new algorithms. The computing efficiency of these algorithms are compared. Identical solutions are obtained from both algorithms which compare well with experimental results.

Rogers, Stuart E.↗

Constructing a Database from Multiple 2D Images for Camera Pose Estimation and Robot Localization

The LMDB (Landmark Database) Builder software identifies persistent image features (landmarks) in a scene viewed multiple times and precisely estimates the landmarks 3D world positions. The software receives as input multiple 2D images of approximately the same scene, along with an initial guess of the camera poses for each image, and a table of features matched pair-wise in each frame. LMDB Builder aggregates landmarks across an arbitrarily large collection of frames with matched features. Range data from stereo vision processing can also be passed to improve the initial guess of the 3D point estimates. The LMDB Builder aggregates feature lists across all frames, manages the process to promote selected features to landmarks, and iteratively calculates the 3D landmark positions using the current camera pose estimations (via an optimal ray projection method), and then improves the camera pose estimates using the 3D landmark positions. Finally, it extracts image patches for each landmark from auto-selected key frames and constructs the landmark database. The landmark database can then be used to estimate future camera poses (and therefore localize a robotic vehicle that may be carrying the cameras) by matching current imagery to landmark database image patches and using the known 3D landmark positions to estimate the current pose.

Wolf, Michael↗

Autonomous Method and System for Minimizing the Magnitude of Plasma Discharge Current Oscillations in a Hall Effect Plasma Device

An autonomous method for minimizing the magnitude of plasma discharge current oscillations in a Hall effect plasma device includes iteratively measuring plasma discharge current oscillations of the plasma device and iteratively adjusting the magnet current delivered to the plasma device in response to measured plasma discharge current oscillations to reduce the magnitude of the plasma discharge current oscillations.

Hruby, Vladimir↗

An approximate method for calculating three-dimensional inviscid hypersonic flow fields

An approximate solution technique was developed for 3-D inviscid, hypersonic flows. The method employs Maslen's explicit pressure equation in addition to the assumption of approximate stream surfaces in the shock layer. This approximation represents a simplification to Maslen's asymmetric method. The present method presents a tractable procedure for computing the inviscid flow over 3-D surfaces at angle of attack. The solution procedure involves iteratively changing the shock shape in the subsonic-transonic region until the correct body shape is obtained. Beyond this region, the shock surface is determined using a marching procedure. Results are presented for a spherically blunted cone, paraboloid, and elliptic cone at angle of attack. The calculated surface pressures are compared with experimental data and finite difference solutions of the Euler equations. Shock shapes and profiles of pressure are also examined. Comparisons indicate the method adequately predicts shock layer properties on blunt bodies in hypersonic flow. The speed of the calculations makes the procedure attractive for engineering design applications.

Riley, Christopher J.↗

WARP3D-Release 10.8: Dynamic Nonlinear Analysis of Solids using a Preconditioned Conjugate Gradient Software Architecture

This report describes theoretical background material and commands necessary to use the WARP3D finite element code. WARP3D is under continuing development as a research code for the solution of very large-scale, 3-D solid models subjected to static and dynamic loads. Specific features in the code oriented toward the investigation of ductile fracture in metals include a robust finite strain formulation, a general J-integral computation facility (with inertia, face loading), an element extinction facility to model crack growth, nonlinear material models including viscoplastic effects, and the Gurson-Tver-gaard dilatant plasticity model for void growth. The nonlinear, dynamic equilibrium equations are solved using an incremental-iterative, implicit formulation with full Newton iterations to eliminate residual nodal forces. The history integration of the nonlinear equations of motion is accomplished with Newmarks Beta method. A central feature of WARP3D involves the use of a linear-preconditioned conjugate gradient (LPCG) solver implemented in an element-by-element format to replace a conventional direct linear equation solver. This software architecture dramatically reduces both the memory requirements and CPU time for very large, nonlinear solid models since formation of the assembled (dynamic) stiffness matrix is avoided. Analyses thus exhibit the numerical stability for large time (load) steps provided by the implicit formulation coupled with the low memory requirements characteristic of an explicit code. In addition to the much lower memory requirements of the LPCG solver, the CPU time required for solution of the linear equations during each Newton iteration is generally one-half or less of the CPU time required for a traditional direct solver. All other computational aspects of the code (element stiffnesses, element strains, stress updating, element internal forces) are implemented in the element-by- element, blocked architecture. This greatly improves vectorization of the code on uni-processor hardware and enables straightforward parallel-vector processing of element blocks on multi-processor hardware.

Koppenhoefer, Kyle C.↗

Multipoint inverse design of an infinite cascade of airfoils

This paper describes a method for the design of an infinite cascade in incompressible flow. The method is based on conformal mapping and does not allow for multipoint design. The cascade blade is to determined is divided into a number of segments. Over each segment, the velocity distribution is prescribed together with an inlet or outlet flow angle at which this velocity distributions is to be achieved. In this way multipoint design requirements can be met. It is necessary to satisfy several conditions that arise to guarantee compatibility with the inlet and outlet flow as well as closure of the cascade blade. Satisfaction of these conditions does not necessarily result in a cascade with all of the desired characteristucs. For example, the cascade blades may be bulbous or crossed. Through Newtonian iteration, however, the desired characteristics may be prescribed directly. Four examples will be illustrated to demonstrate the capability of the method.

Selig, M. S.↗

Nonlinear aerodynamics and the design of wing tips

This report describes results of research conducted from April 1991 through March 1992. The general objective was to improve an existing wing optimization method, and apply the method to specific problems of interest. The method, while a valuable tool for wing tip design studies, can be applied to more general problems, and has been applied to some of these other problems during its development. Specific goals that were accomplished are listed and explained in more detail in the report. First, improvements were made to the portability and control flow of the existing code. The major iteration loop dealing with structural design was sped up and an alternate approach, using the optimizer to do structural sizing, was studied. Second, analysis methods were improved in the areas of structural and high lift modeling. The structural method was revised to give total wing weight and verified against data for particular commercial aircraft. The high lift analysis was improved to provide reasonable estimates of C(sub L max) in the flaps down condition. These improvements enabled making wing area a design variable, where it had been a fixed variable in the original method. Third, the method was applied to the design of wings for a Learjet. Rough studies were done to determine the effects of laminar flow design on wing shape. Finally, studies on wingtip shape were begun.

Kroo, Ilan↗

Optimal parallel solution of sparse triangular systems

A method for the parallel solution of triangular sets of equations is described that is appropriate when there are many right-handed sides. By preprocessing, the method can reduce the number of parallel steps required to solve Lx = b compared to parallel forward or backsolve. Applications are to iterative solvers with triangular preconditioners, to structural analysis, or to power systems applications, where there may be many right-handed sides (not all available a priori). The inverse of L is represented as a product of sparse triangular factors. The problem is to find a factored representation of this inverse of L with the smallest number of factors (or partitions), subject to the requirement that no new nonzero elements be created in the formation of these inverse factors. A method from an earlier reference is shown to solve this problem. This method is improved upon by constructing a permutation of the rows and columns of L that preserves triangularity and allow for the best possible such partition. A number of practical examples and algorithmic details are presented. The parallelism attainable is illustrated by means of elimination trees and clique trees.

Alvarado, Fernando L.↗

Face- and Cell-Averaged Nodal-Gradient Approach to Cell-Centered Finite-Volume Method on Mixed Grids

In this paper, the averaged nodal-gradient approach previously developed for triangular grids is extended to mixed triangular-quadrilateral grids. It is shown that the face- averaged approach leads to deteriorated iterative convergence on quadrilateral grids. To develop a convergent solver, we consider cell-averaging instead of face-averaging for quadri- lateral cells. We show that the cell-averaged approach leads to a convergent solver and can be efficiently combined with the face-averaged approach on mixed grids. The method is demonstrated for various inviscid and viscous problems from low to high Mach numbers on two-dimensional mixed grids.

Nishikawa, Hiroaki↗

A multi-purpose method for analysis of spur gear tooth loading

A large digitized approach was developed for the static and dynamic load analysis of spur gearing. An iterative procedure was used to calculate directly the "variable-variable" gear mesh stiffness as a function of transmitted load, gear tooth profile errors, gear tooth deflections and gear hub torsional deformation, and position of contacting profile points. The developed approach can be used to analyze the loads, Hertz stresses, and PV for the normal and high contrast ratio gearing, presently the modeling is limited to the condition that for a given gear all teeth have identical spacing and profiles (with or without surface imperfections). Certain types of simulated sinusoidal profile errors and pitting can cause interruptions of the gear mesh stiffness function and, thus, increase the dynamic loads in spur gearing. In addition, a finite element stress and mesh subprogram was developed for future introduction into the main program for calculating the gear tooth bending stresses under dynamic loads.

Kasuba, R.↗

A numerical method for phase-change problems

A highly accurate and efficient finite-difference method for phase-change problems with multiple moving boundaries of irregular shape is developed by employing a coordinate transformation that immobilizes moving boundaries and preserves the conservative forms of the original governing equations. The numerical method is first presented for one-dimensional phase-change problems (involving large density variation between phases, heat generation, and multiple moving boundaries) and then extended to solve two-dimensional problems (without change of densities between phases). Numerical solutions are obtained non-iteratively using an explicit treatment of the interfacial mass and energy balances and an implicit treatment of the temperature field equations. The accuracy and flexibility of the present numerical method are verified by solving some phase-change problems and comparing the results with existing analytical, semi-analytical and numerical solutions. Results indicate that one- and two-dimensional phase-change problems can be handled easily with excellent accuracies.

Kim, Charn-Jung↗

Discrete Fourier Transform in a Complex Vector Space

An image-based phase retrieval technique has been developed that can be used on board a space based iterative transformation system. Image-based wavefront sensing is computationally demanding due to the floating-point nature of the process. The discrete Fourier transform (DFT) calculation is presented in "diagonal" form. By diagonal we mean that a transformation of basis is introduced by an application of the similarity transform of linear algebra. The current method exploits the diagonal structure of the DFT in a special way, particularly when parts of the calculation do not have to be repeated at each iteration to converge to an acceptable solution in order to focus an image.

Dean, Bruce H.↗