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.

SourceResearch connectionFrom yearThrough year

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

At least 127 records · Page 7

All sources NASA NTRS DOE OSTI

DOE OSTI2024

NeuroSEM: A hybrid framework for simulating multiphysics problems by coupling PINNs and spectral elements

Multiphysics problems that are characterized by complex interactions among fluid dynamics, heat transfer, structural mechanics, and electromagnetics, are inherently challenging due to their coupled nature. While experimental data on certain state variables may be available, integrating these data with numerical solvers remains a significant challenge. Physics-informed neural networks (PINNs) have shown promising results in various engineering disciplines, particularly in handling noisy data and solving inverse problems in partial differential equations (PDEs). However, their effectiveness in forecasting nonlinear phenomena in multiphysics regimes, particularly involving turbulence, is yet to be fully established. Here, this study introduces NeuroSEM, a hybrid framework integrating PINNs with the highfidelity Spectral Element Method (SEM) solver, Nektar++. NeuroSEM leverages the strengths of both PINNs and SEM, providing robust solutions for multiphysics problems. PINNs are trained to assimilate data and model physical phenomena in specific subdomains, which are then integrated into the Nektar++ solver. We demonstrate the efficiency and accuracy of NeuroSEM for thermal convection in cavity flow and flow past a cylinder. The framework effectively handles data assimilation by addressing those subdomains and state variables where the data is available. We applied NeuroSEM to the Rayleigh-B´enard convection system, including cases with missing thermal boundary conditions and noisy datasets. Finally, we applied the proposed NeuroSEM framework to real particle image velocimetry (PIV) data to capture flow patterns characterized by horseshoe vortical structures. Our results indicate that NeuroSEM accurately models the physical phenomena and assimilates the data within the specified subdomains. The framework’s plug-and-play nature facilitates its extension to other multiphysics or multiscale problems. Furthermore, NeuroSEM is optimized for efficient execution on emerging integrated GPU-CPU architectures. This hybrid approach enhances the accuracy and efficiency of simulations, making it a powerful tool for tackling complex engineering challenges in various scientific domains.

42 ENGINEERING↗

DOE OSTI2025

Distributed Stochastic Optimization of a Neural Representation Network for Time-Space Tomography Reconstruction

4D time-space reconstruction of dynamic events or deforming objects using X-ray computed tomography (CT) is an important inverse problem in non-destructive evaluation. Conventional back-projection based reconstruction methods assume that the object remains static for the duration of several tens or hundreds of X-ray projection measurement images (reconstruction of consecutive limited-angle CT scans). However, this is an unrealistic assumption for many in-situ experiments that causes spurious artifacts and inaccurate morphological reconstructions of the object. To solve this problem, we propose to perform a 4D time-space reconstruction using a distributed implicit neural representation (DINR) network that is trained using a novel distributed stochastic training algorithm. Our DINR network learns to reconstruct the object at its output by iterative optimization of its network parameters such that the measured projection images best match the output of the CT forward measurement model. Here, we use a forward measurement model that is a function of the DINR outputs at a sparsely sampled set of continuous valued 4D object coordinates. Unlike previous neural representation architectures that forward and back propagate through dense voxel grids that sample the object's entire time-space coordinates, we only propagate through the DINR at a small subset of object coordinates in each iteration resulting in an order-of-magnitude reduction in memory and compute for training. DINR leverages distributed computation across several compute nodes and GPUs to produce high-fidelity 4D time-space reconstructions. We use both simulated parallel-beam and experimental cone-beam X-ray CT datasets to demonstrate the superior performance of our approach.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Karhunen–Loève deep learning method for surrogate modeling and approximate Bayesian parameter estimation

We evaluate the performance of the Karhunen-Loève Deep Neural Network (KL-DNN) framework for surrogate modeling and approximate Bayesian parameter estimation in partial differential equation models. In the surrogate model, the Karhunen-Loève (KL) expansions are used for the dimensionality reduction of the number of unknown parameters and variables, and a deep neural network is employed to relate the reduced space of parameters to that of the state variables. The KL-DNN surrogate model is used to formulate a maximum-a-posteriori-like least-squares problem, which is randomized to draw samples of the posterior distribution of the parameters. We test the proposed framework for a hypothetical unconfined aquifer via comparison with the forward MODFLOW and inverse PEST++ iterative ensemble smoother (IES) solutions as well as the state-of-the-art Fourier neural operator (FNO) and deep operator networks (DeepONets) operator learning surrogate models. Our results show that the KL-DNN surrogate model outperforms FNO and DeepONet for forward predictions. For solving inverse problems, the randomized algorithm provides the same or more accurate Bayesian predictions of the parameters than IES as evidenced by the higher log-predictive probability of both the estimated parameter field and the forecast hydraulic head. The posterior mean obtained from the randomized algorithm is closer to the reference parameter field than that obtained with FNO as the maximum a posteriori estimate.

