Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem Solving”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

On the motion of compact objects in relativistic viscous fluids

We present a world-line effective field theory of compact objects moving relativistically through a viscous fluid. The theory is valid when velocity gradients are small compared to the inverse size of the object. Working within the EFT eliminates the need to solve a boundary value problem by turning all interactions between the fluid and the object into a source term in the action. We use the EFT to derive the relativistic equations of motion for a compact object immersed in a viscous fluid in a curved background, when the relative velocity of the object and the fluid is small compared to the speed of light.

astrophysical black holes↗
DOE OSTI2024

Towards dynamical low-rank approximation for neutrino kinetic equations. Part I: Analysis of an idealized relaxation model

Dynamical low-rank approximation (DLRA) is an emerging tool for reducing computational costs and provides memory savings when solving high-dimensional problems. Here, in this work, we propose and analyze a semi-implicit dynamical low-rank discontinuous Galerkin (DLR-DG) method for the space homogeneous kinetic equation with a relaxation operator, modeling the emission and absorption of particles by a background medium. Both DLRA and the discontinuous Galerkin (DG) scheme can be formulated as Galerkin equations. To ensure their consistency, a weighted DLRA is introduced so that the resulting DLR-DG solution is a solution to the fully discrete DG scheme in a subspace of the standard DG solution space. Similar to the standard DG method, we show that the proposed DLR-DG method is well-posed. We also identify conditions such that the DLR-DG solution converges to the equilibrium. Numerical results are presented to demonstrate the theoretical findings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Graph-learning approach to combine multiresolution seismic velocity models

SUMMARY The resolution of velocity models obtained by tomography varies due to multiple factors and variables, such as the inversion approach, ray coverage, data quality, etc. Combining velocity models with different resolutions can enable more accurate ground motion simulations. Toward this goal, we present a novel methodology to fuse multiresolution seismic velocity maps with probabilistic graphical models (PGMs). The PGMs provide segmentation results, corresponding to various velocity intervals, in seismic velocity models with different resolutions. Further, by considering physical information (such as ray path density), we introduce physics-informed probabilistic graphical models (PIPGMs). These models provide data-driven relations between subdomains with low (LR) and high (HR) resolutions. Transferring (segmented) distribution information from the HR regions enhances the details in the LR regions by solving a maximum likelihood problem with prior knowledge from HR models. When updating areas bordering HR and LR regions, a patch-scanning policy is adopted to consider local patterns and avoid sharp boundaries. To evaluate the efficacy of the proposed PGM fusion method, we tested the fusion approach on both a synthetic checkerboard model and a fault zone structure imaged from the 2019 Ridgecrest, CA, earthquake sequence. The Ridgecrest fault zone image consists of a shallow (top 1 km) high-resolution shear-wave velocity model obtained from ambient noise tomography, which is embedded into the coarser Statewide California Earthquake Center Community Velocity Model version S4.26-M01. The model efficacy is underscored by the deviation between observed and calculated traveltimes along the boundaries between HR and LR regions, 38 per cent less than obtained by conventional Gaussian interpolation. The proposed PGM fusion method can merge any gridded multiresolution velocity model, a valuable tool for computational seismology and ground motion estimation.

Geochemistry & Geophysics↗
DOE OSTI2025

Machine learning force field model for kinetic Monte Carlo simulations of itinerant Ising magnets

Here, we present a scalable machine learning (ML) framework for large-scale kinetic Monte Carlo (kMC) simulations of itinerant electron Ising systems. As the effective interactions between Ising spins in such itinerant magnets are mediated by conducting electrons, the calculation of energy change due to a local spin update requires solving an electronic structure problem. Such repeated electronic structure calculations could be overwhelmingly prohibitive for large systems. Assuming the locality principle, a convolutional neural network (CNN) model is developed to directly predict the effective local field and the corresponding energy change associated with a given spin update based on Ising configuration in a finite neighborhood. As the kernel size of the CNN is fixed at a constant, the model can be directly scalable to kMC simulations of large lattices. Our approach is reminiscent of the ML force field models widely used in first-principles molecular dynamics simulations. Applying our ML framework to a square-lattice double-exchange Ising model, we uncover unusual coarsening of ferromagnetic domains at low temperatures. Our work highlights the potential of ML methods for large-scale modeling of similar itinerant systems with discrete dynamical variables.

machine learning↗
DOE OSTI2025

Search for Axion Dark Matter from 1.1 to 1.3 GHz with ADMX

