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 505 records · Page 28

Analysis of an arched outer-race ball bearing considering centrifugal forces.

Thrust-load analysis of a 150-mm angular contact ball bearing, taking into account centrifugal forces but omitting gyroscopics, elastohydrodynamics, and thermal effects. A Newton-Raphson method of iteration is used to evaluate the radial and axial projection of the distance between the ball center and the outer raceway groove curvature center. Fatigue life of the bearing is evaluated. Results for life, contact loads, and angles are given for a conventional bearing and two arched bearings.

Hamrock, B. J.↗

Finite element stress analysis of polymers at high strains

A numerical analysis is presented for the problem of a flat rectangular rubber membrane with a circular rigid inclusion undergoing high strains due to the action of an axial load. The neo-hookean constitutive equations are introduced into the general purpose TITUS program by means of equivalent hookean constants and initial strains. The convergence is achieved after a few iterations. The method is not limited to any specific program. The results are in good agreement with those of a company sponsored photoelastic stress analysis. The theoretical and experimental deformed shapes also agree very closely with one another. For high strains it is demonstrated that using the conventional HOOKE law the stress concentration factor obtained is unreliable in the case of rubberlike material.

Durand, M.↗

On optimal soft-decision demodulation

A necessary condition is derived for optimal J-ary coherent demodulation of M-ary (M greater than 2) signals. Optimality is defined as maximality of the symmetric cutoff rate of the resulting discrete memoryless channel. Using a counterexample, it is shown that the condition derived is generally not sufficient for optimality. This condition is employed as the basis for an iterative optimization method to find the optimal demodulator decision regions from an initial 'good guess'. In general, these regions are found to be bounded by hyperplanes in likelihood space; the corresponding regions in signal space are found to have hyperplane asymptotes for the important case of additive white Gaussian noise. Some examples are presented, showing that the regions in signal space bounded by these asymptotic hyperplanes define demodulator decision regions that are virtually optimal.

Lee, L.-N.↗

Elliptic integral solutions to a class of space flight optimization problems

This paper is initially concerned with the minimum-time, exoatmospheric flight of a rocket with constant thrust acceleration magnitude, as in the cases of nuclear and solar electric propulsion. Gravitational acceleration is assumed to be a constant scalar multiple of the radius vector, plus a correction term which is a given function of time. The solution to the state equations is obtained in terms of elliptic integrals. A method is presented for the solution of the two-point boundary-condition problem associated with orbital transfer. At most, the latter method requires iteration upon final time, angle of injection, and two other parameters which are bounded. An example problem is provided which involves a rocket with very low thrust and a spiraling trajectory of many revolutions, but an altitude change of only several hundred miles above the earth. Finally, the original elliptic integral solution is extended to a larger class of low and intermediate thrust problems with constant thrust magnitude, mass decreasing with time, and an inverse square gravitational force.

Andrus, J. F.↗

Phased models for evaluating the performability of computing systems

A phase-by-phase modelling technique is introduced to evaluate a fault tolerant system's ability to execute different sets of computational tasks during different phases of the control process. Intraphase processes are allowed to differ from phase to phase. The probabilities of interphase state transitions are specified by interphase transition matrices. Based on constraints imposed on the intraphase and interphase transition probabilities, various iterative solution methods are developed for calculating system performability.

Wu, L. T.↗

Theoretical study of collinear Be + FH/nu1/ yields BeF/nu2/ + H

The potential energy surface for collinear Be + FH yields BeF + H was studied at various levels of ab initio approximation. A final surface was obtained from a first order configuration interaction wave function, using the iterative orbital method and a medium-sized basis of Slater atomic functions. The exothermicity is computed to be 6 kcal/mole; the barrier height is predicted to be about 28 kcal/mole at a geometry where both internuclear separations are extended by about 0.4 bohr from their asymptotic equilibrium values. This surface differs qualitatively from simple LEPS models.

Schor, H.↗

Non-Gaussian statistical models of surface wave fields for remote sensing applications

Based on the complete Stokes wave model with the bias term and using a simple mapping approach and an iteration solution method, we established a formula for the joint probability density function of the surface slope elevation of a nonlinear random wave field. The formula requires three parameters to define the whole density function: the rms surface elevation and slope values and the significant slope. This model represents the dynamics of the wave in a more direct way than the Gram-Charlier approximation. Based on this new statistical model and laboratory experiments, formula and numerical values of EM bias and dynamics bias are derived. The results indicate that various biases should be considered seriously if accuracy of the altimeter measurement is required in centimeter range.

Huang, N. E.↗

A model of asynchronous iterative algorithms for solving large, sparse, linear systems

Solving large, sparse, linear systems of equations is one of the fundamental problems in large scale scientific and engineering computation. A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. This model is then analyzed to determine the expected intertask data transfer and task computational complexity as functions of the number of tasks. Based on the analysis, recommendations for task partitioning are made. These recommendations are a function of the sparseness of the linear system, its structure (i.e., randomly sparse or banded), and dimension.

Reed, D. A.↗

Parametric study of turbine blade platform friction damping using the lumped parameter analysis

The hardware configuration used in the present study of turbine blade planform friction damping, by means of the lumped parameter analysis, is the first turbine stage of the Space Shuttle Main Engine's High Pressure Fuel Turbopump. The analysis procedure solves the nonlinear equations of motion for a turbine blade that is acted on by a platform friction damper, using an iterative matrix method. Attention is given to the effects on blade deflection response of variations in friction coefficient, the normal force on the friction surface interface, blade hysteretic damping, the blade-to-blade phase angle of the harmonic forcing function, and the amplitude of the forcing function.