Approximate Bayesian inference↗

DOE OSTI2026

A Survey on the Expanding Scope and Interdisciplinary Opportunities for Processing-in-Memory Techniques

Processing-in-Memory (PIM) is emerging as a practical path to overcome the limitations of traditional von Neumann architectures. At its core, PIM systems implement computing primitives such as logic operations and multiply-accumulate acceleration through compute-in-memory, near-memory processing, or hybrid designs. The role of memory cells varies widely across technologies, acting as inputs, outputs, or analog accumulators through bit-lines and sense amplifiers. This diversity creates trade-offs in precision, bandwidth, latency, and programmability, making it difficult to build a unified understanding on the progress of the field. In this survey, we organize recent advances of PIM into three areas. First, we discuss the progress on the architectural optimizations of PIM and its integration with both DRAM and emerging non-volatile memories. Second, we examine how PIM is being used to accelerate key computing domains, including generative AI workloads and high-performance kernels, along with new approaches. Third, we highlight the growing adoption of PIM in computational sciences, where it is being applied to solve interdisciplinary problems such as genome analysis, mRNA quantification, mass spectrometry, quantum circuit simulation, wave modeling, and secure computation. Finally, we synthesize the major challenges that continue to slow PIM adoption, including manufacturing constraints, power delivery, thermal reliability, data consistency, runtime and memory-management coordination, and the difficulty of building portable software abstractions without sacrificing commercial viability. This work provides an updated, structured perspective on PIM’s potential across computing and computational sciences and the barriers that must be solved for it to reach its full impact.

