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 685 records · Page 38

Optimal parallel algorithms for problems modeled by a family of intervals

A family of intervals on the real line provides a natural model for a vast number of scheduling and VLSI problems. Recently, a number of parallel algorithms to solve a variety of practical problems on such a family of intervals have been proposed in the literature. Computational tools are developed, and it is shown how they can be used for the purpose of devising cost-optimal parallel algorithms for a number of interval-related problems including finding a largest subset of pairwise nonoverlapping intervals, a minimum dominating subset of intervals, along with algorithms to compute the shortest path between a pair of intervals and, based on the shortest path, a parallel algorithm to find the center of the family of intervals. More precisely, with an arbitrary family of n intervals as input, all algorithms run in O(log n) time using O(n) processors in the EREW-PRAM model of computation.

Olariu, Stephan↗

Finite element solution of optimal control problems with state-control inequality constraints

It is demonstrated that the weak Hamiltonian finite-element formulation is amenable to the solution of optimal control problems with inequality constraints which are functions of both state and control variables. Difficult problems can be treated on account of the ease with which algebraic equations can be generated before having to specify the problem. These equations yield very accurate solutions. Owing to the sparse structure of the resulting Jacobian, computer solutions can be obtained quickly when the sparsity is exploited.

Bless, Robert R.↗

An equivalent domain integral method for three-dimensional mixed-mode fracture problems

A general formulation of the equivalent domain integral (EDI) method for mixed mode fracture problems in cracked solids is presented. The method is discussed in the context of a 3-D finite element analysis. The J integral consists of two parts: the volume integral of the crack front potential over a torus enclosing the crack front and the crack surface integral due to the crack front potential plus the crack face loading. In mixed mode crack problems the total J integral is split into J sub I, J sub II, and J sub III representing the severity of the crack front in three modes of deformations. The direct and decomposition methods are used to separate the modes. These two methods were applied to several mixed mode fracture problems, were analyzed, and results were found to agree well with those available in the literature. The method lends itself to be used as a post-processing subroutine in a general purpose finite element program.

Shivakumar, K. N.↗

Discrete-time entropy formulation of optimal and adaptive control problems

The discrete-time version of the entropy formulation of optimal control of problems developed by G. N. Saridis (1988) is discussed. Given a dynamical system, the uncertainty in the selection of the control is characterized by the probability distribution (density) function which maximizes the total entropy. The equivalence between the optimal control problem and the optimal entropy problem is established, and the total entropy is decomposed into a term associated with the certainty equivalent control law, the entropy of estimation, and the so-called equivocation of the active transmission of information from the controller to the estimator. This provides a useful framework for studying the certainty equivalent and adaptive control laws.

Tsai, Yweting A.↗

Program Helps Decompose Complicated Design Problems

Time saved by intelligent decomposition into smaller, interrelated problems. DeMAID is knowledge-based software system for ordering sequence of modules and identifying possible multilevel structure for design problem. Displays modules in N x N matrix format. Requires investment of time to generate and refine list of modules for input, it saves considerable amount of money and time in total design process, particularly new design problems in which ordering of modules has not been defined. Program also implemented to examine assembly-line process or ordering of tasks and milestones.

Rogers, James L., Jr.↗

Minimizing conflicts: A heuristic repair method for constraint-satisfaction and scheduling problems

This paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-ordering heuristic, the min-conflicts heuristic, that attempts to minimize the number of constraint violations after each step. The heuristic can be used with a variety of different search strategies. We demonstrate empirically that on the n-queens problem, a technique based on this approach performs orders of magnitude better than traditional backtracking techniques. We also describe a scheduling application where the approach has been used successfully. A theoretical analysis is presented both to explain why this method works well on certain types of problems and to predict when it is likely to be most effective.

Minton, Steve↗

The damper placement problem for large flexible space structures

The damper placement problem for large flexible space truss structures is formulated as a combinatorial optimization problem. The objective is to determine the p truss members of the structure to replace with active (or passive) dampers so that the modal damping ratio is as large as possible for all significant modes of vibration. Equivalently, given a strain energy matrix with rows indexed on the modes and the columns indexed on the truss members, we seek to find the set of p columns such that the smallest row sum, over the p columns, is maximized. We develop a tabu search heuristic for the damper placement problems on the Controls Structures Interaction (CSI) Phase 1 Evolutionary Model (10 modes and 1507 truss members). The resulting solutions are shown to be of high quality.

Kincaid, Rex K.↗

