Search NASA⌕ Search

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.

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

At least 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS2011

Extension of Generalized Fluid System Simulation Program's Fluid Property Database

This internship focused on the development of additional capabilities for the General Fluid Systems Simulation Program (GFSSP). GFSSP is a thermo-fluid code used to evaluate system performance by a finite volume-based network analysis method. The program was developed primarily to analyze the complex internal flow of propulsion systems and is capable of solving many problems related to thermodynamics and fluid mechanics. GFSSP is integrated with thermodynamic programs that provide fluid properties for sub-cooled, superheated, and saturation states. For fluids that are not included in the thermodynamic property program, look-up property tables can be provided. The look-up property tables of the current release version can only handle sub-cooled and superheated states. The primary purpose of the internship was to extend the look-up tables to handle saturated states. This involves a) generation of a property table using REFPROP, a thermodynamic property program that is widely used, and b) modifications of the Fortran source code to read in an additional property table containing saturation data for both saturated liquid and saturated vapor states. Also, a method was implemented to calculate the thermodynamic properties of user-fluids within the saturation region, given values of pressure and enthalpy. These additions required new code to be written, and older code had to be adjusted to accommodate the new capabilities. Ultimately, the changes will lead to the incorporation of this new capability in future versions of GFSSP. This paper describes the development and validation of the new capability.

Patel, Kishan↗
NASA NTRSDate not supplied

Demonstration of Rapid Development Through Containerization: OSE-SAT

Modern advancements in spacecraft technology have enabled engineers to develop radically smaller and lighter spacecraft, which has drastically reduced the cost of putting spacecraft into space. Despite these advancements and the shrinking cost to get spacecraft into space, space exploration is still prohibitively expensive. So much so that many space missions prefer to err on the side of caution than take on additional risk by trying newer, unproven technologies. This risk-averse mission design, while very reasonable from a program management point of view, significantly impacts engineers’ ability to solve newer, more complicated problems and limits scientists’ ability to develop more complex experiments that rely on newer technology. Often these new technologies remain stuck at lower technology readiness levels for many years due to the space community's reluctance to take on the additional risks of proving out unproven technology. The Distributed Spacecraft Autonomy (DSA) team at NASA Ames Research Center is developing a containerized solution to enable the rapid development of newer space technologies and accelerate their adoption into space missions. The Opportunistic Software Experiments for Spacecraft Autonomy Testbeds (OSE-SAT) is an on-orbit test bed that aims to reduce the amount of risk associated with newer, unproven space technologies by containerizing each experiment in its own isolated environment and providing a safe, robust, and controlled interface to access spacecraft host resources that is monitored in real time by thoroughly tested Trusted Container developed by DSA. This paper will describe DSA’s implementation of OSE-SAT and discuss the benefits, as well as challenges, of on-orbit containerization.

Aaron J Woodard↗
DOE OSTI2022

Scalable preconditioning for the stabilized contact mechanics problem

We present a family of preconditioning strategies for the contact problem in fractured and faulted porous media. We combine low-order continuous finite elements to simulate the bulk deformation with piecewise constant Lagrange multipliers to impose the frictional contact constraints. This formulation is not uniformly inf-sup stable and requires stabilization. We improve previous work by Franceschini et al. (2020) by introducing a novel jump stabilization technique that requires only local geometrical and mechanical properties. We then design scalable preconditioning strategies that take advantage of the block structure of the Jacobian matrix using a physics-based partitioning of the unknowns by field type, namely displacement and Lagrange multipliers. The key to the success of the proposed preconditioners is a pseudo-Schur complement obtained by eliminating the Lagrange multiplier degrees of freedom, which can then be efficiently solved using an optimal multigrid method. Numerical results, including complex real-world problems, are presented to illustrate theoretical properties, scalability and robustness of the preconditioner. A comparison with other approaches available in the literature is also provided.

58 GEOSCIENCES↗
NASA NTRS1984

A conceptual basis for the design of damage-tolerant structural systems

