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 199 records · Page 11

Existence and non-uniqueness of similarity solutions of a boundary layer problem

A Blasius boundary value problem with inhomogeneous lower boundary conditions f(0) = 0 and f'(0) = - lambda with lambda strictly positive was considered. The Crocco variable formulation of this problem has a key term which changes sign in the interval of interest. It is shown that solutions of the boundary value problem do not exist for values of lambda larger than a positive critical value lambda. The existence of solutions is proven for 0 lambda lambda by considering an equivalent initial value problem. It is found however that for 0 lambda lambda, solutions of the boundary value problem are nonunique. Physically, this nonuniqueness is related to multiple values of the skin friction.

Hussaini, M. Y.↗

Problems experienced and envisioned for dynamical physical systems

The use of high performance systems, which is the trend of future space systems, naturally leads to lower margins and a higher sensitivity to parameter variations and, therefore, more problems of dynamical physical systems. To circumvent dynamic problems of these systems, appropriate design, verification analysis, and tests must be planned and conducted. The basic design goal is to define the problem before it occurs. The primary approach for meeting this goal is a good understanding and reviewing of the problems experienced in the past in terms of the system under design. This paper reviews many of the dynamic problems experienced in space systems design and operation, categorizes them as to causes, and envisions future program implications, developing recommendations for analysis and test approaches.

Ryan, R. S.↗

Partitioning problems in parallel, pipelined and distributed computing

The problem of optimally assigning the modules of a parallel program over the processors of a multiple computer system is addressed. A Sum-Bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple satellite system: partitioning multiple chain structured parallel programs, multiple arbitrarily structured serial programs and single tree structured parallel programs. In addition, the problems of partitioning chain structured parallel programs across chain connected systems and across shared memory (or shared bus) systems are also solved under certain constraints. All solutions for parallel programs are equally applicable to pipelined programs. These results extend prior research in this area by explicitly taking concurrency into account and permit the efficient utilization of multiple computer architectures for a wide range of problems of practical interest.

Bokhari, S.↗

Shifting the closed-loop spectrum in the optimal linear quadratic regulator problem for hereditary systems

In the optimal linear quadratic regulator problem for finite dimensional systems, the method known as an alpha-shift can be used to produce a closed-loop system whose spectrum lies to the left of some specified vertical line; that is, a closed-loop system with a prescribed degree of stability. This paper treats the extension of the alpha-shift to hereditary systems. As infinite dimensions, the shift can be accomplished by adding alpha times the identity to the open-loop semigroup generator and then solving an optimal regulator problem. However, this approach does not work with a new approximation scheme for hereditary control problems recently developed by Kappel and Salamon. Since this scheme is among the best to date for the numerical solution of the linear regulator problem for hereditary systems, an alternative method for shifting the closed-loop spectrum is needed. An alpha-shift technique that can be used with the Kappel-Salamon approximation scheme is developed. Both the continuous-time and discrete-time problems are considered. A numerical example which demonstrates the feasibility of the method is included.

Gibson, J. S.↗

Existence and non-uniqueness of similarity solutions of a boundary-layer problem

A Blasius boundary value problem with inhomogeneous lower boundary conditions f(0) = 0 and f'(0) = - lambda with lambda strictly positive was considered. The Crocco variable formulation of this problem has a key term which changes sign in the interval of interest. It is shown that solutions of the boundary value problem do not exist for values of lambda larger than a positive critical value lambda. The existence of solutions is proven for 0 lambda lambda by considering an equivalent initial value problem. It is found however that for 0 lambda lambda, solutions of the boundary value problem are nonunique. Physically, this nonuniqueness is related to multiple values of the skin friction.

Hussaini, M. Y.↗

Development and application of unified algorithms for problems in computational science

