Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem Solving”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS1982

Experiences with explicit finite-difference schemes for complex fluid dynamics problems on STAR-100 and CYBER-203 computers

Several two- and three-dimensional external and internal flow problems solved on the STAR-100 and CYBER-203 vector processing computers are described. The flow field was described by the full Navier-Stokes equations which were then solved by explicit finite-difference algorithms. Problem results and computer system requirements are presented. Program organization and data base structure for three-dimensional computer codes which will eliminate or improve on page faulting, are discussed. Storage requirements for three-dimensional codes are reduced by calculating transformation metric data in each step. As a result, in-core grid points were increased in number by 50% to 150,000, with a 10% execution time increase. An assessment of current and future machine requirements shows that even on the CYBER-205 computer only a few problems can be solved realistically. Estimates reveal that the present situation is more storage limited than compute rate limited, but advancements in both storage and speed are essential to realistically calculate three-dimensional flow.

Kumar, A.↗
DOE OSTI2025

Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow

Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. Here, we investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
NASA NTRS1987

The minimal residual QR-factorization algorithm for reliably solving subset regression problems

A new algorithm to solve test subset regression problems is described, called the minimal residual QR factorization algorithm (MRQR). This scheme performs a QR factorization with a new column pivoting strategy. Basically, this strategy is based on the change in the residual of the least squares problem. Furthermore, it is demonstrated that this basic scheme might be extended in a numerically efficient way to combine the advantages of existing numerical procedures, such as the singular value decomposition, with those of more classical statistical procedures, such as stepwise regression. This extension is presented as an advisory expert system that guides the user in solving the subset regression problem. The advantages of the new procedure are highlighted by a numerical example.

Verhaegen, M. H.↗
NASA NTRS1993

Real-time trajectory optimization on parallel processors

A parallel algorithm has been developed for rapidly solving trajectory optimization problems. The goal of the work has been to develop an algorithm that is suitable to do real-time, on-line optimal guidance through repeated solution of a trajectory optimization problem. The algorithm has been developed on an INTEL iPSC/860 message passing parallel processor. It uses a zero-order-hold discretization of a continuous-time problem and solves the resulting nonlinear programming problem using a custom-designed augmented Lagrangian nonlinear programming algorithm. The algorithm achieves parallelism of function, derivative, and search direction calculations through the principle of domain decomposition applied along the time axis. It has been encoded and tested on 3 example problems, the Goddard problem, the acceleration-limited, planar minimum-time to the origin problem, and a National Aerospace Plane minimum-fuel ascent guidance problem. Execution times as fast as 118 sec of wall clock time have been achieved for a 128-stage Goddard problem solved on 32 processors. A 32-stage minimum-time problem has been solved in 151 sec on 32 processors. A 32-stage National Aerospace Plane problem required 2 hours when solved on 32 processors. A speed-up factor of 7.2 has been achieved by using 32-nodes instead of 1-node to solve a 64-stage Goddard problem.

Psiaki, Mark L.↗
NASA NTRS1976

A finite difference method of solving anisotropic scattering problems

A new method of solving radiative transfer problems is described including a comparison of its speed with that of the doubling method, and a discussion of its accuracy and suitability for computations involving variable optical properties. The method uses a discretization in angle to produce a coupled set of first-order differential equations which are integrated between discrete depth points to produce a set of recursion relations for symmetric and anti-symmetric angular sums of the radiation field at alternate depth points. The formulation given here includes depth-dependent anisotropic scattering, absorption, and internal sources, and allows arbitrary combinations of specular and non-Lambertian diffuse reflection at either or both boundaries. Numerical tests of the method show that it can return accurate emergent intensities even for large optical depths. The method is also shown to conserve flux to machine accuracy in conservative atmospheres

Barkstrom, B. R.↗
NASA NTRS1988

Life-span knowledge engineering for space operations

Ordinarily, knowledge engineering is thought of as the process of translating the knowledge and problem solving strategies of a human expert into rules and procedures incorporated into a machine based expert system which can, given adequate input, solve the same sorts of problems as the expert. One appeal of these knowledge based systems is their ability to take care of problems without having a human expert present. For work in space, being independent of humans is especially important both for situations where devices will be in remote or dangerous locales and for situations such as space stations where human resources are limited and schedules are tight. In qualification of the above ideas, it is argued herein that the notion of knowledge engineering and the expectations for its application should be extended beyond the period of construction of unit expert systems to the entire knowledge system management associated with one or another real systems, whether it is a piece of hardware or an entire human-machine operation such as a lunar factory.

Hays, Dan↗
NASA NTRS2002

Science Fairs and Observational Science: A Case History from Earth Orbit

Having judged dozens of science fairs over the years, I am repeatedly disturbed by the ground rules under which students must prepare their entries. They are almost invariably required to follow the "scientific method," involving formulating a hypothesis, a test of the hypothesis, and then a project in which this test is carried out. As a research scientist for over 40 years, I consider this approach to science fairs fundamentally unsound. It is not only too restrictive, but actually avoids the most important (and difficult) part of scientific research: recognizing a scientific problem in the first place. A well-known example is one of the problems that, by his own account, stimulated Einstein's theory of special relativity: the obvious fact that when an electric current is induced in a conductor by a magnetic field , it makes no difference whether the field or the conductor is actually (so to speak) moving. There is in other words no such thing as absolute motion. Physics was transformed by Einstein's recognition of a problem. Most competent scientists can solve problems after they have been recognized and a hypothesis properly formulated, but the ability to find problems in the first Place is much rarer. Getting down to specifics, the "scientific method" under which almost all students must operate is actually the experimental method, involving controlled variables, one of which, ideally, is changed at a time. However, there is another type of science that can be called observational science. As it happens, almost all the space research I have carried out since 1959 has been this type, not experimental science.

