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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Relaxations of the steady optimal gas flow problem for a non-Ideal gas

Natural gas ranks second in U.S. primary energy consumption. Because most production sites are remote, gas must be transported through pipeline networks equipped with compressors, valves, and other components. For both economic efficiency and system reliability, it is desirable to operate these networks optimally. The governing physics across pipeline components entails nonlinear, non-convex equality and inequality constraints, and the most general steady-flow operations problem is a Mixed-Integer Nonlinear Program (MINLP).This work focuses on one such steady-flow problem-the Optimal Gas Flow (OGF) for a natural gas pipeline network-which minimizes production cost subject to the steady-flow physics. For day-to-day operations, the ability to quickly compute a globally optimal solution and a strong lower bound for varying demand profiles is crucial. A promising strategy is to build tight relaxations of the OGF’s nonlinear constraints. However, many nonlinearities arising from non-ideal equations of state either lack relaxations or have relaxations that do not scale to realistic network sizes. We address this gap by combining recent advances in polyhedral relaxations for univariate functions to construct tight, computationally efficient relaxations of the OGF with a non-ideal equation of state. These relaxations solve within seconds on a standard laptop. In conclusion, we demonstrate their quality through extensive numerical experiments on very large-scale test networks from the literature and find that the proposed approach proves optimality in 92% of tested instances.

03 NATURAL GAS↗
DOE OSTI2024

Parallel computing for power system climate resiliency: Solving a large-scale stochastic capacity expansion problem with mpi-sppy

Here we propose a nodal stochastic generation and transmission expansion planning model that incorporates the output from high-resolution global climate models through load and generation availability scenarios. We implement our model in Pyomo and perform computational studies on a realistically-sized test case of the California electric grid in a high performance computing environment. We propose model reformulations and algorithm tuning to efficiently solve this large problem using a variant of the Progressive Hedging Algorithm. We utilize the parallelization capabilities and overall versatility of mpi-sppy, exploiting its hub-and-spoke architecture to concurrently obtain inner and outer bounds on an optimal expansion plan. Initial results show that instances with 360 representative days on a system with over 8,000 buses can be solved to within 5% of optimality in under 4 h of wall clock time, a first step towards solving a large-scale power system expansion planning problem across a wide range of climate-informed operational scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Influence of initial conditions on data-driven model identification and information entropy for ideal mhd problems

Data-driven methods of model identification are able to discern governing dynamics of a system from data. Such methods are well suited to help us learn about systems with unpredictable evolution or systems with ambiguous governing dynamics given our current understanding. Many plasma problems of interest fall into these categories as there are a wide range of models that exist, however each model is only useful in a certain regime and often limited by computational complexity. To ensure data-driven methods align with theory, they must be consistent and predictable when acting on data whose governing dynamics are known. Weak Sparse Identification of Nonlinear Dynamics (WSINDy) is a recently developed data-driven method that has shown promise in learning governing dynamics from data with high noise levels [1]. This work examines how WSINDy acts on ideal MHD test problems as the initial conditions are varied and specifies limiting requirements for successful equation identification. Furthermore, it is hard to recover the governing dynamics from data that emphasize a single dominant behavior. In these low information cases, Shannon information entropy is able to pick up on the redundancies in the data that affect recoverability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Faster solutions to the interdiction defense problem using suboptimal solutions

The interdiction defense (ID) problem solves a defender-attacker-defender model where the defender and attacker share the same set of components to harden and target. Here, we build upon the best response intersection (BRI) algorithm by developing the BRI with suboptimal solutions (BRI-SS) algorithm to solve the ID problem. The BRI-SS algorithm utilizes off-the-shelf optimization solvers that return suboptimal solutions at no additional computation cost. We derive novel cuts from suboptimal solutions, reducing the number of iterations required for the algorithm to converge while maintaining optimality guarantees. We also present a heuristic that utilizes all obtained suboptimal solutions to select the next defense to evaluate at each iteration. We perform computational experiments applied to power grid interdiction on standard test cases. Our results demonstrate that the BRI-SS algorithm consistently outperforms the BRI algorithm across all test cases.

