SEARCH · Search NASA

Results for “problem solving complexity”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 559 records · Page 31

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

Risks of Increased Earth Independence

As human space exploration begins to extend beyond the immediate vicinity of Earth, the ability of expertise on the ground to support operations will progressively decrease. Ground control expertise has been the primary countermeasure preventing loss of life and mission over the past sixty years and it will be gradually stripped away as expeditions reach further into space. The large, flexible and adaptive teams of experts on the ground, provide not only engineering analysis and problem-solving but also greatly increased work capacity. Monitoring of the large and fast moving stream of telemetry data is carried out around the clock by 20-30 flight controllers per shift. Analysis of that data and troubleshooting is carried out by an additional 50-100 engineers per shift. Artificial intelligence capabilities will need to be part of the solution but will not the entire solution. As progress continues to be made on intelligent systems, especially those for use in complex, dynamic environments where humans will remain a part of the activity, there is an ever increasing need to focus on how those systems will interact with the humans. Although capabilities such as natural language processing and facial recognition have become common place, even basic aspects of problem-solving, causal reasoning and generative decision-making remain well-beyond of our current capabilities. Advanced data visualization, procedure execution support, and new training approaches will be needed to close the gap between what is currently provided by experts on the ground and what the crew will need to do in increasingly autonomous ways with greater distance from Earth.

human-systems integration architecture↗

NASA NTRS2008

Verification and Planning Based on Coinductive Logic Programming

Coinduction is a powerful technique for reasoning about unfounded sets, unbounded structures, infinite automata, and interactive computations [6]. Where induction corresponds to least fixed point's semantics, coinduction corresponds to greatest fixed point semantics. Recently coinduction has been incorporated into logic programming and an elegant operational semantics developed for it [11, 12]. This operational semantics is the greatest fix point counterpart of SLD resolution (SLD resolution imparts operational semantics to least fix point based computations) and is termed co- SLD resolution. In co-SLD resolution, a predicate goal p( t) succeeds if it unifies with one of its ancestor calls. In addition, rational infinite terms are allowed as arguments of predicates. Infinite terms are represented as solutions to unification equations and the occurs check is omitted during the unification process. Coinductive Logic Programming (Co-LP) and Co-SLD resolution can be used to elegantly perform model checking and planning. A combined SLD and Co-SLD resolution based LP system forms the common basis for planning, scheduling, verification, model checking, and constraint solving [9, 4]. This is achieved by amalgamating SLD resolution, co-SLD resolution, and constraint logic programming [13] in a single logic programming system. Given that parallelism in logic programs can be implicitly exploited [8], complex, compute-intensive applications (planning, scheduling, model checking, etc.) can be executed in parallel on multi-core machines. Parallel execution can result in speed-ups as well as in larger instances of the problems being solved. In the remainder we elaborate on (i) how planning can be elegantly and efficiently performed under real-time constraints, (ii) how real-time systems can be elegantly and efficiently model- checked, as well as (iii) how hybrid systems can be verified in a combined system with both co-SLD and SLD resolution. Implementations of co-SLD resolution as well as preliminary implementations of the planning and verification applications have been developed [4]. Co-LP and Model Checking: The vast majority of properties that are to be verified can be classified into safety properties and liveness properties. It is well known within model checking that safety properties can be verified by reachability analysis, i.e, if a counter-example to the property exists, it can be finitely determined by enumerating all the reachable states of the Kripke structure.

Bansal, Ajay↗

NASA NTRS2018

Parallel Monotonic Basin Hopping for Low Thrust Trajectory Optimization

Monotonic Basin Hopping has been shown to be an effective method of solving low thrust trajectory optimization problems. This paper outlines an extension to the common serial implementation by parallelizing it over any number of available compute cores. The Parallel Monotonic Basin Hopping algorithm described herein is shown to be an effective way to more quickly locate feasible solutions, and improve locally optimal solutions in an automated way without requiring a feasible initial guess. The increased speed achieved through parallelization enables the algorithm to be applied to more complex problems that would otherwise be impractical for a serial implementation. Low thrust cislunar transfers and a hybrid Mars example case demonstrate the effectiveness of the algorithm. Finally, a preliminary scaling study quantifies the expected decrease in solve time compared to a serial implementation.,

McCarty, Steven L.↗

NASA NTRS2018

Parallel Monotonic Basin Hopping for Low Thrust Trajectory Optimization

McCarty, Steven L.↗

DOE OSTI2022

Quantum computational phase transition in combinatorial problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1982