Axion dark matter can satisfy the conditions needed to account for all of the dark matter and solve the strong 𝐶⁢𝑃 problem. The Axion Dark Matter eXperiment (ADMX) is a direct dark matter search using a haloscope to convert axions to photons in an external magnetic field. Key to this conversion is the use of a microwave resonator that enhances the sensitivity at the frequency of interest. The ADMX experiment boosts its sensitivity using a dilution refrigerator and near quantum-limited amplifier to reduce the noise level in the experimental apparatus. In the most recent run, ADMX searched for axions between 1.10 and 1.31 GHz to extended Kim-Shifman-Vainshtein-Zakharov sensitivity. This Letter reports on the results of that run, as well as unique aspects of this experimental setup.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

High-quality composite Pati-Salam axion

We present a composite QCD axion model where the Peccei-Quinn symmetry emerges as a high-quality, accidental symmetry. The axion potential is only modified by eight-fermion, dimension-12 operators, which if present at the Planck scale, allow for axion dark matter from misalignment while solving the strong 𝐶⁢𝑃 problem. The model is an SU⁡(𝑁 𝑐 ) gauge theory with ten flavors where the Pati-Salam unified subgroup SO⁡(6) × SO⁡(4) ⊂ SU⁢(10)𝐿 and Sp⁡(10) ⊂ SU⁢(10) 𝑅 are weakly gauged. The dynamics breaks SU⁢(10) 𝐿 × SU⁢(10) 𝑅 → SU⁢(10) 𝑉 and the weakly gauged groups to U⁡(3) × U⁡(2) ⊃ SU⁢(3) 𝑐 × SU⁢(2) 𝐿 × U⁡(1) 𝑌 , with the QCD axion identified as one of the Nambu-Goldstone bosons. This axion has a relatively large coupling to photons while a residual $\bar{𝜃}$ eff may be just below the current limit on the neutron electric dipole moment. If the dimension-12 operators are present near the grand unified theory scale, they can cause domain wall networks to decay, allowing for axion dark matter even for the postinflationary scenario.