Asifuzzaman, Kazi [Oak Ridge National Laboratory (↗

DOE OSTI2025

A Novel LDPP-MADDPG Approach for Distributed Power Allocation in mmWave Cellular Networks

This paper considers the problem of distributed beam scheduling and power allocation problem in millimeter- Wave (mmWave) cellular networks, in which multiple Base Stations (BSs) operate as individual operators over a shared spectrum. We propose a novel learning-aided approach that integrates the Lyapunov Drift-Plus-Penalty (LDPP) framework and Multi-agent Deep Deterministic Policy Gradient (MADDPG) reinforcement learning algorithms. This offers a powerful approach to learning stable and constraint-aware policies, reaping the joint benefit of both LDPP and MADDPG, in complex multiagent environments. The major challenge for this approach is to integrate these two approaches in a meaningful and effective manner. The key idea to solve this problem is to introduce a novel feature of local observation that incorporates potential negative value of the reward function due to the stochastic constraints introduced by the LDPP framework. Empirical results demonstrate that our proposed scheme outperforms the baseline methods under various conditions.

99 - GENERAL AND MISCELLANEOUS↗

DOE OSTI2025

A copula-based rank histogram ensemble filter

Serial ensemble filters implement triangular probability transport maps to reduce high-dimensional inference problems to sequences of state-by-state univariate inference problems. The univariate inference problems are solved by sampling posterior probability densities obtained by combining constructed prior densities with observational likelihoods according to Bayes' rule. Many serial filters in the literature focus on representing the marginal posterior densities of each state. However, rigorously capturing the conditional dependencies between the different univariate inferences is crucial to correctly sampling multidimensional posteriors. This work proposes a new serial ensemble filter, called the copula rank histogram filter (CoRHF), that seeks to capture the conditional dependency structure between variables via empirical copula estimates; these estimates are used to rigorously implement the triangular (state-by-state univariate) Bayesian inference. The success of the CoRHF is demonstrated on two-dimensional examples and the Lorenz'63 problem. A practical extension to the high-dimensional setting is developed by localizing the empirical copula estimation, and is demonstrated on the Lorenz'96 problem.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Cuts and contours

The traditional formulation of string amplitudes via worldsheet integrals provides a parametrization of the moduli space that fails to expose the complete singularity structure of the amplitudes. This problem is solved by the positive parametrization of string amplitudes given by surfaceology. In this work, we use this formalism to study a number of properties of string amplitudes at tree-level and one-loop. We introduce several global prescriptions for an integration contour for which the integrals are finite everywhere in kinematic space. At tree-level, this is done in two ways: one directly implements the Feynman iε to analytically continue from Euclidean to Lorentzian worldsheets; the other is a generalization of the closed Pochhammer contour to arbitrary number of points. At loop-level, we present a systematic way of extracting cuts directly from the worldsheet integrand. This provides a powerful set of unitarity constraints, which we use to test the consistency of different “stringy” UV regularizations of field theory amplitudes. In addition, we identify the massive threshold expansion of the integrand, which allows us to reduce the problem to a finite set of Feynman integrals in Schwinger parametrization and provide a straightforward contour prescription reminiscent of its field-theory version.

Bosonic Strings↗

DOE OSTI2025

Adaptive Interface-PINNs (AdaI-PINNs) for inverse problems: Determining material properties for heterogeneous systems

Here, we determine spatially varying discontinuous material properties using a domain-decomposition based physics-informed neural networks (PINNs) framework named the Adaptive Interface-PINNs or AdaI-PINNs (Roy et al., 2024). We propose the use of distinct neural networks for the field variables and material properties within each material, utilizing adaptive activation functions. While the neural networks across different materials share the same weights and biases, their activation functions are uniquely tailored using a hyperparameter that influences the slope of the activation function. The proposed framework is tested on several one-dimensional and two-dimensional benchmark examples, and its performance is compared with conventional PINNs and existing domain-decomposition PINNs frameworks, namely, the Multi-domain physics-informed neural network (M-PINN), and the eXtended physics-informed neural networks (XPINNs). The results demonstrate that the proposed approach can determine randomly distributed discontinuous material properties with an L 2 error of $\mathscr{O}$ (10 -3 ) for the material property and the root-mean-square error of $\mathscr{O}$ (10 -3 ) for the primary variable while the other approaches yield errors that are approximately two orders of magnitude larger (that is, $\mathscr{O}$ (10 -1 )). Moreover, the spatial distribution of material properties obtained using the proposed framework is in close agreement with the true distribution, whereas the other approaches fare much worse. Additionally, the proposed approach is approximately 40% faster than its competitors, indicating its potential as a robust alternative for solving inverse problems in heterogeneous materials.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Fast meta-solvers for 3D complex-shape scatterers using neural operators trained on a non-scattering problem

Three-dimensional target identification using scattering techniques requires high accuracy solutions and very fast computations for real-time predictions in some critical applications. We first train a deep neural operator (DeepONet) to solve wave propagation problems described by the Helmholtz equation in a domain without scatterers but at different wavenumbers and with a complex absorbing boundary condition. We then design two classes of fast meta-solvers by combining DeepONet with either relaxation methods, such as Jacobi and Gauss-Seidel, or with Krylov methods, such as GMRES and BiCGStab, using the trunk basis of DeepONet as a coarse-scale preconditioner. We leverage the spectral bias of neural networks to account for the lower part of the spectrum in the error distribution while the upper part is handled inexpensively using relaxation methods or fine-scale preconditioners. The meta-solvers are then applied to solve scattering problems with different shape of scatterers, at no extra training cost. We first demonstrate that the resulting meta-solvers are shape-agnostic, fast, and robust, whereas the standard standalone solvers may even fail to converge without the DeepONet. We then apply both classes of meta-solvers to scattering from a submarine, a complex three-dimensional problem. We achieve very fast solutions, especially with the DeepONet-Krylov methods, which require orders of magnitude fewer iterations than any of the standalone solvers.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Grand unification at the cosmological collider with chemical potential

We introduce a tree-level chemical potential mechanism for spin-1 particles within cosmological collider physics, allowing them to be detected in primordial non-Gaussianities for masses above the inflationary Hubble scale. We apply this mechanism to orbifold grand unification and the massive unification partners of the standard model gauge bosons. Our mechanism requires at least a pair of massive vector fields which are singlets of the standard model, a condition which is satisfied in the classic “trinification” scenario. Assuming that the gauge hierarchy problem is solved by supersymmetry, gauge coupling running points to unification partners at ~ 10$^{15}$ GeV. We show that, within high-scale inflation, chemical potential enhancement can lead to observably strong signals for trinification partners in future cosmological surveys.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2025

A flavor of SO(10) unification with a spinor Higgs

We investigate Higgs Parity unification — a realization of SO(10) grand unification based on the Higgs Parity mechanism in which the Standard Model (SM) Higgs resides in a spinor representation. The theory has an intermediate left-right symmetric stage where the SU(2)R symmetry breaking scale is fixed by the vanishing of the SM Higgs quartic coupling. The strong CP problem is solved by parity. Gauge coupling unification successfully predicts αs(MZ) to within 1%. The spinor Higgs naturally leads to a seesaw origin for SM flavor observables. We identify a novel mechanism where large mixing of third generation fermions with additional heavy vector-like fermions accounts for the anarchical nature of the PMNS matrix and the lack of hierarchy in the neutrino mass spectrum, relative to the up-quarks. A fit to quark and lepton masses and mixings, with a minimal parameter set, predicts 1) A testable relation between the top quark mass and αs(MZ) which is about (1 – 2)σ from current best fit values, 2) The order of magnitude of the baryon asymmetry of the universe, via leptogenesis from second-generation right-handed neutrino decays. 3) The proton decay and the neutron EDM are likely observable in next generation experiments, and 4) A normal ordered neutrino mass spectrum where 0νββ decay and the mass of the lightest neutrino are out of reach of next generation experiments.