A framework is presented for developing computationally unified numerical algorithms for solving nonlinear equations that arise in modeling various problems in mathematical physics. The concept of computational unification is an attempt to encompass efficient solution procedures for computing various nonlinear phenomena that may occur in a given problem. For example, in Computational Fluid Dynamics (CFD), a unified algorithm will be one that allows for solutions to subsonic (elliptic), transonic (mixed elliptic-hyperbolic), and supersonic (hyperbolic) flows for both steady and unsteady problems. The objectives are: development of superior unified algorithms emphasizing accuracy and efficiency aspects; development of codes based on selected algorithms leading to validation; application of mature codes to realistic problems; and extension/application of CFD-based algorithms to problems in other areas of mathematical physics. The ultimate objective is to achieve integration of multidisciplinary technologies to enhance synergism in the design process through computational simulation. Specific unified algorithms for a hierarchy of gas dynamics equations and their applications to two other areas: electromagnetic scattering, and laser-materials interaction accounting for melting.

Shankar, Vijaya↗

Convenient stability criteria for difference approximations of hyperbolic initial-boundary value problems. II

The results of Goldberg and Tadmor (1985) are extended to achieve improved stability criteria for a large class of approximations to the initial boundary value problem associated with a particular hyperbolic system in a quarter plane. In a stability analysis, it is shown that the entire approximation is stable if and only if the scalar outflow components of its principal part are stable. Thus, the global stability question is reduced to that of a scalar, homogeneous outflow problem. The stability criteria for the reduced problem, which depend both on the basic scheme and the boundary conditions, but very little on the interaction between the two, are stated and used to establish previous examples and new ones, including a host of dissipative and nondissipative examples. There is no difficulty in extending the stability criteria to two-boundary problems and initial-boundary value problems with variable coefficients.

Goldberg, Moshe↗

Shifting the closed-loop spectrum in the optimal linear quadratic regulator problem for hereditary systems

In the optimal linear quadratic regulator problem for finite dimensional systems, the method known as an alpha-shift can be used to produce a closed-loop system whose spectrum lies to the left of some specified vertical line; that is, a closed-loop system with a prescribed degree of stability. This paper treats the extension of the alpha-shift to hereditary systems. As infinite dimensions, the shift can be accomplished by adding alpha times the identity to the open-loop semigroup generator and then solving an optimal regulator problem. However, this approach does not work with a new approximation scheme for hereditary control problems recently developed by Kappel and Salamon. Since this scheme is among the best to date for the numerical solution of the linear regulator problem for hereditary systems, an alternative method for shifting the closed-loop spectrum is needed. An alpha-shift technique that can be used with the Kappel-Salamon approximation scheme is developed. Both the continuous-time and discrete-time problems are considered. A numerical example which demonstrates the feasibility of the method is included.

Gibson, J. S.↗

Principles for problem aggregation and assignment in medium scale multiprocessors

One of the most important issues in parallel processing is the mapping of workload to processors. This paper considers a large class of problems having a high degree of potential fine grained parallelism, and execution requirements that are either not predictable, or are too costly to predict. The main issues in mapping such a problem onto medium scale multiprocessors are those of aggregation and assignment. We study a method of parameterized aggregation that makes few assumptions about the workload. The mapping of aggregate units of work onto processors is uniform, and exploits locality of workload intensity to balance the unknown workload. In general, a finer aggregate granularity leads to a better balance at the price of increased communication/synchronization costs; the aggregation parameters can be adjusted to find a reasonable granularity. The effectiveness of this scheme is demonstrated on three model problems: an adaptive one-dimensional fluid dynamics problem with message passing, a sparse triangular linear system solver on both a shared memory and a message-passing machine, and a two-dimensional time-driven battlefield simulation employing message passing. Using the model problems, the tradeoffs are studied between balanced workload and the communication/synchronization costs. Finally, an analytical model is used to explain why the method balances workload and minimizes the variance in system behavior.

Nicol, David M.↗

MOORE: A prototype expert system for diagnosing spacecraft problems

