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 649 records · Page 36

A least-squares finite element method for incompressible Navier-Stokes problems

A least-squares finite element method, based on the velocity-pressure-vorticity formulation, is developed for solving steady incompressible Navier-Stokes problems. This method leads to a minimization problem rather than to a saddle-point problem by the classic mixed method, and can thus accommodate equal-order interpolations. This method has no parameter to tune. The associated algebraic system is symmetric, and positive definite. Numerical results for the cavity flow at Reynolds number up to 10,000 and the backward-facing step flow at Reynolds number up to 900 are presented.

Jiang, Bo-Nan↗

The inverse gravimetric problem in gravity modelling

One of the main purposes of geodesy is to determine the gravity field of the Earth in the space outside its physical surface. This purpose can be pursued without any particular knowledge of the internal density even if the exact shape of the physical surface of the Earth is not known, though this seems to entangle the two domains, as it was in the old Stoke's theory before the appearance of Molodensky's approach. Nevertheless, even when large, dense and homogeneous data sets are available, it was always recognized that subtracting from the gravity field the effect of the outer layer of the masses (topographic effect) yields a much smoother field. This is obviously more important when a sparse data set is bad so that any smoothing of the gravity field helps in interpolating between the data without raising the modeling error, this approach is generally followed because it has become very cheap in terms of computing time since the appearance of spectral techniques. The mathematical description of the Inverse Gravimetric Problem (IGP) is dominated mainly by two principles, which in loose terms can be formulated as follows: the knowledge of the external gravity field determines mainly the lateral variations of the density; and the deeper the density anomaly giving rise to a gravity anomaly, the more improperly posed is the problem of recovering the former from the latter. The statistical relation between rho and n (and its inverse) is also investigated in its general form, proving that degree cross-covariances have to be introduced to describe the behavior of rho. The problem of the simultaneous estimate of a spherical anomalous potential and of the external, topographic masses is addressed criticizing the choice of the mixed collection approach.

Sanso, F.↗

Solving problems by interrogating sets of knowledge systems: Toward a theory of multiple knowledge systems

The main purpose is to develop a theory for multiple knowledge systems. A knowledge system could be a sensor or an expert system, but it must specialize in one feature. The problem is that we have an exhaustive list of possible answers to some query (such as what object is it). By collecting different feature values, in principle, it should be possible to give an answer to the query, or at least narrow down the list. Since a sensor, or for that matter an expert system, does not in most cases yield a precise value for the feature, uncertainty must be built into the model. Also, researchers must have a formal mechanism to be able to put the information together. Researchers chose to use the Dempster-Shafer approach to handle the problems mentioned above. Researchers introduce the concept of a state of recognition and point out that there is a relation between receiving updates and defining a set valued Markov Chain. Also, deciding what the value of the next set valued variable is can be phrased in terms of classical decision making theory such as minimizing the maximum regret. Other related problems are examined.

Dekorvin, Andre↗

Efficient algorithms for a class of partitioning problems

The problem of optimally partitioning the modules of chain- or tree-like tasks over chain-structured or host-satellite multiple computer systems is addressed. This important class of problems includes many signal processing and industrial control applications. Prior research has resulted in a succession of faster exact and approximate algorithms for these problems. Polynomial exact and approximate algorithms are described for this class that are better than any of the previously reported algorithms. The approach is based on a preprocessing step that condenses the given chain or tree structured task into a monotonic chain or tree. The partitioning of this monotonic take can then be carried out using fast search techniques.

Iqbal, M. Ashraf↗

Green's functions for dislocations in bonded strips and related crack problems

Green's functions are derived for the plane elastostatics problem of a dislocation in a bimaterial strip. Using these fundamental solutions as kernels, various problems involving cracks in a bimaterial strip are analyzed using singular integral equations. For each problem considered, stress intensity factors are calculated for several combinations of the parameters which describe loading, geometry and material mismatch.

Ballarini, R.↗

Learning in stochastic neural networks for constraint satisfaction problems