The GRASP 3: Graphical Reliability Analysis Simulation Program. Version 3: A users' manual and modelling guide

Alternate definitions of system failure create complex analysis for which analytic solutions are available only for simple, special cases. The GRASP methodology is a computer simulation approach for solving all classes of problems in which both failure and repair events are modeled according to the probability laws of the individual components of the system.

Phillips, D. T.↗

NASA NTRS1992

Resource constrained design of artificial neural networks using comparator neural network

We present a systematic design method executed under resource constraints for automating the design of artificial neural networks using the back error propagation algorithm. Our system aims at finding the best possible configuration for solving the given application with proper tradeoff between the training time and the network complexity. The design of such a system is hampered by three related problems. First, there are infinitely many possible network configurations, each may take an exceedingly long time to train; hence, it is impossible to enumerate and train all of them to completion within fixed time, space, and resource constraints. Second, expert knowledge on predicting good network configurations is heuristic in nature and is application dependent, rendering it difficult to characterize fully in the design process. A learning procedure that refines this knowledge based on examples on training neural networks for various applications is, therefore, essential. Third, the objective of the network to be designed is ill-defined, as it is based on a subjective tradeoff between the training time and the network cost. A design process that proposes alternate configurations under different cost-performance tradeoff is important. We have developed a Design System which schedules the available time, divided into quanta, for testing alternative network configurations. Its goal is to select/generate and test alternative network configurations in each quantum, and find the best network when time is expended. Since time is limited, a dynamic schedule that determines the network configuration to be tested in each quantum is developed. The schedule is based on relative comparison of predicted training times of alternative network configurations using comparator network paradigm. The comparator network has been trained to compare training times for a large variety of traces of TSSE-versus-time collected during back-propagation learning of various applications.

Wah, Benjamin W.↗

NASA NTRS1992

Controlled ecological life-support system - Use of plants for human life-support in space

Scientists and engineers within NASA are conducting research which will lead to development of advanced life-support systems that utilize higher plants in a unique approach to solving long-term life-support problems in space. This biological solution to life-support, Controlled Ecological Life-Support System (CELSS), is a complex, extensively controlled, bioengineered system that relies on plants to provide the principal elements from gas exchange and food production to potable water reclamation. Research at John F. Kennedy Space Center (KSC) is proceeding with a comprehensive investigation of the individual parts of the CELSS system at a one-person scale in an approach called the Breadboard Project. Concurrently a relatively new NASA sponsored research effort is investigating plant growth and metabolism in microgravity, innovative hydroponic nutrient delivery systems, and use of highly efficient light emitting diodes for artificial plant illumination.

Chamberland, D.↗

NASA NTRS1996

Error and Complexity Analysis for a Collocation-Grid-Projection Plus Precorrected-FFT Algorithm for Solving Potential Integral Equations with LaPlace or Helmholtz Kernels

In this paper we derive error bounds for a collocation-grid-projection scheme tuned for use in multilevel methods for solving boundary-element discretizations of potential integral equations. The grid-projection scheme is then combined with a precorrected FFT style multilevel method for solving potential integral equations with 1/r and e(sup ikr)/r kernels. A complexity analysis of this combined method is given to show that for homogeneous problems, the method is order n natural log n nearly independent of the kernel. In addition, it is shown analytically and experimentally that for an inhomogeneity generated by a very finely discretized surface, the combined method slows to order n(sup 4/3). Finally, examples are given to show that the collocation-based grid-projection plus precorrected-FFT scheme is competitive with fast-multipole algorithms when considering realistic problems and 1/r kernels, but can be used over a range of spatial frequencies with only a small performance penalty.

Phillips, J. R.↗

NASA NTRS2009

Enhancing Team Performance for Long-Duration Space Missions

Success of exploration missions will depend on skilled performance by a distributed team that includes both the astronauts in space and Mission Control personnel. Coordinated and collaborative teamwork will be required to cope with challenging complex problems in a hostile environment. While thorough preflight training and procedures will equip creW'S to address technical problems that can be anticipated, preparing them to solve novel problems is much more challenging. This presentation will review components of effective team performance, challenges to effective teamwork, and strategies for ensuring effective team performance. Teamwork skills essential for successful team performance include the behaviors involved in developing shared mental models, team situation awareness, collaborative decision making, adaptive coordination behaviors, effective team communication, and team cohesion. Challenges to teamwork include both chronic and acute stressors. Chronic stressors are associated with the isolated and confined environment and include monotony, noise, temperatures, weightlessness, poor sleep and circadian disruptions. Acute stressors include high workload, time pressure, imminent danger, and specific task-related stressors. Of particular concern are social and organizational stressors that can disrupt individual resilience and effective mission performance. Effective team performance can be developed by training teamwork skills, techniques for coping with team conflict, intracrew and intercrew communication, and working in a multicultural team; leadership and teamwork skills can be fostered through outdoor survival training exercises. The presentation will conclude with an evaluation of the special requirements associated with preparing crews to function autonomously in long-duration missions.