Lowman, Paul D., Jr.↗
NASA NTRS2004

Genetic Algorithms Applied to Multi-Objective Aerodynamic Shape Optimization

A genetic algorithm approach suitable for solving multi-objective optimization problems is described and evaluated using a series of aerodynamic shape optimization problems. Several new features including two variations of a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. A new masking array capability is included allowing any gene or gene subset to be eliminated as decision variables from the design space. This allows determination of the effect of a single gene or gene subset on the pareto optimal solution. Results indicate that the genetic algorithm optimization approach is flexible in application and reliable. The binning selection algorithms generally provide pareto front quality enhancements and moderate convergence efficiency improvements for most of the problems solved.

Holst, Terry L.↗
NASA NTRS1994

A Compositional Relevance Model for Adaptive Information Retrieval

There is a growing need for rapid and effective access to information in large electronic documentation systems. Access can be facilitated if information relevant in the current problem solving context can be automatically supplied to the user. This includes information relevant to particular user profiles, tasks being performed, and problems being solved. However most of this knowledge on contextual relevance is not found within the contents of documents, and current hypermedia tools do not provide any easy mechanism to let users add this knowledge to their documents. We propose a compositional relevance network to automatically acquire the context in which previous information was found relevant. The model records information on the relevance of references based on user feedback for specific queries and contexts. It also generalizes such information to derive relevant references for similar queries and contexts. This model lets users filter information by context of relevance, build personalized views of documents over time, and share their views with other users. It also applies to any type of multimedia information. Compared to other approaches, it is less costly and doesn't require any a priori statistical computation, nor an extended training period. It is currently being implemented into the Computer Integrated Documentation system which enables integration of various technical documents in a hypertext framework.

Mathe, Nathalie↗
NASA NTRSDate not supplied

MAGE: Alleviating Uncertainty in Real-Time Decision-Making as a Function of Problem Complexity

In this paper, we discuss a critical aspect of uncertainty in the operation of complex systems, such as the future air traffic: the ability of agents in the system to arrive at satisfactory decisions and the attendant actions as a function of problem complexity. Intuitively, when the problem complexity is manageable, given an appropriate decision problem formulation and solution tools, an agent (computational or human) has no trouble arriving at a solution that yields good outcomes for the agent and the system. Growing problem complexity results in progressively larger computational problems that may yield suboptimal solutions or even be intractable within required time limits or at all. We propose a measurable representation of complexity in terms of problem tractability and quality of solutions. We also propose a computational scheme, MAGE (Monitor, Anticipate, Guide, Evolve), for detecting approaching transitions from efficient decision-making states to inefficient to unsafe ones, so that operations based on decision-making can be reconfigured to forestall unfavorable transitions, returning to efficient modes when complexity diminishes. Maintaining tractable complexity reduces the uncertainty in the outcomes of decision-making. We describe the general scheme, an outline of MAGE applied to managing airspace complexity, and initial examples of investigating the tractability of problem-solving schemes.

complexity management↗
NASA NTRS2008

Playful Physics

Effectively communicate qualitative and quantitative information orally and in writing. Explain the application of fundamental physical principles to various physical phenomena. Apply appropriate problem-solving techniques to practical and meaningful problems using graphical, mathematical, and written modeling tools. Work effectively in collaborative groups.

Weaver, David↗
NASA NTRS2021

Utilizing Schedule Constraints to Improve Automated Scheduling in NASA's Deep Space Network

NASA’s Deep Space Network (DSN) is a mission critical facility that supports many different space missions,from LEO to deep space exploration. In recent years, as the network has suffered from increasing oversubscription, more restrictions have been added to reduce the amount of manual scheduling labor necessary to come to consensus. In this paper, we describe a new auto-mated scheduling tool which takes advantage of these restrictions to bring the scheduling problem closer to feasibility. In addition, we describe an algorithm to reduce problem inputs given a partially-solved problem,thereby bringing the problem even closer to feasibility

Johnston, Mark↗
NASA NTRS2005

Program Plan for 2005: NASA Scientific and Technical Information Program

Throughout 2005 and beyond, NASA will be faced with great challenges and even greater opportunities. Following a period of reevaluation, reinvention, and transformation, we will move rapidly forward to leverage new partnerships, approaches, and technologies that will enhance the way we do business. NASA's Scientific and Technical Information (STI) Program, which functions under the auspices of the Agency's Chief Information Officer (CIO), is an integral part of NASA's future. The program supports the Agency's missions to communicate scientific knowledge and understanding and to help transfer NASA's research and development (R&D) information to the aerospace and academic communities and to the public. The STI Program helps ensure that the Agency will remain at the leading edge of R&D by quickly and efficiently capturing and sharing NASA and worldwide STI to use for problem solving, awareness, and knowledge management and transfer.

NASA programs↗