Search NASA⌕ Search

SEARCH · Search NASA

Results for “problem”

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 343 records · Page 19

Numerical analysis of some problems related to the mechanics of pneumatic tires: Finite deformation/rolling contact of a viscoelastic cylinder and finite deformation of cord-reinforced rubber composites

The formulation and numerical analysis of several problems related to the behavior of pneumatic tires are considered. These problems include the general rolling contact problem of a rubber-like viscoelastic cylinder undergoing finite deformations and the finite deformation of cord-reinforced rubber composites. New finite element models are developed for these problems. Numerical results obtained for several representative cases are presented.

Oden, J. T.↗

Approximate solutions to minimax optimal control problems for aeroassisted orbital transfer

The maneuver considered in the present investigation involves the coplanar transfer of a spacecraft from a high earth orbit (HEO) to a low earth orbit (LEO). HEO can be a geosynchronous earth orbit (GEO). The basic concept utilized involves the hybrid combination of propulsive maneuvers in space and aerodynamic maneuvers in the sensible atmosphere. The considered type of flight is also called synergetic space flight. With respect to the atmospheric part of the maneuver, trajectory control is achieved by means of lift modulation. The Bolza problem of optimal control is stated, and the first-order optimality conditions for this problem are given. The one-arc approach, the two-arc approach, and the three-subarc approach are discussed. Attention is given to the Chebyshev problem of optimal control, details concerning aeroassisted orbital transfer (AOT), AOT optimization problems, and numerical experiments.

Miele, A.↗

Approximate algorithms for partitioning and assignment problems

The problem of optimally assigning the modules of a parallel/pipelined program over the processors of a multiple computer system under certain restrictions on the interconnection structure of the program as well as the multiple computer system was considered. For a variety of such programs it is possible to find linear time if a partition of the program exists in which the load on any processor is within a certain bound. This method, when combined with a binary search over a finite range, provides an approximate solution to the partitioning problem. The specific problems considered were: a chain structured parallel program over a chain-like computer system, multiple chain-like programs over a host-satellite system, and a tree structured parallel program over a host-satellite system. For a problem with m modules and n processors, the complexity of the algorithm is no worse than O(mnlog(W sub T/epsilon)), where W sub T is the cost of assigning all modules to one processor and epsilon the desired accuracy.

Iqbal, M. A.↗

The crack-inclusion interaction problem

The general plane elastostatic problem of interaction between a crack and an inclusion is considered. The Green's functions for a pair of dislocations and a pair of concentrated body forces are used to generate the crack and the inclusion. Integral equations are obtained for a line crack and an elastic line inclusion having an arbitrary relative orientation and size. The nature of stress singularity around the end points of rigid and elastic inclusions is described and three special cases of this intersection problem are studied. The problem is solved for an arbitrary uniform stress state away from the crack-inclusion region. The nonintersecting crack-inclusion problem is considered for various relative size, orientation, and stiffness parameters, and the stress intensity factors at the ends of the inclusion and the crack are calculated. For the crack-inclusion intersection case, special stress intensity factors are defined and are calculated for various values of the parameters defining the relative size and orientation of the crack and the inclusion and the stiffness of the inclusion.

Liu, X.-H.↗

Mesh-connected processor arrays for the transitive closure problem

The main purpose in this paper is to lay a theoretical foundation for the design of mesh-connected processor arrays for the transitive closure problem. Using a simple path-algebraic formulation of the problem and observing its similarity to certain well-known smoothing problems that occur in digital signal processing, it is shown how to draw upon existing techniques from the signal processing literature to derive regular iterative algorithms for determining the transitive closure of the graph. The regular iterative algorithms that are derived using these considerations, are then analyzed and synthesized on mesh-connected processor arrays. Among the vast number of mesh-connected processor arrays that can be designed using this unified approach, the systolic arrays reported in the literature for this problem are shown to be special cases.

Rao, S. K.↗

The surface crack problem in an orthotropic plate under bending and tension

The elasticity problem for an infinite orthotropic flat plate containing a series of through and part-through cracks and subjected to bending and tension loads is considered. The problem is formulated by using Reissner's plate bending theory and considering three dimensional materials orthotropy. The Line-spring model developed by Rice and Levy is used to formulate the surface crack problem in which a total of nine material constants has been used. The main purpose of this study is to determine the effect of material orthotropy on the stress intensity factors, to investigate the interaction between two asymmetrically arranged collinear cracks, and to provide extensive numerical results regarding the stress intensity factors. The problem is reduced to a system of singular integral equations which is solved by using the Gauss-Chebyshev quadrature formulas. The calculated results show that the material orthotropy does have a significant effect on the stress intensity factor.