Dominic, R. J.↗

Parallel, iterative solution of sparse linear systems: Models and architectures

A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication. The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed.

Reed, D. A.↗

Parallel, iterative solution of sparse linear systems - Models and architectures

Solving large, sparse, linear systems of equations is a fundamental problem in large scale scientific and engineering computation. A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication. The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed.

Reed, D. A.↗

Design of suboptimal regulators for nonlinear systems

An optimal feedback control law is preferred for the regulation of a deterministic nonlinear system. In this paper, a practical, iterative design method leading to a sequence of suboptimal control laws with successively improved performance is presented. The design method requires the determination of an upper bound to the performance of each successive control law. This is obtained by solving a partial differential inequality by means of a linear programming technique. Robustness properties and the application of the design method to the control of a robot manipulator arm are also presented.

Balaram, J.↗

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

Compressible flow calculations employing the Galerkin/least-squares method

A multielement group, domain decomposition algorithm is presented for solving linear nonsymmetric systems arising in the finite-element analysis of compressible flows employing the Galerkin/least-squares method. The iterative strategy employed is based on the generalized minimum residual (GMRES) procedure originally proposed by Saad and Shultz. Two levels of preconditioning are investigated. Applications to problems of high-speed compressible flow illustrate the effectiveness of the scheme.

Shakib, F.↗

A numerical study of two-dimensional vortex shedding from rectangular cylinders

An efficient time-marching, non-iterative calculation method is used to analyze time-dependent flows around rectangular cylinders. The turbulent flow in the wake region of a square section cylinder is analyzed using an anisotropic k-epsilon model. Initiation and subsequent development of the vortex shedding phenomenon is naturally captured once a perturbation is introduced in the flow. Transient calculations using standard eddy-viscosity and an anisotropic k-epsilon model averaged over an integral number of cycles to get the fluctuating energy (organized and turbulent) are compared with experimental data. It is shown that the anisotropic k-epsilon model resolves the anisotropy of the Reynolds stresses and gives mean energy distribution closer to the experiment than the standard k-epsilon model.

Hadid, A. H.↗

Steady induction effects in geomagnetism. Part 1B: Geomagnetic estimation of steady surficial core motions: A non-linear inverse problem

The problem of estimating a steady fluid velocity field near the top of Earth's core which induces the secular variation (SV) indicated by models of the observed geomagnetic field is examined in the source-free mantle/frozen-flux core (SFI/VFFC) approximation. This inverse problem is non-linear because solutions of the forward problem are deterministically chaotic. The SFM/FFC approximation is inexact, and neither the models nor the observations they represent are either complete or perfect. A method is developed for solving the non-linear inverse motional induction problem posed by the hypothesis of (piecewise, statistically) steady core surface flow and the supposition of a complete initial geomagnetic condition. The method features iterative solution of the weighted, linearized least-squares problem and admits optional biases favoring surficially geostrophic flow and/or spatially simple flow. Two types of weights are advanced radial field weights for fitting the evolution of the broad-scale portion of the radial field component near Earth's surface implied by the models, and generalized weights for fitting the evolution of the broad-scale portion of the scalar potential specified by the models.

Voorhies, Coerte V.↗

An engineering code to analyze hypersonic thermal management systems

Thermal loads on current and future aircraft are increasing and as a result are stressing the energy collection, control, and dissipation capabilities of current thermal management systems and technology. The thermal loads for hypersonic vehicles will be no exception. In fact, with their projected high heat loads and fluxes, hypersonic vehicles are a prime example of systems that will require thermal management systems (TMS) that have been optimized and integrated with the entire vehicle to the maximum extent possible during the initial design stages. This will not only be to meet operational requirements, but also to fulfill weight and performance constraints in order for the vehicle to takeoff and complete its mission successfully. To meet this challenge, the TMS can no longer be two or more entirely independent systems, nor can thermal management be an after thought in the design process, the typical pervasive approach in the past. Instead, a TMS that was integrated throughout the entire vehicle and subsequently optimized will be required. To accomplish this, a method that iteratively optimizes the TMS throughout the vehicle will not only be highly desirable, but advantageous in order to reduce the manhours normally required to conduct the necessary tradeoff studies and comparisons. A thermal management engineering computer code that is under development and being managed at Wright Laboratory, Wright-Patterson AFB, is discussed. The primary goal of the code is to aid in the development of a hypersonic vehicle TMS that has been optimized and integrated on a total vehicle basis.

Vangriethuysen, Valerie J.↗

Feasibility study of a synthesis procedure for array feeds to improve radiation performance of large distorted reflector antennas

There were several tangible products that resulted from the reflector antenna research program. The initial technical effort was to develop techniques to compensate for distortions over the surface of the main reflector of a large reflector antenna system. An in-depth investigation of this problem resulted in a new technique for the electronic correction of surface errors. A journal article on the findings describe the use of the iterative sampling method. Shortly after the 'Mission to Planet Earth' program started, we began investigating the use of large reflector antennas in geostationary orbit for passive earth remote sensing. A study panel was coordinated by Virginia Tech to set technical goals for the effort. These were used to guide the design of several antennas. The original interest stemmed from an industrial (Reynolds Metals) need and currently involves work with industry (Prodelin Corporation) on high technology, low cost reflectors. The intervening years (1987 - 1993) is the period of this report and Virginia Tech's reflector antenna activity then was exclusively with NASA LaRC.

Stutzman, W. L.↗