Researchers define damage-tolerant structural systems as those systems which not only have adeqate intact strength to withstand initial failure but also adequate residual strength to minimize the possibility of, and hence the consequences of, further failure. The incorporation of damage tolerance cannot be done in total isolation of the function being required of the system and the costs associated with obtaining improved damage tolerance. The approach, therefore, is to formulate multiple-objective, multi-level decision support problems (DSP), the solutions of which represent a compromise between higher costs and higher damage tolerance. Mulitple-objective decision support problems are easily solved in the linear domain. These formulations, however, include both linear and nonlinear constraints and goals, which in the past, have not been considered due to the resulting complexity. Here, researchers: (1) present a complete discussion and description of decision support problems; (2) identify what further research needs to be done in order to obtain information that is required but not known for solving problems using these models; and (3) identify what needs to be done to implement this prototype method in practice.

Mistree, F.↗
DOE OSTI2025

SPIKANs: separable physics-informed Kolmogorov–Arnold networks

Physics-Informed Neural Networks (PINNs) have emerged as a promising method for solving partial differential equations (PDEs) in scientific computing. While PINNs typically use multilayer perceptrons (MLPs) as their underlying architecture, recent advancements have explored alternative neural network structures. One such innovation is the Kolmogorov–Arnold Network (KAN), which has demonstrated benefits over traditional MLPs, including faster neural scaling and better interpretability. The application of KANs to physics-informed learning has led to the development of Physics-Informed KANs (PIKANs), enabling the use of KANs to solve PDEs. However, despite their advantages, KANs often suffer from slower training speeds, particularly in higher-dimensional problems where the number of collocation points grows exponentially with the dimensionality of the system. To address this challenge, we introduce Separable Physics-Informed Kolmogorov–Arnold Networks (SPIKANs). This novel architecture applies the principle of separation of variables to PIKANs, decomposing the problem such that each dimension is handled by an individual KAN. This approach drastically reduces the computational complexity of training without sacrificing accuracy, facilitating their application to higher-dimensional PDEs. Through a series of benchmark problems, we demonstrate the effectiveness of SPIKANs, showcasing their superior scalability and performance compared to PIKANs and highlighting their potential for solving complex, high-dimensional PDEs in scientific computing.

Kolmogorov-Arnold networks↗
NASA NTRS2000

A Unified Approach to Model-Based Planning and Execution

Writing autonomous software is complex, requiring the coordination of functionally and technologically diverse software modules. System and mission engineers must rely on specialists familiar with the different software modules to translate requirements into application software. Also, each module often encodes the same requirement in different forms. The results are high costs and reduced reliability due to the difficulty of tracking discrepancies in these encodings. In this paper we describe a unified approach to planning and execution that we believe provides a unified representational and computational framework for an autonomous agent. We identify the four main components whose interplay provides the basis for the agent's autonomous behavior: the domain model, the plan database, the plan running module, and the planner modules. This representational and problem solving approach can be applied at all levels of the architecture of a complex agent, such as Remote Agent. In the rest of the paper we briefly describe the Remote Agent architecture. The new agent architecture proposed here aims at achieving the full Remote Agent functionality. We then give the fundamental ideas behind the new agent architecture and point out some implication of the structure of the architecture, mainly in the area of reactivity and interaction between reactive and deliberative decision making. We conclude with related work and current status.

Muscettola, Nicola↗
NASA NTRS1989

Computational complexities and storage requirements of some Riccati equation solvers

The linear optimal control problem of an nth-order time-invariant dynamic system with a quadratic performance functional is usually solved by the Hamilton-Jacobi approach. This leads to the solution of the differential matrix Riccati equation with a terminal condition. The bulk of the computation for the optimal control problem is related to the solution of this equation. There are various algorithms in the literature for solving the matrix Riccati equation. However, computational complexities and storage requirements as a function of numbers of state variables, control variables, and sensors are not available for all these algorithms. In this work, the computational complexities and storage requirements for some of these algorithms are given. These expressions show the immensity of the computational requirements of the algorithms in solving the Riccati equation for large-order systems such as the control of highly flexible space structures. The expressions are also needed to compute the speedup and efficiency of any implementation of these algorithms on concurrent machines.