Orasanu, Judith M.↗

NASA NTRSDate not supplied

Using AI/ML to Address Satellite Cloud Remote Sensing Challenges

Various AI/ML tools, employed within the Clouds and the Earth's Radiant Energy System (CERES) Satellite Cloud and Radiation Property retrieval System (SatCORPS) project, are being used to mitigate satellite radiance artifacts and thereby yield more accurate cloud and radiation data products. Neural network and K-nearest neighbor approaches have been developed that enable us to better address common passive satellite remote sensing challenges, such as corrupted imagery, day/night cloud property discontinuities, solar terminator artifacts, inadequate knowledge of the land surface emission temperature (i.e., skin temperature), and poor assumptions about vertical cloud structure, that have otherwise proven difficult to solve using more conventional methods. Fixing these problems promotes a more consistent Earth radiation budget record. These efforts demonstrate effective use of AI/ML architecture to exploit complex, multivariate predictor relationships and produce usable output at satellite spatial and temporal resolutions that would otherwise be ignored or have large biases.

Benjamin Scarino↗

NASA NTRS1985

A transonic rectangular grid embedded panel method

In this chapter, a description is given of a nonstandard method which has the ultimate goal to provide a routine solution of transonic flow problems about large, complex configurations. For a number of reasons, it is difficult to extend standard methods to the solution of flows about complicated configurations. According to the particular approach of the considered nonstandard method, in the process of solving for linear potential flow via panel methods, a flow everwhere in space is created, taking into account the interior of the aircraft as well as the external flowfield of interest. Attention is given to the solution of flow problems without interior boundaries, the treatment of interior boundaries, and areas of current and future research.

Johnson, F. T.↗

NASA NTRS1983

Ad Hoc modeling, expert problem solving, and R&T program evaluation

A simplified cost and time (SCAT) analysis program utilizing personal-computer technology is presented and demonstrated in the case of the NASA-Goddard end-to-end data system. The difficulties encountered in implementing complex program-selection and evaluation models in the research and technology field are outlined. The prototype SCAT system described here is designed to allow user-friendly ad hoc modeling in real time and at low cost. A worksheet constructed on the computer screen displays the critical parameters and shows how each is affected when one is altered experimentally. In the NASA case, satellite data-output and control requirements, ground-facility data-handling capabilities, and project priorities are intricately interrelated. Scenario studies of the effects of spacecraft phaseout or new spacecraft on throughput and delay parameters are shown. The use of a network of personal computers for higher-level coordination of decision-making processes is suggested, as a complement or alternative to complex large-scale modeling.

Silverman, B. G.↗

DOE OSTI2024

Finite domain solution of a KGD hydraulic fracture in the viscosity-dominated regime

This paper describes a numerical algorithm for solving the classic problem of a plane strain (KGD) fracture propagating in an impermeable elastic medium with zero toughness. The method, which takes advantage of the self-similar nature of the solution, combines a domain-based scheme to solve the elasticity equations and a finite volume method to solve the nonlinear lubrication equation. This work represents a first step towards developing a model able to account for pore pressure diffusion in the medium and corresponding poroelastic effects, noting that these processes are more efficiently solved using a domain-based rather than a boundary integral method. To enhance the efficiency and accuracy of the numerical scheme, the far-field crack asymptotics is embedded in the discretized elastic relationship between the fluid pressure and the crack opening, while the coupled fluid-solid tip asymptote is enforced in a weak form when solving the nonlinear lubrication equation. The proposed technique yields results that closely match the analytical solution, even with a coarse mesh. This approach offers potential for addressing more complex hydraulic fracturing problems in the future.

Domain-based method↗

NASA NTRS1987

Analysis of a combat problem - The turret game

The turret game is defined and solved to illustrate the nature of games of combat. This game represents a highly simplified version of air combat, yet it is sufficiently complex so as to exhibit a rich variety of combat phenomena. A review of the formulation of delta-combat games is included.

Ardema, M.↗

NASA NTRS1994

A Navier-Strokes Chimera Code on the Connection Machine CM-5: Design and Performance

