SEARCH · Engineering Papers
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.
Computerized analysis of seal temperature, elastic displacements and seal force balance in iterative design method for gas turbine mainshaft seals
Global convergence of iterative schemes by Newton-Gauss-Seidel method, considering discrete approximations of elliptic partial differential equations
A Newton-Raphson method of iteration was used in evaluating the radial and axial projection of the distance between the ball center and the outer raceway groove curvature center (V and W). Fatigue life evaluations were made. The similar analysis of a conventional bearing can be directly obtained from the arched bearing analysis by simply letting the amount of arching be zero (g = 0) and not considering equations related to the unloaded half of the outer race. The analysis was applied to a 150-mm angular contact ball bearing. Results for life, contact loads, and angles are shown for a conventional bearing (g = 0) and two arched bearings (g = 0.127 mm (0.005 in.), and 0.254 mm (0.010 in.)). The results indicate that an arched bearing is highly desirable for high speed applications. In particular, for a DN value of 3 million (20,000 rpm) and an applied axial load of 4448 N (1000 lb), an arched bearing shows an improvement in life of 306 percent over that of a conventional bearing. At 4.2 million DN (28,000 rpm), the corresponding improvement is 340 percent. It was also found for low speeds, the arched bearing does not offer the advantages that it does for high speed applications.
In theories of numerical stability, roots to a characteristic polynomial are sought, which, in the case of the predictor with iterative correction method of numerical integration, are eigenvalues of a matrix whose elements depend on the coefficients used in the integration process. The characteristic polynomial is displayed explicitly in terms of the elements of the characteristic matrix.
An iterative computer method is described for identifying boiler transfer functions using frequency response data. An objective penalized performance measure and a nonlinear minimization technique are used to cause the locus of points generated by a transfer function to resemble the locus of points obtained from frequency response measurements. Different transfer functions can be tried until a satisfactory empirical transfer function of the system is found. To illustrate the method, some examples and some results from a study of a set of data consisting of measurements of the inlet impedance of a single tube forced flow boiler with inserts are given.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.