Search NASA⌕ Search

SEARCH · Search NASA

Results for “Types Of Problems”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

An Autograding (Student) Problem Management System for the Compeuwtir Ilittur8

In order to develop analysis skills necessary in engineering disciplines, students need practice solving problems using specified analytical techniques. Unless homework is collected and graded, students tend not to spend much time or effort in performing it. Teachers do not, realistically, have the time to grade large numbers of homework problems on a regular basis. This paper presents and makes available a miracle cure. The Autograding Problem Management System (APMS) provides a discipline-independent mechanism for teachers to create (quickly and easily) sets of homework problems. The APMS system provides CRT and/or printed summaries of the graded student responses. This presentation will demonstrate both the speed and the drag-and-drop simplicity of using the APMS to create self-grading homework problem sets comprised of traditional types of problems and of problems which would not be possible without the use of computers.

Kohne, Glenn S.↗
NASA NTRS2001

Better, Cheaper, Faster Molecular Dynamics

Recent, revolutionary progress in genomics and structural, molecular and cellular biology has created new opportunities for molecular-level computer simulations of biological systems by providing vast amounts of data that require interpretation. These opportunities are further enhanced by the increasing availability of massively parallel computers. For many problems, the method of choice is classical molecular dynamics (iterative solving of Newton's equations of motion). It focuses on two main objectives. One is to calculate the relative stability of different states of the system. A typical problem that has' such an objective is computer-aided drug design. Another common objective is to describe evolution of the system towards a low energy (possibly the global minimum energy), "native" state. Perhaps the best example of such a problem is protein folding. Both types of problems share the same difficulty. Often, different states of the system are separated by high energy barriers, which implies that transitions between these states are rare events. This, in turn, can greatly impede exploration of phase space. In some instances this can lead to "quasi non-ergodicity", whereby a part of phase space is inaccessible on time scales of the simulation. To overcome this difficulty and to extend molecular dynamics to "biological" time scales (millisecond or longer) new physical formulations and new algorithmic developments are required. To be efficient they should account for natural limitations of multi-processor computer architecture. I will present work along these lines done in my group. In particular, I will focus on a new approach to calculating the free energies (stability) of different states and to overcoming "the curse of rare events". I will also discuss algorithmic improvements to multiple time step methods and to the treatment of slowly decaying, log-ranged, electrostatic effects.

Pohorille, Andrew↗
NASA NTRS1989

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Crowley, Kay↗
NASA NTRS1990

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Saltz, Joel↗
NASA NTRS1997

Evaluation of a High-Accuracy MacCormack-Type Scheme Using Benchmark Problems

Due to their inherent dissipation and stability, the MacCormack scheme and its variants have been widely used in the computation of unsteady flow and acoustic problems. However, these schemes require many points per wavelength in order to propagate waves with a reasonable amount of accuracy. In this work, the linear wave propagation characteristics of MacCormack-type schemes are shown by solving several of the CAA Benchmark Problems.

Hixon, R.↗
NASA NTRS1997

Application of an Optimized MacCormack-Type Scheme to Acoustic Scattering Problems

In this work, a new optimized MacCormack-type scheme, which is 4th order accurate in time and space, is applied to Problems 1 and 2 of Category 1. The performance of this new scheme is compared to that of the 2-4 MacCormack scheme, and results for Problems 1 and 2 of Category 1 are presented and compared to the exact solutions.

Hixon, Ray↗
NASA NTRS1992

Comparison of display enhancement with intelligent decision-aiding

Currently, two main approaches exist for improving the human-machine interface component of a system in order to improve overall system performance, display enhancement and intelligent decision aiding. Each of these two approaches has its own set of advantages and disadvantages, as well as introduce its own set of additional performance problems. These characteristics should help identify which types of problem situations and domains are better aided by which type of strategy. The characteristic issues are described of these two decision aiding strategies. Then differences in expert and novice decision making are described in order to help determine whether a particular strategy may be better for a particular type of user. Finally, research is outlined to compare and contrast the two technologies, as well as to examine the interaction effects introduced by the different skill levels and the different methods for training operators.

Kirlik, Alex↗
NASA NTRS1993

A robust multilevel simultaneous eigenvalue solver

Multilevel (ML) algorithms for eigenvalue problems are often faced with several types of difficulties such as: the mixing of approximated eigenvectors by the solution process, the approximation of incomplete clusters of eigenvectors, the poor representation of solution on coarse levels, and the existence of close or equal eigenvalues. Algorithms that do not treat appropriately these difficulties usually fail, or their performance degrades when facing them. These issues motivated the development of a robust adaptive ML algorithm which treats these difficulties, for the calculation of a few eigenvectors and their corresponding eigenvalues. The main techniques used in the new algorithm include: the adaptive completion and separation of the relevant clusters on different levels, the simultaneous treatment of solutions within each cluster, and the robustness tests which monitor the algorithm's efficiency and convergence. The eigenvectors' separation efficiency is based on a new ML projection technique generalizing the Rayleigh Ritz projection, combined with a technique, the backrotations. These separation techniques, when combined with an FMG formulation, in many cases lead to algorithms of O(qN) complexity, for q eigenvectors of size N on the finest level. Previously developed ML algorithms are less focused on the mentioned difficulties. Moreover, algorithms which employ fine level separation techniques are of O(q(sub 2)N) complexity and usually do not overcome all these difficulties. Computational examples are presented where Schrodinger type eigenvalue problems in 2-D and 3-D, having equal and closely clustered eigenvalues, are solved with the efficiency of the Poisson multigrid solver. A second order approximation is obtained in O(qN) work, where the total computational work is equivalent to only a few fine level relaxations per eigenvector.

Costiner, Sorin↗
NASA NTRS1978

On least squares approximations to indefinite problems of the mixed type

A least squares method is presented for computing approximate solutions of indefinite partial differential equations of the mixed type such as those that arise in connection with transonic flutter analysis. The method retains the advantages of finite difference schemes namely simplicity and sparsity of the resulting matrix system. However, it offers some great advantages over finite difference schemes. First, the method is insensitive to the value of the forcing frequency, i.e., the resulting matrix system is always symmetric and positive definite. As a result, iterative methods may be successfully employed to solve the matrix system, thus taking full advantage of the sparsity. Furthermore, the method is insensitive to the type of the partial differential equation, i.e., the computational algorithm is the same in elliptic and hyperbolic regions. In this work the method is formulated and numerical results for model problems are presented. Some theoretical aspects of least squares approximations are also discussed.

Fix, G. J.↗
NASA NTRS1987

Phase space simulation of collisionless stellar systems on the massively parallel processor

A numerical technique for solving the collisionless Boltzmann equation describing the time evolution of a self gravitating fluid in phase space was implemented on the Massively Parallel Processor (MPP). The code performs calculations for a two dimensional phase space grid (with one space and one velocity dimension). Some results from calculations are presented. The execution speed of the code is comparable to the speed of a single processor of a Cray-XMP. Advantages and disadvantages of the MPP architecture for this type of problem are discussed. The nearest neighbor connectivity of the MPP array does not pose a significant obstacle. Future MPP-like machines should have much more local memory and easier access to staging memory and disks in order to be effective for this type of problem.

White, Richard L.↗
NASA NTRS1986

Robust multivariable controller design for flexible spacecraft

Large, flexible spacecraft are typically characterized by a large number of significant elastic modes with very small inherent damping, low, closely spaced natural frequencies, and the lack of accurate knowledge of the structural parameters. Summarized here is some recent research on the design of robust controllers for such spacecraft, which will maintain stability, and possible performance, despite these problems. Two types of controllers are considered, the first being the linear-quadratic-Gaussian-(LQG)-type. The second type utilizes output feedback using collocated sensors and actuators. The problem of designing robust LQG-type controllers using the frequency domain loop transfer recovery (LTR) method is considered, and the method is applied to a large antenna model. Analytical results regarding the regions of stability for LQG-type controllers in the presence of actuator nonlinearities are also presented. The results obtained for the large antenna indicate that the LQG/LTR method is a promising approach for control system design for flexible spacecraft. For the second type of controllers (collocated controllers), it is proved that the stability is maintained in the presence of certain commonly encountered nonlinearities and first-order actuator dynamics. These results indicate that collocated controllers are good candidates for robust control in situations where model errors are large.

Joshi, Suresh M.↗
NASA NTRS1983

Systems approach to walk-off problems for dish-type solar thermal power systems

'Walk-off' in a dish-type solar thermal power system is a failure situation in which the concentrator remains fixed while the spot of concentrated sunlight slowly moves across the face of the receiver. The intense local heating may damage the receiver and nearby equipment. Passive protection has advantages in minimizing damage, but in a fully passive design the receiver must be able to withstand full solar input with no forced fluid circulation during the walk-off. An active walk-off emergency subsystem may include an emergency detrack or defocus mechanism or sun-blocking device, emergency power, sensors and logic to detect the emergency and initiate protective action, and cooling or passive protection of emergency and non-emergency components. Each of these elements is discussed and evaluated in the paper.

Jaffe, L. D.↗
NASA NTRS2004

Securing the User's Work Environment

High performance computing at the Numerical Aerospace Simulation Facility at NASA Ames Research Center includes C90's, J90's and Origin 2000's. Not only is it necessary to protect these systems from outside attacks, but also to provide a safe working environment on the systems. With the right tools, security anomalies in the user s work environment can be deleted and corrected. Validating proper ownership of files against user s permissions, will reduce the risk of inadvertent data compromise. The detection of extraneous directories and files hidden amongst user home directories is important for identifying potential compromises. The first runs of these utilities detected over 350,000 files with problems. With periodic scans, automated correction of problems takes only minutes. Tools for detecting these types of problems as well as their development techniques will be discussed with emphasis on consistency, portability and efficiency for both UNICOS and IRIX.

Cardo, Nicholas P.↗
NASA NTRS1991

AI techniques for a space application scheduling problem

Scheduling is a very complex optimization problem which can be categorized as an NP-complete problem. NP-complete problems are quite diverse, as are the algorithms used in searching for an optimal solution. In most cases, the best solutions that can be derived for these combinatorial explosive problems are near-optimal solutions. Due to the complexity of the scheduling problem, artificial intelligence (AI) can aid in solving these types of problems. Some of the factors are examined which make space application scheduling problems difficult and presents a fairly new AI-based technique called tabu search as applied to a real scheduling application. the specific problem is concerned with scheduling application. The specific problem is concerned with scheduling solar and stellar observations for the SOLar-STellar Irradiance Comparison Experiment (SOLSTICE) instrument in a constrained environment which produces minimum impact on the other instruments and maximizes target observation times. The SOLSTICE instrument will gly on-board the Upper Atmosphere Research Satellite (UARS) in 1991, and a similar instrument will fly on the earth observing system (Eos).

Thalman, N.↗
NASA NTRS1994

A toolbox and record for scientific models

Computational science presents a host of challenges for the field of knowledge-based software design. Scientific computation models are difficult to construct. Models constructed by one scientist are easily misapplied by other scientists to problems for which they are not well-suited. Finally, models constructed by one scientist are difficult for others to modify or extend to handle new types of problems. Construction of scientific models actually involves much more than the mechanics of building a single computational model. In the course of developing a model, a scientist will often test a candidate model against experimental data or against a priori expectations. Test results often lead to revisions of the model and a consequent need for additional testing. During a single model development session, a scientist typically examines a whole series of alternative models, each using different simplifying assumptions or modeling techniques. A useful scientific software design tool must support these aspects of the model development process as well. In particular, it should propose and carry out tests of candidate models. It should analyze test results and identify models and parts of models that must be changed. It should determine what types of changes can potentially cure a given negative test result. It should organize candidate models, test data, and test results into a coherent record of the development process. Finally, it should exploit the development record for two purposes: (1) automatically determining the applicability of a scientific model to a given problem; (2) supporting revision of a scientific model to handle a new type of problem. Existing knowledge-based software design tools must be extended in order to provide these facilities.

Ellman, Thomas↗
NASA NTRS1974

Solution of the radiative transfer theory problems by the Monte Carlo method

The Monte Carlo method is used for two types of problems. First, there are interpretation problems of optical observations from meteorological satellites in the short wave part of the spectrum. The sphericity of the atmosphere, the propagation function, and light polarization are considered. Second, problems dealt with the theory of spreading narrow light beams. Direct simulation of light scattering and the mathematical form of medium radiation model representation are discussed, and general integral transfer equations are calculated. The dependent tests method, derivative estimates, and solution to the inverse problem are also considered.

Marchuk, G. I.↗
NASA NTRS1980

Periodic orbits of the asteroidal type in the circular restricted three-body problem

Periodic orbits of the asteroidal type in the circular restricted problem are studied by varying the period of the infinitesimal body (asteroid) and the mass ratio of the primaries (Sun-Jupiter mass ratio). The results indicate that asteroidal periodic orbits can exist for the actual Sun-Jupiter mass ratio for resonances of the Hecuba (2:1), Hilda (3:2) and Thule (4:3) groups, but not for resonances of higher consecutive integer ratios. It is also found that an asteroid can be placed in a periodic orbit at a position with mean motion between 2:1 and 3:2 even if Jupiter is about 9 times more massive than its actual value. However, an asteroid cannot be placed in a periodic orbit beyond the 4:3 resonance for the actual Sun-Jupiter mass ratio.

Kwok, J. H.↗