Redundant drive current imbalance problem of the Automatic Radiator Inspection Device (ARID)

The Automatic Radiator Inspection Device (ARID) is a 4 Degree of Freedom (DOF) robot with redundant drive motors at each joint. The device is intended to automate the labor intensive task of space shuttle radiator inspection. For safety and redundancy, each joint is driven by two independent motor systems. Motors driving the same joint, however, draw vastly different currents. The concern was that the robot joints could be subjected to undue stress. It was the objective of this summer's project to determine the cause of this current imbalance. In addition it was to determine, in a quantitative manner, what was the cause, how serious the problem was in terms of damage or undue wear to the robot and find solutions if possible. It was concluded that most problems could be resolved with a better motor control design. This document discusses problems encountered and possible solutions.

Latino, Carl D.↗

Tsien's method for generating non-Keplerian trajectories. Part 2: The question of thrust to orbit a sphere and the restricted three-body problem

Tsien's method is extended to treat the orbital motion of a body undergoing accelerations and decelerations. A generalized solution is discussed for the generalized case where a body undergoes azimuthal and radial thrust and the problem is further simplified for azimuthal thrust alone. Judicious selection of thrust could generate either an elliptic or hyperbolic trajectory. This is unexpected especially when the body has only enough energy for a lower state trajectory. The methodology is extended treating the problem of vehicle thrust for orbiting a sphere and vehicle thrust within the classical restricted three-body problem. Results for the latter situation can produce hyperbolic trajectories through eigen value decomposition. Since eigen values for no-thrust can be imaginary, thrust can generate real eigen values to describe hyperbolic trajectories. Keplerian dynamics appears to represent but a small subset of a much larger non-Keplerian domain especially when thrust effects are considered. The need for high thrust long duration space-based propulsion systems for changing a trajectory's canonical form is clearly demonstrated.

Murad, P. A.↗

Inverse problems: Fuzzy representation of uncertainty generates a regularization