MOORE is a rule-based, prototype expert system that assists in diagnosing operational Tracking and Data Relay Satellite (TDRS) problems. It is intended to assist spacecraft engineers at the TDRS ground terminal in trouble shooting problems that are not readily solved with routine procedures, and without expert counsel. An additional goal of the prototype system is to develop in-house expert system and knowledge engineering skills. The prototype system diagnoses antenna pointing and earth pointing problems that may occur within the TDRS Attitude Control System (ACS). Plans include expansion to fault isolation of problems in the most critical subsystems of the TDRS spacecraft. Long term benefits are anticipated with use of an expert system during future TDRS programs with increased mission support time, reduced problem solving time, and retained expert knowledge and experience. Phase 2 of the project is intended to provide NASA the necessary expertise and capability to define requirements, evaluate proposals, and monitor the development progress of a highly competent expert system for NASA's Tracking Data Relay Satellite. Phase 2 also envisions addressing two unexplored applications for expert systems, spacecraft integration and tests (I and T) and support to launch activities. The concept, goals, domain, tools, knowledge acquisition, developmental approach, and design of the expert system. It will explain how NASA obtained the knowledge and capability to develop the system in-house without assistance from outside consultants. Future plans will also be presented.

Howlin, Katherine↗

Partitioning problems in parallel, pipelined, and distributed computing

The problem of optimally assigning the modules of a parallel program over the processors of a multiple-computer system is addressed. A sum-bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple-satellite system: partitioning multiple chain-structured parallel programs, multiple arbitrarily structured serial programs, and single-tree structured parallel programs. In addition, the problem of partitioning chain-structured parallel programs across chain-connected systems is solved under certain constraints. All solutions for parallel programs are equally applicable to pipelined programs. These results extend prior research in this area by explicitly taking concurrency into account and permit the efficient utilization of multiple-computer architectures for a wide range of problems of practical interest.

Bokhari, Shahid H.↗

Wave envelope technique for multimode wave guide problems

A numerical solution technique for two-dimensional EM waveguide problems is developed analytically and demonstrated. The frequency-domain waveguide problem is transformed to a time-dependent problem and treated following the limiting-amplitude principle; the wave-envelope technique is applied; and the resulting problem is solved numerically using a finite-difference scheme based on a variation of the finite-area method (Baumeister, 1977 and 1984). Results for several sample problems, obtained in 10 min or less of execution time on PCs, are presented in tables.

Hariharan, S. I.↗

Neighboring extremals of dynamic optimization problems with path equality constraints

Neighboring extremals of dynamic optimization problems with path equality constraints and with an unknown parameter vector are considered in this paper. With some simplifications, the problem is reduced to solving a linear, time-varying two-point boundary-value problem with integral path equality constraints. A modified backward sweep method is used to solve this problem. Two example problems are solved to illustrate the validity and usefulness of the solution technique.

Lee, A. Y.↗

Solution of the Neumann pressure problem in general orthogonal coordinates using the multigrid technique

The multigrid (MG) technique has been advanced for use with Neumann boundary-value problems in clustered curvilinear orthogonal coordinates. This comprises an important step in the analysis of incompressible flow using the velocity-pressure formulation of the Navier-Stokes equations. The finite-difference representation of the problem and the formulation of the restriction and coarse-grid correction operators are examined in detail. Maintaining consistency between these and the integral constraint associated with the Neumann problem is found to be critical for the success of the MG technique. The influence of the smoothing operator is examined by employing Gauss-Seidel, alternating-direction implicit, and strongly implicit techniques. The MG procedure enhances the efficiency of fine-grid solutions of the Neumann problem by a factor of 3 to 14, depending on the type of smoothing operator employed and the values of the problem parameters.

Ghia, U.↗

The problem of clustering in laboratory studies of cometary dust