Wu, B. H.↗

Tactical missile turbulence problems

Of particular interest is atmospheric turbulence in the atmospheric boundary layer, since this affects both the launch and terminal phase of flight, and the total flight for direct fire systems. Brief discussions are presented on rocket artillery boost wind problems, mean wind correction, turbulent boost wind correction, the Dynamically Aimed Free Flight Rocket (DAFFR) wind filter, the DAFFR test, and rocket wake turbulence problems. It is concluded that many of the turbulence problems of rockets and missiles are common to those of aircraft, such as structural loading and control system design. However, these problems have not been solved at this time.

Dickson, Richard E.↗

Problem size, parallel architecture and optimal speedup

The communication and synchronization overhead inherent in parallel processing can lead to situations where adding processors to the solution method actually increases execution time. Problem type, problem size, and architecture type all affect the optimal number of processors to employ. The numerical solution of an elliptic partial differential equation is examined in order to study the relationship between problem size and architecture. The equation's domain is discretized into n sup 2 grid points which are divided into partitions and mapped onto the individual processor memories. The relationships between grid size, stencil type, partitioning strategy, processor execution time, and communication network type are analytically quantified. In so doing, the optimal number of processors was determined to assign to the solution, and identified (1) the smallest grid size which fully benefits from using all available processors, (2) the leverage on performance given by increasing processor speed or communication network speed, and (3) the suitability of various architectures for large numerical problems.

Nicol, David M.↗

Multigrid methods for bifurcation problems: The self adjoint case

This paper deals with multigrid methods for computational problems that arise in the theory of bifurcation and is restricted to the self adjoint case. The basic problem is to solve for arcs of solutions, a task that is done successfully with an arc length continuation method. Other important issues are, for example, detecting and locating singular points as part of the continuation process, switching branches at bifurcation points, etc. Multigrid methods have been applied to continuation problems. These methods work well at regular points and at limit points, while they may encounter difficulties in the vicinity of bifurcation points. A new continuation method that is very efficient also near bifurcation points is presented here. The other issues mentioned above are also treated very efficiently with appropriate multigrid algorithms. For example, it is shown that limit points and bifurcation points can be solved for directly by a multigrid algorithm. Moreover, the algorithms presented here solve the corresponding problems in just a few work units (about 10 or less), where a work unit is the work involved in one local relaxation on the finest grid.

Taasan, Shlomo↗

Primal and dual formulations of sequential gradient-restoration algorithms for trajectory optimization problems

One of the most effective first-order algorithms for solving trajectory optimization problems is the sequential gradient-restoration algorithm (SGRA). Originally developed in the primal formulation, this algorithm is extended to incorporate a dual formulation. Both the primal formulation and the dual formulation involve a sequence of two-phase cycles, each cycle including a gradient phase and a restoration phase. In turn, each iteration of the gradient phase and the restoration phase requires the solution of an auxiliary minimization problem (AMP). In the primal formulation, the AMP is solved with respect to the variations of the state, the control, and the parameter. In the dual formulation, the AMP is solved with respect to the Lagrange multipliers. A characteristic of the dual formulation is that the AMPs associated with the gradient phase and the restoration phase of SGRA can be reduced to mathematical programming problems involving a finite number of parameters as unknowns. A comparison of the primal formulation and the dual formulation is presented. The comparison is done in terms of several trajectory optimization problems having current aerospace interest.

Miele, A.↗

Dynamic optimization problems with bounded terminal conditions

Bounded terminal conditions of nonlinear optimization problems are converted to equality terminal conditions via Valentine's device. In so doing, additional unknown parameters are introduced into the problem. The transformed problems can still be easily solved using the sequential gradient-restoration algorithm (SGRA) via a simple augmentation of the unknown parameter vector pi. Three example problems with bounded terminal conditions are solved to verify this technique.

Lee, A. Y.↗

On high-continuity transfinite element formulations for linear-nonlinear transient thermal problems

This paper describes recent developments in the applicability of a hybrid transfinite element methodology with emphasis on high-continuity formulations for linear/nonlinear transient thermal problems. The proposed concepts furnish accurate temperature distributions and temperature gradients making use of a relatively smaller number of degrees of freedom; and the methodology is applicable to linear/nonlinear thermal problems. Characteristic features of the formulations are described in technical detail as the proposed hybrid approach combines the major advantages and modeling features of high-continuity thermal finite elements in conjunction with transform methods and classical Galerkin schemes. Several numerical test problems are evaluated and the results obtained validate the proposed concepts for linear/nonlinear thermal problems.