Computer science↗
DOE OSTI2026

Improved Accuracy in Semi-Experimental Structure Determination by Resolving Problems Associated with Rotation of Principal Inertial Axes of Isotopologues: Structures of 1,3-Oxazole ( c -C 3 H 3 NO)

The rotational spectrum of the normal isotopologue of 1,3-oxazole (c-C 3 H 3 NO) was observed from 43 to 750 GHz. Over 3900 transitions for the ground vibrational state are measured, assigned, and least-squares fit to sextic centrifugally distorted-rotor Hamiltonians. The measured frequencies and resulting spectroscopic constants from this extended spectral range, combined with previous measurements of the nuclear quadrupole coupling constants, will facilitate astronomical searches for oxazole across the majority of the range of modern radiotelescopes. Spectra for a set of 30 oxazole isotopologues, which include multiple isotopic substitutions of each atom, are used to determine the first semi-experimental equilibrium ($r$$^{SE}_{e}$) structure and semi-experimental substitution structure ($r$$^{SE}_{e}$), each using CCSD(T) computed values for the vibration–rotation interaction and electron-mass corrections. The large number of isotopologues, including 21 isotopologues observed for the first time, and the redundant substitutions of each atom provide sufficient spectroscopic information to determine the $r$$^{SE}_{e}$ structure with the expected high level of accuracy and precision (0.0001 or 0.0002 Å in bond distances and 0.013 to 0.025° in bond angles). In the course of this study, we analyzed a known issue for some $r$$^{SE}_{e}$ structure determinations of near-oblate asymmetric tops in which inclusion of individual isotopologues degrades the structure determination. We demonstrate that this problem primarily arises from the difference in the values of the computed vibration–rotation interaction corrections as evaluated at the computed re geometry vs the $r$$^{SE}_{e}$ geometry of the “real” molecule. Our solution to this problem substantially improves the $r$$^{SE}_{e}$ structure of oxazole and likely can be generalized to many other molecules.

Chemical structure↗
DOE OSTI2025

Comparing quantum annealing and spiking neuromorphic computing for sampling binary sparse coding QUBO problems

We consider the problem of computing a sparse binary representation of an image. Given an image and an overcomplete, non-orthonormal basis, we aim to find a sparse binary vector indicating the minimal set of basis vectors that when added together best reconstruct the given input. We formulate this problem with an L 2 loss on the reconstruction error, and an L 0 loss on the binary vector enforcing sparsity. First, we solve the sparse representation QUBOs by solving them both on a D-Wave quantum annealer with Pegasus chip connectivity, as well as on the Intel Loihi 2 spiking neuromorphic processor using a stochastic Non-equilibrium Boltzmann Machine (NEBM). Second, using Quantum Evolution Monte Carlo with Reverse Annealing and iterated warm starting on Loihi 2 to evolve the solution quality from the respective machines. We demonstrate that both quantum annealing and neuromorphic computing are suitable for solving binary sparse coding QUBOs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

CHARGE-MAP: An integrated framework to study the multicriteria EV charging infrastructure expansion problem

The widespread adoption of electric vehicles (EVs) in recent years has necessitated the development of effective charging infrastructures. However, charging infrastructure expansion is a multifaceted problem that requires careful consideration of the existing infrastructure, spatiotemporal distribution of charging demands, power-grid capacity, and budget constraints. Here, to approach this complex problem, we present CHARGE-MAP, a data-driven simulation-optimization framework, focused on ensuring meaningful charging experience for individual EV owners. CHARGE-MAP integrates three modules: an agent-based simulation module that estimates spatiotemporal distribution of charging demands by modeling EV adopter mobility and charging behavior; an optimization module that determines optimal new charging station/charger locations and capacities, while minimizing expected detour distances and wait-times with a limited number of new stations; and a power module that determines how to connect the stations to the power grid while maintaining its stability. Using the state of Virginia (consisting of 95 counties and 38 independent cities) as a case study, our results show that CHARGE-MAP can meet the demand of ~198,600 predicted EVs with 1,305 new public charging stations and 2,164 new chargers. It reduces average detour distances for charging by 66% and wait-times at stations by 72% compared to the existing infrastructure. Furthermore, transformer capacity requirement analysis reveals that only 1.8% of residential transformers require upgrades, while over 80% of commercial charging locations can be supported with modest transformer infrastructure (25 to 50 kVA). This indicates that targeted investments can facilitate cost-effective EV integration. Consequently, CHARGE-MAP provides policymakers and urban planners with crucial data-driven insights for effective EV charging infrastructure expansion. Sign up for PNAS alerts.