Researchers describe a newly-developed artificial neural network algorithm for solving constraint satisfaction problems (CSPs) which includes a learning component that can significantly improve the performance of the network from run to run. The network, referred to as the Guarded Discrete Stochastic (GDS) network, is based on the discrete Hopfield network but differs from it primarily in that auxiliary networks (guards) are asymmetrically coupled to the main network to enforce certain types of constraints. Although the presence of asymmetric connections implies that the network may not converge, it was found that, for certain classes of problems, the network often quickly converges to find satisfactory solutions when they exist. The network can run efficiently on serial machines and can find solutions to very large problems (e.g., N-queens for N as large as 1024). One advantage of the network architecture is that network connection strengths need not be instantiated when the network is established: they are needed only when a participating neural element transitions from off to on. They have exploited this feature to devise a learning algorithm, based on consistency techniques for discrete CSPs, that updates the network biases and connection strengths and thus improves the network performance.

Johnston, Mark D.↗

Adaptive implicit-explicit methods for flow problems

Studies on the adaptive implicit-explicit (AIE) method for large-scale problems are presented. The AIE method is based on dynamic grouping of the elements into the implicit and explicit subsets as dictated by the element level stability and accuracy considerations. The method has been applied to various flow problems including the incompressible flow and convection-diffusion problems, and it has been demonstrated that substantial savings in CPU time and memory can be achieved.

Liou, J.↗

The consistent comparison problem in N-version software

The authors have identified a difficulty in the implementation of N-version programming. The problem, called the consistent comparison problem, arises for applications in which decisions are based on the results of comparing finite-precision numbers. It is shown that when versions make comparisons involving the results of finite-precision calculations, it is impossible to guarantee the consistency of their results. It is therefore possible that correct versions may arrive at completely different outputs for an application that does not apparently have multiple correct solutions. If this problem is not dealt with explicitly, an N-version system may be unable to reach consensus even when none of its component versions falls.

Brilliant, Susan S.↗

Application of the pseudostate theory to the three-body Lambert problem

The pseudostate theory, which approximates three-body trajectories by overlapping the conic effects of both massive bodies on the third body, has been used to solve boundary-value problems. Frequently, the approach to the secondary is quite close, as in interplanetary gravity-assist or satellite-tour trajectories. In this case, the orbit with respect to the primary is radically changed so that perturbation techniques are time consuming, yet higher accuracy than point-to-point conics is necessary. This method reduces the solution of the three-body Lambert problem to solving two conic Lambert problems and inverting a 7 x 7 matrix, the components of which are all found analytically. Typically 90-95 percent of the point-to-point conic error, with respect to an integrated trajectory, is eliminated.

Byrnes, Dennis V.↗

The use of the FFT for the efficient solution of the problem of electromagnetic scattering by a body of revolution

The enhancement of the computational efficiency of the body of revolution (BOR) scattering problem is discused with a view to making it practical for solving large-body problems. The problem of EM scattering by a perfectly conducting BOR is considered, although the methods can be extended to multilayered dielectric bodies as well. Typically, the generation of the elements of the moment method matrix consumes a major portion of the computational time. It is shown how this time can be significantly reduced by manipulating the expression for the matrix elements to permit efficient FFT computation. A technique for extracting the singularity of the Green function that appears within the integrands of the matrix diagonal is also presented, further enhancing the usefulness of the FFT. The computation time can thus be improved by at least an order of magnitude for large bodies in comparison to that for previous algorithms.

Gedney, Stephen D.↗

A unique problem of muscle adaptation from weightlessness: The deceleration deficiency

Decelerator problems of the knee are emphasized since the lower leg musculature is known to atrophy in response to weightlessness. However, other important decelerator functions are served by the shoulder muscles, in particular the rotator cuff muscles. Problems in these muscles often result in tears and dislocations as seen in baseball pitchers. It is noteworthy that at least one device currently exists that can measure concentric and eccentric muscle loading including a submaximal simulated free weight exercise (i.e., force-controlled) and simultaneously record integrated EMG analysis appropriate for assessment of all muscle functional activities. Studies should be undertaken to provide information as to the performance of maximal and submaximal exercise in space travelers to define potential problems and provide rationale for prevention.