We have implemented a three-dimensional compressible Navier-Stokes code on the Connection Machine CM-5. The code is set up for implicit time-stepping on single or multiple structured grids. For multiple grids and geometrically complex problems, we follow the 'chimera' approach, where flow data on one zone is interpolated onto another in the region of overlap. We will describe our design philosophy and give some timing results for the current code. A parallel machine like the CM-5 is well-suited for finite-difference methods on structured grids. The regular pattern of connections of a structured mesh maps well onto the architecture of the machine. So the first design choice, finite differences on a structured mesh, is natural. We use centered differences in space, with added artificial dissipation terms. When numerically solving the Navier-Stokes equations, there are liable to be some mesh cells near a solid body that are small in at least one direction. This mesh cell geometry can impose a very severe CFL (Courant-Friedrichs-Lewy) condition on the time step for explicit time-stepping methods. Thus, though explicit time-stepping is well-suited to the architecture of the machine, we have adopted implicit time-stepping. We have further taken the approximate factorization approach. This creates the need to solve large banded linear systems and creates the first possible barrier to an efficient algorithm. To overcome this first possible barrier we have considered two options. The first is just to solve the banded linear systems with data spread over the whole machine, using whatever fast method is available. This option is adequate for solving scalar tridiagonal systems, but for scalar pentadiagonal or block tridiagonal systems it is somewhat slower than desired. The second option is to 'transpose' the flow and geometry variables as part of the time-stepping process: Start with x-lines of data in-processor. Form explicit terms in x, then transpose so y-lines of data are in-processor. Form explicit terms in y, then transpose so z-lines are in processor. Form explicit terms in z, then solve linear systems in the z-direction. Transpose to the y-direction, then solve linear systems in the y-direction. Finally transpose to the x direction and solve linear systems in the x-direction. This strategy avoids inter-processor communication when differencing and solving linear systems, but requires a large amount of communication when doing the transposes. The transpose method is more efficient than the non-transpose strategy when dealing with scalar pentadiagonal or block tridiagonal systems. For handling geometrically complex problems the chimera strategy was adopted. For multiple zone cases we compute on each zone sequentially (using the whole parallel machine), then send the chimera interpolation data to a distributed data structure (array) laid out over the whole machine. This information transfer implies an irregular communication pattern, and is the second possible barrier to an efficient algorithm. We have implemented these ideas on the CM-5 using CMF (Connection Machine Fortran), a data parallel language which combines elements of Fortran 90 and certain extensions, and which bears a strong similarity to High Performance Fortran. We make use of the Connection Machine Scientific Software Library (CMSSL) for the linear solver and array transpose operations.

Jespersen, Dennis C.↗

NASA NTRS1986

Structure parameters in rotating Couette-Poiseuille channel flow

It is well-known that a number of steady state problems in fluid mechanics involving systems of nonlinear partial differential equations can be reduced to the problem of solving a single operator equation of the form: v + lambda Av + lambda B(v) = 0, v is the summation of H, lambda is the summation of one-dimensional Euclid space, where H is an appropriate (real or complex) Hilbert space. Here lambda is a typical load parameter, e.g., the Reynolds number, A is a linear operator, and B is a quadratic operator generated by a bilinear form. In this setting many bifurcation and stability results for problems were obtained. A rotating Couette-Poiseuille channel flow was studied, and it showed that, in general, the superposition of a Poiseuille flow on a rotating Couette channel flow is destabilizing.

Knightly, George H.↗

DOE OSTI2024

Speeding up and reducing memory usage for scientific machine learning via mixed precision

Scientific machine learning (SciML) has emerged as a versatile approach to address complex computational science and engineering problems. Within this field, physics-informed neural networks (PINNs) and deep operator networks (DeepONets) stand out as the leading techniques for solving partial differential equations by incorporating both physical equations and experimental data. However, training PINNs and DeepONets require significant computational resources, including long computational times and large amounts of memory. In search of computational efficiency, training neural networks using half precision (float16) rather than the conventional single (float32) or double (float64) precision has gained substantial interest, given the inherent benefits of reduced computational time and memory consumed. However, we find that float16 cannot be applied to SciML methods, because of gradient divergence at the start of training, weight updates going to zero, and the inability to converge to a local minima. To overcome these limitations, we explore mixed precision, which is an approach that combines the float16 and float32 numerical formats to reduce memory usage and increase computational speed. Our experiments showcase that mixed precision training not only substantially decreases training times and memory demands but also maintains model accuracy. Here, we also reinforce our empirical observations with a theoretical analysis. The research has broad implications for SciML in various computational applications.

97 MATHEMATICS AND COMPUTING↗