charging infrastructure↗
DOE OSTI2025

Nonperturbative and perturbative dynamics of a light QCD axion: Dark matter and the strong 𝐶⁢𝑃 problem

Considerable theoretical efforts have gone into expanding the reach of the quantum chromodynamics (QCD) axion beyond its canonical mass–decay-constant relation. The 𝑍 𝒩 QCD axion model reduces the QCD axion mass naturally, by invoking a discrete 𝑍 𝒩 symmetry through which the axion field is coupled to 𝒩 copies of the Standard Model. Before the QCD phase transition at temperature 𝑇 QCD , the 𝑍 𝒩 potential has a minimum at misalignment angle 𝜃 = 𝜋. At 𝑇 QCD , 𝜃 = 𝜋 becomes a maximum; the axion potential becomes exponentially suppressed and develops 𝒩 minima—only one of which actually solves the strong 𝐶⁢𝑃 problem. Before 𝑇 QCD , 𝜃 relaxes toward 𝜋. After 𝑇 QCD , the axion field starts from around the hilltop and may have sufficient kinetic energy to overcome the newly suppressed potential barriers. Such a field evolution leads to nonperturbative effects via the self-interactions near the hilltop, which can cause the exponential growth of fluctuations and backreaction on the coherent motion. This behavior can influence the relic density of the field and the minimum in which it settles. We conduct the first lattice simulations of the 𝑍 𝒩 QCD axion using 𝒞osmoℒattice to accurately calculate dark matter abundances and find nonperturbative dynamics reduce the abundance by up to a factor of two. We furthermore find that the probability of solving the strong 𝐶⁢𝑃 problem tends to diverge considerably from the naïve expectation of 1/𝒩.

Axions↗
DOE OSTI2025

Sign Problem in Tensor-Network Contraction

We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we observe that the approximate contraction of tensor networks with only positive entries has lower computational complexity as compared to tensor networks with general real or complex entries. This raises the question of how this transition in computational complexity manifests itself in the hardness of different tensor-network-contraction schemes. We pursue this question by studying random tensor networks with varying bias toward positive entries. First, we consider contraction via Monte Carlo sampling and find that the transition from hard to easy occurs when the tensor entries become predominantly positive; this can be understood as a tensor-network manifestation of the well-known negative-sign problem in quantum Monte Carlo. Second, we analyze the commonly used contraction based on boundary tensor networks. The performance of this scheme is governed by the number of correlations in contiguous parts of the tensor network (which by analogy can be thought of as entanglement). Remarkably, we find that the transition from hard to easy—i.e., from a volume-law to a boundary-law scaling of entanglement—already occurs for a slight bias of the tensor entries toward a positive mean, scaling inversely with the bond dimension D , and thus the problem becomes easy the earlier the larger D occurs. This is in contrast both to expectations and to the behavior found in Monte Carlo contraction, where the hardness at fixed bias increases with the bond dimension. To provide insight into this early breakdown of computational hardness and the accompanying entanglement transition, we construct an effective classical statistical-mechanical model that predicts a transition at a bias of the tensor entries of 1 / D , confirming our observations. We conclude by investigating the computational difficulty of computing expectation values of tensor-network wave functions (projected entangled-pair states, PEPSs) and find that in this setting, the complexity of entanglement-based contraction always remains low. We explain this by providing a local transformation that maps PEPS expectation values to a positive-valued tensor network. This not only provides insight into the origin of the observed boundary-law entanglement scaling but also suggests new approaches toward PEPS contraction based on positive decompositions. Published by the American Physical Society 2025