Utku, Senol↗
DOE OSTI2024

Active Learning for Metamaterial Optimization on HPC and QC Integrated Systems

Active learning algorithms, integrating machine learning, quantum computing and optics simulation in an iterative loop, offer a promising approach to optimizing metamaterials. However, these algorithms can face difficulties in optimizing highly complex structures due to computational limitations. High-performance computing (HPC) and quantum computing (QC) integrated systems can address these issues by enabling parallel computing. In this study, we develop an active learning algorithm working on HPC-QC integrated systems. We evaluate the performance of optimization processes within active learning (i.e., training a machine learning model, problem-solving with quantum computing, and evaluating optical properties through wave-optics simulation) for highly complex metamaterial cases. Our results showcase that utilizing multiple cores on the integrated system can significantly reduce computational time, thereby enhancing the efficiency of optimization processes. Therefore, we expect that leveraging HPC-QC integrated systems helps effectively tackle large-scale optimization challenges in general.

Kim, Seongmin↗
NASA NTRS1977

Theoretical aspects of sounder antenna operation

The fundamental problem of calculating the radiation from an electric dipole immersed in a magnetoplasma is one of solving Maxwell's equations coupled to the self-consistent field-particle equations describing the plasma. For very small applied antenna voltages, the plasma dynamics may be linearized, and the plasma reaction currents computed self-consistently in terms of the voltage on the antenna. Thus, the short dipole can be idealized as a point dipole of moment P sub o = C sub a, V sub o el, where C sub a is the antenna element-to-plasma capacitance for a sheath of dimensions roughly several plasma Debye lengths and el is the dipole element's length. In actual practice, it is at this point that the first difficulty with the antenna theory arises. Even for small signals, the sheath around such an antenna will exhibit a complex impedance. For larger signals, nonlinear effects appear. Attemps are made to solve this problem.

Fredricks, R. W.↗
DOE OSTI2023

Modeling and optimization of steady flow of natural gas and hydrogen mixtures in pipeline networks

Here, we extend the canonical problems of simulation and optimization of steady-state gas flows in pipeline networks with compressors to the transport of mixtures of highly heterogeneous gases injected throughout a network. Our study is motivated by proposed projects to blend hydrogen generated using clean energy into existing natural gas pipeline systems as part of efforts to reduce the reliance of energy systems on fossil fuels. Flow in a pipe is related to endpoint pressures by a basic Weymouth equation model, with an ideal gas equation of state, where the wave speed depends on the hydrogen concentration. At vertices, in addition to mass balance, we also consider mixing of incoming flows of varying hydrogen concentrations. The problems of interest are the heterogeneous gas flow simulation (HGFS), which determines system pressures and flows given fixed boundary conditions and compressor settings, as well as the heterogeneous gas flow optimization (HGFO), which extremizes an objective by determining optimal boundary conditions and compressor settings. We examine conditions for uniqueness of solutions to the HGFS, as well as compare and contrast mixed-integer and continuous nonlinear programming formulations for the HGFO. We develop computational methods to solve both problems, and examine their performance using four test networks of increasing complexity.

08 HYDROGEN↗
DOE OSTI2020

Polymer informatics: Current status and critical next steps

Artificial intelligence (AI) based approaches are beginning to impact several domains of human life, science and technology. Polymer informatics is one such domain where AI and machine learning (ML) tools are being used in the efficient development, design and discovery of polymers. Surrogate models are trained on available polymer data for instant property prediction, allowing screening of promising polymer candidates with specific target property requirements. Questions regarding synthesizability, and potential (retro)synthesis steps to create a target polymer, are being explored using statistical means. Data-driven strategies to tackle unique challenges resulting from the extraordinary chemical and physical diversity of polymers at small and large scales are being explored. Other major hurdles for polymer informatics are the lack of widespread availability of curated and organized data, and approaches to create machine-readable representations that capture not just the structure of complex polymeric situations but also synthesis and processing conditions. Methods to solve inverse problems, wherein polymer recommendations are made using advanced AI algorithms that meet application targets, are being investigated. As various parts of the burgeoning polymer informatics ecosystem mature and become integrated, efficiency improvements, accelerated discoveries and increased productivity can result. Here in this paper, we review emergent components of this polymer informatics ecosystem and discuss imminent challenges and opportunities.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Harnessing the power of gradient-based simulations for multi-objective optimization in particle accelerators