Stauber, William T.↗

Spectral methods for time dependent problems

Spectral approximations are reviewed for time dependent problems. Some basic ingredients from the spectral Fourier and Chebyshev approximations theory are discussed. A brief survey was made of hyperbolic and parabolic time dependent problems which are dealt with by both the energy method and the related Fourier analysis. The ideas presented above are combined in the study of accuracy stability and convergence of the spectral Fourier approximation to time dependent problems.

Tadmor, Eitan↗

An improved exploratory search technique for pure integer linear programming problems

The development is documented of a heuristic method for the solution of pure integer linear programming problems. The procedure draws its methodology from the ideas of Hooke and Jeeves type 1 and 2 exploratory searches, greedy procedures, and neighborhood searches. It uses an efficient rounding method to obtain its first feasible integer point from the optimal continuous solution obtained via the simplex method. Since this method is based entirely on simple addition or subtraction of one to each variable of a point in n-space and the subsequent comparison of candidate solutions to a given set of constraints, it facilitates significant complexity improvements over existing techniques. It also obtains the same optimal solution found by the branch-and-bound technique in 44 of 45 small to moderate size test problems. Two example problems are worked in detail to show the inner workings of the method. Furthermore, using an established weighted scheme for comparing computational effort involved in an algorithm, a comparison of this algorithm is made to the more established and rigorous branch-and-bound method. A computer implementation of the procedure, in PC compatible Pascal, is also presented and discussed.

Fogle, F. 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.↗

Finite-volume application of high-order ENO schemes to two-dimensional boundary-value problems

Finite-volume applications of high-order accurate ENO schemes to two-dimensional boundary-value problems are studied. These schemes achieve high-order spatial accuracy, in smooth regions, by a piecewise polynomial approximation of the solution from cell averages. In addition, this spatial operation involves an adaptive stencil algorithm in order to avoid the oscillatory behavior that is associated with interpolation across steep gradients. High-order TVD Runge-Kutta methods are employed for time integration, thus making these schemes best suited for unsteady problems. Fifth- and sixth-order accurate applications are validated through a grid refinement study involving the solutions of scalar hyperbolic equations. A previously proposed extension for the Euler equations of gas dynamics is tested, including its application to solutions of boundary-value problems involving solid walls and curvilinear coordinates.

Casper, Jay↗

The use of MACSYMA for solving elliptic boundary value problems

A boundary method is presented for the solution of elliptic boundary value problems. An approach based on the use of complete systems of solutions is emphasized. The discussion is limited to the Dirichlet problem, even though the present method can possibly be adapted to treat other boundary value problems.

Thejll, Peter↗

Knowledge acquisition from natural language for expert systems based on classification problem-solving methods

It is shown how certain kinds of domain independent expert systems based on classification problem-solving methods can be constructed directly from natural language descriptions by a human expert. The expert knowledge is not translated into production rules. Rather, it is mapped into conceptual structures which are integrated into long-term memory (LTM). The resulting system is one in which problem-solving, retrieval and memory organization are integrated processes. In other words, the same algorithm and knowledge representation structures are shared by these processes. As a result of this, the system can answer questions, solve problems or reorganize LTM.

Gomez, Fernando↗

Distributed genetic algorithms for the floorplan design problem

Designing a VLSI floorplan calls for arranging a given set of modules in the plane to minimize the weighted sum of area and wire-length measures. A method of solving the floorplan design problem using distributed genetic algorithms is presented. Distributed genetic algorithms, based on the paleontological theory of punctuated equilibria, offer a conceptual modification to the traditional genetic algorithms. Experimental results on several problem instances demonstrate the efficacy of this method and indicate the advantages of this method over other methods, such as simulated annealing. The method has performed better than the simulated annealing approach, both in terms of the average cost of the solutions found and the best-found solution, in almost all the problem instances tried.

Cohoon, James P.↗