Baryo-and Leptogenesis↗

DOE OSTI2025

A Type II Hamiltonian Variational Principle and Adjoint Systems for Lie Groups

We present a novel Type II variational principle on the cotangent bundle of a Lie group which enforces Type II boundary conditions, i.e., fixed initial position and final momentum. In general, such Type II variational principles are only globally defined on vector spaces or locally defined on general manifolds; however, by left translation, we are able to define this variational principle globally on cotangent bundles of Lie groups. Type II boundary conditions are particularly important for adjoint sensitivity analysis, which is our motivating application. As such, we additionally discuss adjoint systems on Lie groups, their properties, and how they can be used to solve optimization problems subject to dynamics on Lie groups.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints

Augmented Lagrangian (AL) methods have proven remarkably useful in solving optimization problems with complicated constraints. The last decade has seen the development of overall complexity guarantees for inexact AL variants. Yet, a crucial gap persists in addressing nonsmooth convex constraints. To this end, we present a smoothed augmented Lagrangian (AL) framework where nonsmooth terms are progressively smoothed with a smoothing parameter $\eta _k$ . The resulting AL subproblems are $\eta _k$ -smooth, allowing for leveraging accelerated schemes. By a careful selection of the inexactness level $\epsilon _k$ (for inexact subproblem resolution), the penalty parameter $\rho _k$ , and smoothing parameter $\eta _k$ at epoch k, we derive rate and complexity guarantees of $\tilde{\mathcal {O}}(1/{\varepsilon }^{3/2})$ and $\tilde{\mathcal {O}}(1/{\varepsilon })$ in convex and strongly convex regimes for computing an ${\varepsilon }$ -optimal solution, when $\rho _k$ increases at a geometric rate, a significant improvement over the best available guarantees for AL schemes for convex programs with nonsmooth constraints. Analogous guarantees are developed for settings with $\rho _k = \rho$ as well as $\eta _k = \eta$ . Preliminary numerics on a fused Lasso problem display promise.

augmented Lagrangian↗

DOE OSTI2025

Asymmetrical cavity design that bypasses mode mixings in axion haloscope experiments

Microwave cavities used in axion haloscope experiments typically employ a tuning rod as a means to widen the range of resonance frequencies at which it is sensitive to axion-to-photon conversion. A realistic tuning mechanism requires a gap between the cavity end caps and the tuning rod to ensure movement, and causes some modes to hybridize with the resonant mode that is being tracked for the experiment. These so-called mode mixings lead to gaps in the frequency range that practically lose sensitivity to axions. Here, to solve this problem, we present a cavity design which, for two tuning rod configurations corresponding to a lower and higher frequency range, have a dielectric rod inserted at a specific location that makes the cavity asymmetrical. Moving the tuning rod closer to the dielectric insert changes the location and frequency of the mode mixing compared to when it is farther away from it. This design is easily realizable in practical experiments and makes possible an axion dark matter search with minimal loss in sensitivity due to mode mixings. We also show that the same design has the same desired effect when cavity dimensions are scaled down to be smaller and are at higher resonance frequencies.

Axion↗

DOE OSTI2025

Solving high-dimensional inverse problems using amortized likelihood-free inference with noisy and incomplete data

Here, we present a likelihood-free probabilistic inversion method based on normalizing flows for high-dimensional inverse problems. The proposed method is composed of two complementary networks: a summary network for data compression and an inference network for parameter estimation. The summary network encodes raw observations into a fixed-size vector of summary features, while the inference network generates samples of the approximate posterior distribution of the model parameters based on these summary features. The posterior samples are produced in a deep generative fashion by sampling from a latent Gaussian distribution and passing these samples through an invertible transformation. We construct this invertible transformation by sequentially alternating conditional invertible neural network and conditional neural spline flow layers. The summary and inference networks are trained simultaneously. We apply the proposed method to an inversion problem in groundwater hydrology to estimate the posterior distribution of the log-conductivity field conditioned on spatially sparse time-series observations of the system’s hydraulic head responses. The conductivity field is represented with 706 degrees of freedom in the considered problem. Comparison with the likelihood-based iterative ensemble smoother PEST-IES method demonstrates that the proposed method accurately estimates the parameter posterior distribution and the observations’ predictive posterior distribution at a fraction of the inference time of PEST-IES.