Chen, Jielun (ORCID:0000000178411545)↗
DOE OSTI2025

Leveraging differentiable programming in the inverse problem of neutron stars

Neutron stars (NSs) probe the high-density regime of the nuclear equation of state (EOS). However, inferring the EOS from observations of NSs is a computationally challenging task. Here, in this work, we efficiently solve this inverse problem by leveraging differential programming in two ways. First, we enable full Bayesian inference in under one hour of wall time on a GPU by using gradient-based samplers, without requiring pretrained machine learning emulators. Moreover, we demonstrate efficient scaling to high-dimensional parameter spaces. Second, we introduce a novel gradient-based optimization scheme that recovers the EOS of a given NS mass-radius curve. We demonstrate how our framework can reveal consistencies or tensions between nuclear physics and astrophysics. First, we show how the breakdown density of a metamodel description of the EOS can be determined from NS observations. Second, we demonstrate how degeneracies in EOS modeling using nuclear empirical parameters can influence the inverse problem during gradient-based optimization. Looking ahead, our approach opens up new theoretical studies of the relation between NS properties and the EOS, while effectively tackling the data analysis challenges brought by future detectors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Machine Learning-Assisted Distribution System Network Reconfiguration Problem

High penetration from volatile renewable energy resources in the grid and the varying nature of loads raise the need for frequent line switching to ensure the efficient operation of electrical distribution networks. Operators must ensure maximum load delivery, reduced losses, and the operation between voltage limits. However, computations to decide the optimal feeder configuration are often computationally expensive and intractable, making it unfavorable for real-time operations. This is mainly due to the existence of binary variables in the network reconfiguration optimization problem. To tackle this issue, we have devised an approach that leverages machine learning techniques to reshape distribution networks featuring multiple substations. This involves predicting the substation responsible for serving each part of the network. Hence, it leaves simple and more tractable Optimal Power Flow problems to be solved. This method can produce accurate results in a significantly faster time, as demonstrated using the IEEE 37-bus distribution feeder. Compared to the traditional optimization-based approaches, a feasible solution is achieved approximately ten times faster for all the tested scenarios.

deep neural networks↗
DOE OSTI2025

Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems

Algorithms from Randomized Numerical Linear Algebra (RandNLA) are known to be effective in handling high-dimensional computational problems, providing high-quality empirical performance as well as strong probabilistic guarantees. However, their practical application is complicated by the fact that the user needs to set various algorithm-specific tuning parameters which are different from those used in traditional NLA. This paper demonstrates how a surrogate-based autotuning approach can be used to address fundamental problems of parameter selection in RandNLA algorithms. In particular, we provide a detailed investigation of surrogate-based autotuning for sketch-and-precondition (SAP)-based randomized least squares methods, which have been one of the great success stories in modern RandNLA. Empirical results show that our surrogate-based autotuning approach can achieve near-optimal performance with much less tuning cost than a random search (up to about 7.6x fewer trials of different parameter configurations). Moreover, while our experiments focus on least squares, our results demonstrate a general-purpose autotuning pipeline applicable to any kind of RandNLA algorithm.

Cho, Younghyun↗
DOE OSTI2025

Extended Galerkin Neural Network Approximation of Singular Variational Problems with Error Control

We present extended Galerkin neural networks, a variational framework for approximating general boundary value problems (BVPs) with error control. The main contributions of this work are (1) a rigorous theory guiding the construction of new weighted least squares variational formulations suitable for use in neural network approximation of general BVPs, and (2) an “extended” feedforward network architecture which incorporates and is even capable of learning singular solution structures, thus greatly improving approximability of singular solutions. Furthermore, numerical results are presented for several problems, including steady Stokes flow around reentrant corners and in convex corners with Moffatt eddies in order to demonstrate efficacy of the method.