Gherghetta, Tony [University of Minnesota, Minneap↗
DOE OSTI2025

Detecting axion dynamics on the surface of magnetic topological insulators

Axions, initially proposed to solve the strong CP problem, have recently gained attention in condensed matter physics, particularly in topological insulators. However, detecting axion dynamics has proven challenging, with no experimental confirmations to date. In this paper, we identify the surface of magnetic topological insulators as an ideal platform for observing axion dynamics. The vanishing bulk gap at the surface allows for order O(1) variations in the axion field, making the detection of axionlike phenomena more feasible. In contrast, these phenomena are strongly suppressed in the bulk due to the small magnetic exchange gap. We investigate two-photon decay as a signature of axion dynamics and calculate the branching ratio using a perturbative approach. Our findings reveal that the photon flux emitted from the surface is in plane and orders of magnitude larger than that from the bulk, making it detectable with modern microwave technology. We also discuss potential material platforms for detecting axion two-photon decay and strategies to enhance the signal-to-noise ratio.

Gao, Zhi-Qiang↗
DOE OSTI2024

Cosmological dynamics of string theory axion strings

The quantum chromodynamics (QCD) axion may solve the strong CP problem and explain the dark matter (DM) abundance of our Universe. The axion was originally proposed to arise as the pseudo-Nambu-Goldstone boson of global U⁢(1) PQ Peccei-Quinn (PQ) symmetry breaking, but axions also arise generically in string theory as zero modes of higher-dimensional gauge fields. In this work we show that string theory axions behave fundamentally differently from field theory axions in the early Universe. Field theory axions may form axion strings if the PQ phase transition takes place after inflation. In contrast, we show that string theory axions do not generically form axion strings. In special inflationary paradigms, such as D-brane inflation, string theory axion strings may form; however, their tension is parametrically larger than that of field theory axion strings. We then show that such QCD axion strings overproduce the DM abundance for all allowed QCD axion masses and are thus ruled out, except in scenarios with large warping. A loop-hole to this conclusion arises in the axiverse, where an axion string could be composed of multiple different axion mass eigenstates; a heavier eigenstate could collapse the network earlier, allowing for the QCD axion to produce the correct DM abundance and also generating observable gravitational wave signals.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Feedback-based quantum algorithms for ground state preparation

The ground state properties of quantum many-body systems are a subject of interest across chemistry, materials science, and physics. Thus, algorithms for finding ground states can have broad impacts. Variational quantum algorithms are one class of ground state algorithms that has received significant attention in recent years. These algorithms utilize a hybrid quantum-classical computing framework to prepare ground states on quantum computers. However, this requires solving a classical optimization problem that can become prohibitively expensive in high dimensions. Here, we develop formulations of feedback-based quantum algorithms for ground state preparation that can be used to address this challenge for two broad classes of Hamiltonians: Fermi-Hubbard Hamiltonians, and molecular Hamiltonians represented in second quantization. Feedback-based quantum algorithms are optimization-free; in place of classical optimization, quantum circuit parameters are set according to a deterministic feedback law derived from quantum Lyapunov control principles. This feedback law guarantees a monotonic improvement in solution quality with respect to the depth of the quantum circuit. A variety of numerical illustrations are provided that analyze the convergence and robustness of feedback-based quantum algorithms for these problem classes. Published by the American Physical Society 2024

Larsen, James B. (ORCID:000000020777440X)↗
DOE OSTI2024

Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows

Solving the electronic structure problem of molecules and solids to high accuracy is a major challenge in quantum chemistry and condensed matter physics. The rapid emergence and development of quantum computers offer a promising route to systematically tackle this problem. Recent work by [Huggins et al ., Nature (London) 603 , 416 (2022)] proposed a hybrid quantum-classical quantum Monte Carlo (QC-QMC) algorithm using Clifford shadows to determine the ground state of a Fermionic Hamiltonian. This approach displayed inherent noise resilience and the potential for improved accuracy compared to its purely classical counterpart. Nevertheless, the use of Clifford shadows introduces an exponentially scaling postprocessing cost. In this work, we investigate an improved QC-QMC scheme utilizing the recently developed Matchgate shadows technique [Commun. Math. Phys. 404 , 629 (2023)], which removes the aforementioned exponential bottleneck. We observe from experiments on quantum hardware that the use of Matchgate shadows in QC-QMC is inherently noise robust. We show that this noise resilience has a more subtle origin than in the case of Clifford shadows. Nevertheless, we find that classical postprocessing, while asymptotically efficient, requires hours of runtime on thousands of classical CPUs for even the smallest chemical systems, presenting a major challenge to the scalability of the algorithm.

Monte Carlo methods↗
DOE OSTI2025

Latent diffusion can map beam loss to two-dimensional phase-space projections

Beam loss monitors (BLMs) and beam current monitors (BCMs) are ubiquitous at particle accelerators around the world. These simple devices provide noninvasive high-level beam measurements but give no insight into the detailed 6D (𝑥,𝑦,𝑧,𝑝 𝑥 ,𝑝 𝑦 ,𝑝 𝑧 ) beam phase-space distributions or dynamics. We show that generative conditional latent diffusion models can learn intricate patterns to solve the extreme inverse problem of mapping waveforms of tens of BLMs or BCMs along an accelerator to detailed 2D projections of a charged particle beam’s 6D phase-space density. This transformational method can be used at any particle accelerator to transform simple noninvasive devices into detailed beam phase-space diagnostics. We demonstrate this concept via multiparticle simulations of the high-intensity beam in the kilometer-long Los Alamos Neutron Science Center linear proton accelerator.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Hamiltonian parameter inference from resonant inelastic x-ray scattering with active learning

Identifying model Hamiltonians is a vital step toward creating predictive models of materials. Here, in this study, we combine Bayesian optimization with the EDRIXS numerical package to infer Hamiltonian parameters from resonant inelastic x-ray scattering (RIXS) spectra within the single atom approximation. To evaluate the efficacy of our method, we test it on experimental RIXS spectra of NiPS 3 , NiCl 2 , Ca 3 ⁢LiOsO 6 , and Fe 2⁢ O 3 , and demonstrate that it can reproduce results obtained from hand-fitted parameters to a precision similar to expert human analysis while providing a more systematic mapping of parameter space. Our work provides a key first step toward solving the inverse scattering problem to extract effective multi-orbital models from information-dense RIXS measurements, which can be applied to a host of quantum materials. We also propose atomic model parameter sets for two materials, Ca 3⁢ LiOsO 6 and Fe 2⁢ O 3 , that were previously missing from the literature.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Bragg Spot Finder (BSF): a new machine-learning-aided approach to deal with spot finding for rapidly filtering diffraction pattern images

Macromolecular crystallography contributes significantly to understanding diseases and, more importantly, how to treat them by providing atomic resolution 3D structures of proteins. This is achieved by collecting X-ray diffraction images of protein crystals from important biological pathways. Spotfinders are used to detect the presence of crystals with usable data, and the spots from such crystals are the primary data used to solve the relevant structures. Having fast and accurate spot finding is essential, but recent advances in synchrotron beamlines used to generate X-ray diffraction images have brought us to the limits of what the best existing spotfinders can do. This bottleneck must be removed so spotfinder software can keep pace with the X-ray beamline hardware improvements and be able to see the weak or diffuse spots required to solve the most challenging problems encountered when working with diffraction images. In this paper, we first present Bragg Spot Detection (BSD), a large benchmark Bragg spot image dataset that contains 304 images with more than 66 000 spots. We then discuss the open source extensible U-Net-based spotfinder Bragg Spot Finder (BSF), with image pre-processing, a U-Net segmentation backbone, and post-processing that includes artifact removal and watershed segmentation. Finally, we perform experiments on the BSD benchmark and obtain results that are (in terms of accuracy) comparable to or better than those obtained with two popular spotfinder software packages ( Dozor and DIALS ), demonstrating that this is an appropriate framework to support future extensions and improvements.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Predicting the Future of Supercomputing

The need to solve high-complexity problems using large-scale tightly coupled computing (that is, supercomputing) continues to grow. Here, in this article, we address the needs, challenges, and opportunities for supercomputing over the next decade.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

LossLens: Diagnostics for Machine Learning Through Loss Landscape Visual Analytics

Modern machine learning often relies on optimizing a neural network's parameters using a loss function to learn complex features. Beyond training, examining the loss function with respect to a network's parameters (i.e., as a loss landscape) can reveal insights into the architecture and learning process. While the local structure of the loss landscape surrounding an individual solution can be characterized using a variety of approaches, the global structure of a loss landscape, which includes potentially many local minima corresponding to different solutions, remains far more difficult to conceptualize and visualize. To address this difficulty, we introduce LossLens, a visual analytics framework that explores loss landscapes at multiple scales. LossLens integrates metrics from global and local scales into a comprehensive visual representation, enhancing model diagnostics. Here we demonstrate LossLens through two case studies: visualizing how residual connections influence a ResNet-20, and visualizing how physical parameters influence a physics-informed neural network (PINN) solving a simple convection problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Improved microgrid resiliency through distributionally robust optimization under a policy-mode framework

Critical energy infrastructure are constantly under stress due to the ever increasing disruptions caused by wildfires, hurricanes, other weather related extreme events and cyber-attacks. Hence it becomes important to make critical infrastructure resilient to threats from such cyber-physical events. However, such events are hard to predict and numerous in nature and type and it becomes infeasible to make a system resilient to every possible such cyber-physical event. Such an approach can make the system operation overly conservative and impractical to operate. Furthermore, distributions of such events are hard to predict and historical data available on such events can be very sparse, making the problem even harder to solve. To deal with these issues, in this paper we present a policy-mode framework that enumerates and predicts the probability of various cyber-physical events and then a distributionally robust optimization (DRO) formulation that is robust to the sparsity of the available historical data. The proposed algorithm is illustrated on an islanded microgrid example: a modified IEEE 123-node feeder with distributed energy resources (DERs) and energy storage. Simulations are carried to validate the resiliency metrics under the sampled disruption events.

Nazir, Mohammad Nawaf↗
DOE OSTI2024

Optimization of District Heating Network Parameters in Steady-State Operation

Here we examine the modeling, simulation, and optimization of district heating systems, which are widely used for thermal transport using steam or hot water as a carrier. We propose a generalizable framework to specify network models and scenario parameters, and develop an optimization method for evaluating system states including pressures, fluid flowrates, and temperatures throughout the network. The network modeling includes pipes, thermal plants, pumps, and passive or controllable loads as system components. We propose basic models for thermodynamic fluid transport and enforce the balance of physical quantities in steady-state flow over co-located outgoing and return networks. We formulate an optimization problem with steam and hot water as the outgoing and return carriers, as in legacy twentieth century systems. The physical laws and engineering limitations are specified for each component type, and the thermal network flow optimization problem is formulated and solved for a realistic test network under several scenarios.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

On the Training and Generalization of Deep Operator Networks

Here, we present a novel training method for deep operator networks (DeepONets), one of the most popular neural network models for operators. DeepONets are constructed by two subnetworks, namely the branch and trunk networks. Typically, the two subnetworks are trained simultaneously, which amounts to solving a complex optimization problem in a high dimensional space. In addition, the nonconvex and nonlinear nature makes training very challenging. To tackle such a challenge, we propose a two-step training method that trains the trunk network first and then sequentially trains the branch network. The core mechanism is motivated by the divide-and-conquer paradigm and is the decomposition of the entire complex training task into two subtasks with reduced complexity. Therein the Gram–Schmidt orthonormalization process is introduced which significantly improves stability and generalization ability. On the theoretical side, we establish a generalization error estimate in terms of the number of training data, the width of DeepONets, and the number of input and output sensors. Numerical examples are presented to demonstrate the effectiveness of the two-step training method, including Darcy flow in heterogeneous porous media.

deep operator networks↗