Tamma, Kumar K.↗

Estimates of green tensors for certain boundary value problems

Consider the first boundary value problem for a stationary Navier-Stokes system in a bounded three-dimensional region Omega with the boundary S: delta v = grad p+f, div v=0, v/s=0. Odqvist (1930) developed the potential theory and formulated the Green tensor for the above problem. The basic singular solution used by Odqvist to express the Green tensor is given. A theorem generalizing his results is presented along with four associated theorems. A specific problem associated with the study of the differential properties of the solution of stationary problems of magnetohydrodynamics is examined.

Solonnikov, V.↗

The surface crack problem in an orthotropic plate under bending and tension

The elasticity problem for an infinite orthotropic flat plate containing a series of through and part through cracks and subjected to bending and tension loads is considered. The problem is formulated by using Reissner's plate bending theory and considering three-dimensional material orthotropy. The Line-spring model developed by Rice and Levy is used to formulate the surface crack problem in which a total of nine material constants were used. The effects of material orthotropy on the stress intensity factors was determined, the interaction between two asymmetrically arranged collinear cracks was investigated, and extensive numerical results regarding the stress intensity factors are provided. The problem is reduced to a system of singular integral equations which is solved by using the Gauss-Chebyshev quadrature formulas. The calculated results show that the material orthotropy does have a significant effect on the stress intensity factor.

Wu, Bing-Hua↗

Implementing direct, spatially isolated problems on transputer networks

Parametric studies were performed on transputer networks of up to 40 processors to determine how to implement and maximize the performance of the solution of problems where no processor-to-processor data transfer is required for the problem solution (spatially isolated). Two types of problems are investigated a computationally intensive problem where the solution required the transmission of 160 bytes of data through the parallel network, and a communication intensive example that required the transmission of 3 Mbytes of data through the network. This data consists of solutions being sent back to the host processor and not intermediate results for another processor to work on. Studies were performed on both integer and floating-point transputers. The latter features an on-chip floating-point math unit and offers approximately an order of magnitude performance increase over the integer transputer on real valued computations. The results indicate that a minimum amount of work is required on each node per communication to achieve high network speedups (efficiencies). The floating-point processor requires approximately an order of magnitude more work per communication than the integer processor because of the floating-point unit's increased computing capacity.

Ellis, Graham K.↗

Spectral methods and their implementation to solution of aerodynamic and fluid mechanic problems

Fundamental concepts underlying spectral collocation methods, especially pertaining to their use in the solution of partial differential equations, are outlined. Theoretical accuracy results are reviewed and compared with results from test problems. A number of practical aspects of the construction and use of spectral methods are detailed, along with several solution schemes which have found utility in applications of spectral methods to practical problems. Results from a few of the successful applications of spectral methods to problems of aerodynamic and fluid mechanic interest are then outlined, followed by a discussion of the problem areas in spectral methods and the current research under way to overcome these difficulties.

Streett, C. L.↗

Problem size, parallel architecture, and optimal speedup

The communication and synchronization overhead inherent in parallel processing can lead to situations where adding processors to the solution method actually increases execution time. Problem type, problem size, and architecture type all affect the optimal number of processors to employ. The numerical solution of an elliptic partial differential equation is examined in order to study the relationship between problem size and architecture. The equation's domain is discretized into n sup 2 grid points which are divided into partitions and mapped onto the individual processor memories. The relationships between grid size, stencil type, partitioning strategy, processor execution time, and communication network type are analytically quantified. In so doing, the optimal number of processors was determined to assign to the solution, and identified (1) the smallest grid size which fully benefits from using all available processors, (2) the leverage on performance given by increasing processor speed or communication network speed, and (3) the suitability of various architectures for large numerical problems.

Nicol, David M.↗

Application of fuzzy theories to formulation of multi-objective design problems

Much of the decision making in real world takes place in an environment in which the goals, the constraints, and the consequences of possible actions are not known precisely. In order to deal with imprecision quantitatively, the tools of fuzzy set theory can by used. This paper demonstrates the effectiveness of fuzzy theories in the formulation and solution of two types of helicopter design problems involving multiple objectives. The first problem deals with the determination of optimal flight parameters to accomplish a specified mission in the presence of three competing objectives. The second problem addresses the optimal design of the main rotor of a helicopter involving eight objective functions. A method of solving these multi-objective problems using nonlinear programming techniques is presented. Results obtained using fuzzy formulation are compared with those obtained using crisp optimization techniques. The outlined procedures are expected to be useful in situations where doubt arises about the exactness of permissible values, degree of credibility, and correctness of statements and judgements.

Dhingra, A. K.↗