In trying to understand the nature of interstellar or interplanetary dust grains it is tempting to simply rely on direct lab measurements of grain properties such as extinction. However, until agreement is achieved between directly measured extinction and the same property calculated from measured optical constants of the solid, application to astronomical observations is questionable. There are two major problems which are discussed: the problem of what optical constants to use in the calculation, and the almost unavoidable problem of particle clustering in lab studies. Regarding small particle measurements, a problem afflicting almost all lab measurements is the clustering of particles. Having failed in efforts to isolate particles, the solution to the problem was attempted with a simple theory which seems to adequately describe the extinction by small, clustered particles in many cases. The theory is briefly explained.

Huffman, Donald R.↗

Solutions to time variant problems of real-time expert systems

Real-time expert systems for monitoring and control are driven by input data which changes with time. One of the subtle problems of this field is the propagation of time variant problems from rule to rule. This propagation problem is even complicated under a multiprogramming environment where the expert system may issue test commands to the system to get data and to access time consuming devices to retrieve data for concurrent reasoning. Two approaches are used to handle the flood of input data. Snapshots can be taken to freeze the system from time to time. The expert system treats the system as a stationary one and traces changes by comparing consecutive snapshots. In the other approach, when an input is available, the rules associated with it are evaluated. For both approaches, if the premise condition of a fired rule is changed to being false, the downstream rules should be deactivated. If the status change is due to disappearance of a transient problem, actions taken by the fired downstream rules which are no longer true may need to be undone. If a downstream rule is being evaluated, it should not be fired. Three mechanisms for solving this problem are discussed: tracing, backward checking, and censor setting. In the forward tracing mechanism, when the premise conditions of a fired rule become false, the premise conditions of downstream rules which have been fired or are being evaluated due to the firing of that rule are reevaluated. A tree with its root at the rule being deactivated is traversed. In the backward checking mechanism, when a rule is being fired, the expert system checks back on the premise conditions of the upstream rules that result in evaluation of the rule to see whether it should be fired. The root of the tree being traversed is the rule being fired. In the censor setting mechanism, when a rule is to be evaluated, a censor is constructed based on the premise conditions of the upstream rules and the censor is evaluated just before the rule is fired. Unlike the backward checking mechanism, this one does not search the upstream rules. This paper explores the details of implementation of the three mechanisms.

Yeh, Show-Way↗

Implementation of equivalent domain integral method in the two-dimensional analysis of mixed mode problems

An equivalent domain integral (EDI) method for calculating J-intergrals for two-dimensional cracked elastic bodies is presented. The details of the method and its implementation are presented for isoparametric elements. The total and product integrals consist of the sum of an area of domain integral and line integrals on the crack faces. The line integrals vanish only when the crack faces are traction free and the loading is either pure mode 1 or pure mode 2 or a combination of both with only the square-root singular term in the stress field. The EDI method gave accurate values of the J-integrals for two mode I and two mixed mode problems. Numerical studies showed that domains consisting of one layer of elements are sufficient to obtain accurate J-integral values. Two procedures for separating the individual modes from the domain integrals are presented. The procedure that uses the symmetric and antisymmetric components of the stress and displacement fields to calculate the individual modes gave accurate values of the integrals for all problems analyzed. The EDI method when applied to a problem of an interface crack in two different materials showed that the mode 1 and mode 2 components are domain dependent while the total integral is not. This behavior is caused by the presence of the oscillatory part of the singularity in bimaterial crack problems. The EDI method, thus, shows behavior similar to the virtual crack closure method for bimaterial problems.

Raju, I. S.↗

Accuracy problems associated with semi-analytical derivatives of static response

The semianalytical method is widely used for calculating derivatives of static response with respect to design variables for structures modeled by finite elements. This paper shows that the method can have serious accuracy problems for shape design variables in structures modeled by beam elements. The problem was first discovered in the analysis of a complex car model which is described. Next, it is shown that the same accuracy problem occurs for the simplest beam structures. Finally, the problem is shown to be associated with a high ratio of rigid body rotation to elastic deformation, and a test is developed to diagnose the severity of the problem in a given structure. Several examples are presented to show the validity of this test.

Barthelemy, Bruno↗