In many applied problems (geophysics, medicine, and astronomy) we cannot directly measure the values x(t) of the desired physical quantity x in different moments of time, so we measure some related quantity y(t), and then we try to reconstruct the desired values x(t). This problem is often ill-posed in the sense that two essentially different functions x(t) are consistent with the same measurement results. So, in order to get a reasonable reconstruction, we must have some additional prior information about the desired function x(t). Methods that use this information to choose x(t) from the set of all possible solutions are called regularization methods. In some cases, we know the statistical characteristics both of x(t) and of the measurement errors, so we can apply statistical filtering methods (well-developed since the invention of a Wiener filter). In some situations, we know the properties of the desired process, e.g., we know that the derivative of x(t) is limited by some number delta, etc. In this case, we can apply standard regularization techniques (e.g., Tikhonov's regularization). In many cases, however, we have only uncertain knowledge about the values of x(t), about the rate with which the values of x(t) can change, and about the measurement errors. In these cases, usually one of the existing regularization methods is applied. There exist several heuristics that choose such a method. The problem with these heuristics is that they often lead to choosing different methods, and these methods lead to different functions x(t). Therefore, the results x(t) of applying these heuristic methods are often unreliable. We show that if we use fuzzy logic to describe this uncertainty, then we automatically arrive at a unique regularization method, whose parameters are uniquely determined by the experts knowledge. Although we start with the fuzzy description, but the resulting regularization turns out to be quite crisp.

Kreinovich, V.↗

Decision theory for computing variable and value ordering decisions for scheduling problems

Heuristics that guide search are critical when solving large planning and scheduling problems, but most variable and value ordering heuristics are sensitive to only one feature of the search state. One wants to combine evidence from all features of the search state into a subjective probability that a value choice is best, but there has been no solid semantics for merging evidence when it is conceived in these terms. Instead, variable and value ordering decisions should be viewed as problems in decision theory. This led to two key insights: (1) The fundamental concept that allows heuristic evidence to be merged is the net incremental utility that will be achieved by assigning a value to a variable. Probability distributions about net incremental utility can merge evidence from the utility function, binary constraints, resource constraints, and other problem features. The subjective probability that a value is the best choice is then derived from probability distributions about net incremental utility. (2) The methods used for rumor control in Bayesian Networks are the primary way to prevent cycling in the computation of probable net incremental utility. These insights lead to semantically justifiable ways to compute heuristic variable and value ordering decisions that merge evidence from all available features of the search state.

Linden, Theodore A.↗

Software support for irregular and loosely synchronous problems

A large class of scientific and engineering applications may be classified as irregular and loosely synchronous from the perspective of parallel processing. We present a partial classification of such problems. This classification has motivated us to enhance FORTRAN D to provide language support for irregular, loosely synchronous problems. We present techniques for parallelization of such problems in the context of FORTRAN D.

Choudhary, A.↗

Practical computation of the mixed mu problem

The computational aspects of the recently developed upper and lower bounds for the mixed mu problem are examined. In particular, a practical algorithm is developed to compute the bounds. This has been implemented as a Matlab function (m-file) and will be available in a test version in conjunction with the mu-Tools toolbox. The algorithm performance is very encouraging, in terms of both accuracy of the resulting bounds and growth rate in required computation with problem size. In particular, it appears that one can handle medium-size problems (less than 100 perturbations) with reasonable computational requirements.

Young, Peter M.↗

Goddard problem in presence of a dynamic pressure limit

The Goddard problem is that of maximizing the final altitude for a vertically ascending, rocket-powered vehicle under the influence of an inverse square gravitational field and atmospheric drag. The present paper deals with the effects of two additional constraints, namely, a dynamic pressure limit and specified final time. Nine different switching structures involving zero-thrust arcs, full-thrust arcs, singular-thrust arcs, and state-constrained arcs are obtained when the value of the dynamic pressure limit is varied between zero and infinity and the final time is specified between the minimum possible time within which all of the fuel can be burned and the natural final time that emerges for the problem with final time unspecified. For all points in the aforementioned domain of dynamic pressure limit and prescribed final time, the associated optimal switching structure is clearly identified. Finally, a simple intuitive feedback law is presented for the free time problem. For all values of prescribed dynamic pressure limit, this strategy yields a loss in final altitude of less than 3 percent with respect to the associated optimal solution.

Seywald, Hans↗

Flux-Based Finite Volume representations for general thermal problems

Flux-Based Finite Volume (FV) element representations for general thermal problems are given in conjunction with a generalized trapezoidal gamma-T family of algorithms, formulated following the spirit of what we term as the Lax-Wendroff based FV formulations. The new flux-based representations introduced offer an improved physical interpretation of the problem along with computationally convenient and attractive features. The space and time discretization emanate from a conservation form of the governing equation for thermal problems, and in conjunction with the flux-based element representations give rise to a physically improved and locally conservative numerical formulations. The present representations seek to involve improved locally conservative properties, improved physical representations and computational features; these are based on a 2D, bilinear FV element and can be extended for other cases. Time discretization based on a gamma-T family of algorithms in the spirit of a Lax-Wendroff based FV formulations are employed. Numerical examples involving linear/nonlinear steady and transient situations are shown to demonstrate the applicability of the present representations for thermal analysis situations.

Mohan, Ram V.↗

Sufficient conditions for a local minimum of the Bolza problem with a variable initial point

Sufficient conditions for a weak relative minimum of a form of the Bolza problem of variational calculus are derived. The variational problem considered includes arbitrary numbers of constraints on the initial and terminal points, but assumes no control constraints or interior point constraints. Testing of the second-order conditions requires the backward integration of fewer matrix elements than in the case of previously published sets of conditions. The derivation, though lengthy, is felt to be simpler in concept than previous derivations. The application of these conditions is demonstrated in the context of a simple geometric problem.

Wood, Lincoln J.↗

The small amplitude magnetohydrodynamic Riemann problem

The small-amplitude MHD Riemann problem is studied using the Cohen-Kulsrud-Burgers equations. Unlike the coplanar Riemann problem, the evolution of noncoplanar Riemann problems is not self-similar and its flow structures could change in time. But its large-time behavior is very simple and a time-dependent 2 - 3 intermediate shock is always involved for the noncoplanar field rotations. The time-dependent 2 - 3 intermediate shock has a well-defined structure and exists for any degree of field rotation.

Wu, C. C.↗

An efficient method for inverse problems

A new inverse method for aerodynamic design of subcritical airfoils is presented. The pressure distribution in this method can be prescribed in a natural way, i.e. as a function of arclength of the as yet unknown body. This inverse problem is shown to be mathematically equivalent to solving a single nonlinear boundary value problem subject to known Dirichlet data on the boundary. The solution to this problem determines the airfoil, the free stream Mach number M(sub x) and the upstream flow direction theta(sub x). The existence of a solution for any given pressure distribution is discussed. The method is easy to implement and extremely efficient. We present a series of results for which comparisons are made with the known airfoils.

Daripa, Prabir↗