Abstract Particle accelerator operation requires simultaneous optimization of multiple objectives. Multi-objective optimization (MOO) is particularly challenging due to trade-offs between the objectives. Evolutionary algorithms, such as genetic algorithms (GAs), have been leveraged for many optimization problems, however, they do not apply to complex control problems by design. This paper demonstrates the power of differentiability for solving MOO problems in particle accelerators using a deep differentiable reinforcement learning (DDRL) algorithm. We compare the DDRL algorithm with model-free reinforcement learning (MFRL), GA, and Bayesian optimization (BO) for simultaneous optimization of heat load and trip rates in the continuous electron beam accelerator facility. The underlying problem enforces strict constraints on both individual states and actions as well as cumulative (global) constraints on energy requirements of the beam. Using historical accelerator data, we develop a physics-based surrogate model which is differentiable and allows for back-propagation of gradients. The results are evaluated in the form of a Pareto-front with two objectives. We show that the DDRL outperforms MFRL, BO, and GA on high dimensional problems.

43 PARTICLE ACCELERATORS↗
NASA NTRS1973

Microsampling techniques for infrared spectroscopic analysis of lunar and terrestrial minerals

Microsampling techniques have been developed for infrared analysis of single mineral grains from lunar rocks and dusts, allowing a detailed molecular structure characterization of these complex fine-grained samples. The methods include special devices for isolating single grains, preparing micropellets from the grains, and obtaining in situ microspecular reflectance spectra from grains in polished rock samples. Although specifically developed for the work on lunar samples, the special techniques for single grain infrared analysis were found to be equally useful in studies of complex terrestrial mineral samples. For example, infrared microanalysis has contributed substantially in solving problems concerned with our natural resources, such as the structural characterization of minerals from commercial iron ores, marine deposits, coal, and fly ash derived from coal.

Estep, P. A.↗
NASA NTRS1974

Calculation of complex equilibria involving vaporization into vacuum

A simplified, direct approach is presented to the description of complex equilibria involving vaporization into vacuum. Emphasis is on the basic problem-solving process and on modification of existing techniques. Sequential solutions are presented to problems involving purification of a melt by vaporization into vacuum. The effects of concentration of melt and oxygen partial pressures on vaporization rates are demonstrated.

Paule, R. C.↗
NASA NTRS1982

Design of supercritical cascades with high solidity

The method of complex characteristics of Garabedian and Korn was successfully used to design shockless cascades with solidities of up to one. A code was developed using this method and a new hodograph transformation of the flow onto an ellipse. This code allows the design of cascades with solidities of up to two and larger turning angles. The equations of potential flow are solved in a complex hodograph like domain by setting a characteristic initial value problem and integrating along suitable paths. The topology that the new mapping introduces permits a simpler construction of these paths of integration.

Sanz, J. M.↗
NASA NTRS1989

CSM research: Testbed development

The Computational Structural Mechanics (CSM) Activity at Langley Research Center is developing methods for structural analysis on modern computers. To facilitate that research effort, a Testbed Development environment is being constructed. It is the purpose of the Testbed to insulate researchers from differences in the computer operating systems of modern computer systems and permit concentrated effort on the analytical problem rather than the analytical tools required to solve that problem. While modern computers enable the solution of larger problems of increasing complexity, they do so at a cost. Distributed computer environments, vector processing hardware and multiple processors dominate the current computer environment and threaten to overwhelm future analysis software. The systems software for current computers becomes more complex in order to manage the increasing complexity. The applications developer is caught between conflicting goals. They must take advantage of the computing power of new computer systems while maintaining a stable software development system. The CSM Testbed is being developed to address this problem for the computational structural analysis research community. The Langley CSM activity was initiated in October 1984. The current directions for the Testbed Development Team of the Langley CSM activity are discussed.

Gillian, Ronnie E.↗