conditional invertible neural network↗

DOE OSTI2026

Fabrication, oxidation, and combustion of nanoscale magnesium diboride and tetraboride

The difficult ignition and low combustion efficiency of boron particles decrease the performance of boron-loaded, fuel-rich propellants for solid fuel ramjets and ducted rockets. One approach to solving this problem involves the use of magnesium diboride (MgB 2 ), which ignites easier than boron. Magnesium tetraboride (MgB 4 ) offers greater energy density owing to its higher boron content. However, the effect of B/Mg ratio on the ignition and combustion is unknown. Additionally, while nanoscale MgB₂ particles and quasi-2D structures are promising energetic additives, the oxidation and combustion properties of nanoscale MgB₄ have not been explored. To address these knowledge gaps, the present work included synthesis and high-energy ball milling of MgB 2 and MgB 4 powders, thermogravimetric analysis (TGA) of their oxidation, and combustion experiments with thin layers of the obtained powders. Comparison of two synthesis routes (a solid-state reaction in a tube furnace and combustion synthesis) has shown that the former is the superior method for producing magnesium borides. TGA has revealed that oxidation of both MgB 2 and MgB 4 results in a high conversion into the oxides (88–91 %), far exceeding the low conversion of boron (62.5 %). MgB 4 begins to oxidize rapidly at a much lower temperature (∼900 °C) than MgB 2 (∼1200 °C). The burning rates of milled MgB 2 and MgB 4 are about eight and five times, respectively, faster than that of submicron boron. Magnesium borides exhibit a stable, sustained boron flame, needed for high combustion efficiency, whereas physical Mg/B mixtures undergo Mg-driven "flash" combustion.

Boron↗

DOE OSTI2025

A tri-level distribution locational marginal price-based demand response framework

Here, in this paper, we propose a tri-level, nested, two-stage price-based demand response (PBDR) framework that considers distribution locational marginal price (DLMP) as DR enabler between load-serving entities (LSE), demand response providers (DRPs), and customers in the day-ahead distribution market. It enables LSE and customer interactions by using multiple DRPs, positioned in-between, and independently optimizes their objectives. The problem is formulated using linear power flow with approximated power losses and its application in DLMP as DR pricing. The tri-level problem is solved using a nested reformulation & decomposition (R&D) method and tested on the real Indian-108 bus distribution system under various dynamic pricings. Further, the temporal–spatial variations in DLMPs are assessed using fairness criteria. Numerical analyses demonstrate that DLMP applications can effectively improve economic efficiency, and transparency in DR programs valuation with a favorable fairness margin. The results show that DLMP as DR pricing signal induces (0-2) % variation in DLMP for DR participation up to 10 %. Further, it gives over 90 % fairness over temporal–spatial variation for all the customers.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2024

A hierarchical framework for aggregating grid-interactive buildings with thermal and battery energy storage

The behind-the-meter (BTM) thermal and battery energy storage can help improve energy efficiency, reduce energy costs, and enhance energy resilience, particularly in rural areas and for disadvantaged communities. Aggregating numerous BTM energy storage systems can act as a price influencer with a significant source of load shifting and peak demand reduction. An integrated and scalable control mechanism is required to effectively utilize energy storage systems and flexible building loads to maximize the economic benefits, considering various distribution system constraints. Here, this paper presents an innovative hierarchical coordination framework for energy storage and flexible load in buildings, considering various factors such as electricity prices, thermal comfort, and distribution system modeling and constraints. At the upper level, a distribution system operator optimizes the power flow to minimize its power procurement costs from the electricity wholesale market, while at the lower level, aggregators determine the optimal dispatch of battery and thermal energy storage systems in multiple buildings on behalf of end-users to minimize operating costs according to the power prices. These problems are solved using a game-theoretic approach through negotiations between the distribution system operator and aggregators as a bi-level decision model. Simulation case studies have been performed for a test distribution network with a number of building end-users using energy storage systems to quantify the performance of aggregators. The results demonstrate that the proposed strategy can reduce peak load for a reliable electricity distribution network while saving electricity bills for customers.

25 ENERGY STORAGE↗