a posteriori error estimate↗
DOE OSTI2024

Vanishing adsorption limit of Riemann problem solutions for the polymer model

Here we examine the vanishing adsorption limit of solutions of Riemann problems for the Glimm–Isaacson model of chemical flooding of a petroleum reservoir. A contact discontinuity is deemed admissible if it is the limit of traveling waves or rarefaction waves for an augmented system that accounts for weak chemical adsorption onto the rock. We prove that this criterion justifies the admissibility criteria adopted previously by Keyfitz–Kranzer, Isaacson–Temple and de Souza–Marchesin, provided that the fractional flow function depends monotonically on chemical concentration. We also demonstrate that the adsorption criterion selects the undercompressive contact discontinuities required to solve the general Riemann problem in an example model with non-monotone dependence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Black Box Equations of State: Creating Semi-analytic Solutions to the Noh Problem and Verifying Equation of State Interfaces

The objective of this report is threefold. First, it details a method for deriving a semi-analytic solution to the Noh Problem when using a “black-box” equation of state. Such capability allows us to perform verification on complicated, more realistic equations of state. Examples include Steinberg equations of state for materials and tabulated equations of state. The second objective is to apply the methodology to verify the singularity-eos equation of state library. We do so by solving the Rankine-Hugoinot jump conditions for the Noh Problem, ensuring singularity derives the correct solution and comparing the error to an exact implementation of the equation of state. The third objective is to perform verification of the xRAGE Eulerian hydrodynamics code when interfaced with singularity. We provide the theory, analysis, documentation for a python implementation of the proposed solver, and verification results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

A Low-Rank QTT-based Finite Element Method for Elasticity Problems

We present an efficient and robust numerical algorithm for solving the linear elasticity problem that combines the Quantized Tensor Train format and a domain partitioning strategy. This approach makes it possible to solve the linear elasticity problem on a computational domain that is more general than a square. By integrating Z-ordering and subdomain concatenation, our method substantially decreases memory usage and achieves a notable reduction in rank compared to established Finite Element implementations like the FEniCS platform. This efficiency is maintained while still guaranteeing exponential convergence with respect to the number of degrees of freedom. This performance gain, however, requires a fundamental rethinking of how core finite element operations are implemented. This includes changes to mesh discretization, node and degree of freedom ordering, stiffness matrix and internal nodal force assembly, and the execution of algebraic matrix-vector operations. In this work, we discuss all these aspects in detail and assess the method’s performance in the numerical approximation of three representative test cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Sierra/SD – Example Problems Manual – (V5.26)

The Example Problems Manual supplements the User’s Manual and the Theory Manual. The goal of the Example Problems Manual is to reduce learning time for complex end to end analyses. These documents are intended to be used together. See the User’s Manual for a complete list of the options for a solution case. All the examples are part of the Sierra/SD test suite. Each runs as is. The organization is similar to the other documents: How to run, Commands, Solution cases, Materials, Elements, Boundary conditions, and then Contact. The table of contents and index are indispensable. The Geometric Rigid Body Modes section is shared with the Users Manual.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2025

Investigating solutions to the strong CP problem (Final Technical Report)

The weak interaction violates a symmetry between particles and anti-particles that is called a CP symmetry. This violation is expected to induce CP violation in the strong interaction by a large amount. However, observations show that the CP violation in the strong interaction is smaller than expected by more than ten orders of magnitude. This discrepancy is called the strong CP problem, and solving it has been one of the motivations for constructing a theory beyond the Standard Model (SM). In this research program, the PI investigated possible signals of solutions to the strong CP problem. The signals were predicted for a variety of experiments and observations. These predictions bridge different subfields of particle physics, cosmology, and astrophysics that are otherwise disconnected. As a byproduct, the PI also applied the techniques developed in this study to theories with axion-like particles to reveal signals of axion-like particles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