Search NASA⌕ Search

SEARCH · Search NASA

Results for “Implicit”

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 163 records · Page 9

Performance of the spin-component-scaled methods for energy bands

The performance of various spin-component-scaled parameterisations is examined for the second-order many-body Green's-function [MBGF(2)] calculations of valence energy bands, taking three of the experimentally well-characterised polymers as examples: polyethylene, polytetrafluoroethylene, and polyacetylene. The parameterisations considered are Grimme's original SCS parameter set, Jung et al.'s original SOS set (retaining the opposite-spin component only), Śmiga et al.'s SCS(IP) set (calibrated specifically for ionization energies), and Śmiga et al.'s SOS(IP) set (calibrated for ionization energies with the opposite-spin component only; implicit in the os-D2 model of Opoku et al.). The SCS(IP) and SOS(IP) parameterisations are found to shift both outer and inner valence bands by up to a few electronvolts away from the experimental data. The original SCS and SOS parameter sets do not improve upon, but largely maintain the accuracy of the unscaled MBGF(2) methods. Given that the SOS-MBGF(2) method can be implemented in a quartic-scaling algorithm (for all roots), it is most promising for solid-state applications. Furthermore this observation is consistent with the success of the quartic-scaling GW methods without the vertex correction based on a density-functional theory reference.

Green’s-function theory↗

A physics-constrained neural ordinary differential equations approach for robust learning of stiff chemical kinetics

The high computational cost associated with solving for detailed chemistry poses a significant challenge for predictive computational fluid dynamics (CFD) simulations of turbulent reacting flows. While deep learning techniques have been explored to develop faster surrogate models, they often fail to integrate reliably with CFD solvers. This instability arises because traditional deep learning approaches optimize for training error without ensuring compatibility with ordinary differential equation (ODE) solvers, resulting in accumulation of errors over time. Recently, neuralODE (NODE) based approaches have been shown to be a promising technique to emulate and accelerate detailed chemistry computations. Here, in the present work, we extend this NODE framework for stiff chemical kinetics by incorporating mass conservation constraints directly into the loss function during training. This ensures that the total mass as well as the individual elemental species masses are conserved in an a-posteriori manner. Proof-of-concept studies are performed with the novel physics-constrained NODE (PC-NODE) approach for homogeneous autoignition of hydrogen-air mixture over a range of composition and thermodynamic conditions. It is demonstrated that the PC-NODE framework not only improves the physical consistency of the resulting data-driven model with respect to mass conservation criteria, but also improves training efficiency. PC-NODE is shown to achieve 2–100× speedup relative to the hydrogen-air detailed chemical mechanism depending on the type of the ODE solver (implicit or explicit) used during autoregressive inference tests. Lastly, a-posteriori studies are performed wherein the trained PC-NODE model is coupled with a CFD solver. It is shown that higher accuracy is achieved with PC-NODE relative to the purely data-driven NODE approach. Moreover, PC-NODE also exhibits robustness and generalizability to unseen initial conditions from within (interpolative capability) as well as outside (extrapolative capability) the training regime.

computational combustion↗

16 O + 16 O fusion at sub-coulomb energies

A simple optical model (OPM) method using non-monotonic (NM) potentials characterized by a repulsive core from the microscopic theory of the Pauli-led energy-density functional (EDF) has been developed to investigate the 16 O + 16 O fusion at sub-Coulomb energies relevant to the oxygen burning. Here, the study involves the analysis of the experimental fusion cross-section (FCS) data in energy range 6.92 ≤ E cm ≤ 13.83 MeV, which includes the Coulomb barrier region E cm = 10.0–11.92 MeV. Apart from an excellent description of the existing FCS data in the studied energy range, the associated hindrance, characterized by the S-factor reaching a maximum and then gradually falling off at lower energies, so far suggested empirically for the system, is reproduced down to 4 MeV for the first time in the simple OPM. An S-factor maximum of S 0 = 3.15 × 10 25 MeV.b at E 0 = 7.14 MeV is observed with T ≃ 2.6 GK, which conforms to the values reported for quiescent and explosive burning. Our reaction rate, deduced from the NM potential, compares well with the Caughlan and Fowler data. Dominant partial waves implicit in the observed maximum S-factor in the studied Gamow range are also explored. Our present findings, with the success of NM potentials, suggest that the nucleus–nucleus potential is non-monotonic.

16O+16O↗

Static actuator-sharing algorithm for concurrent control of multiple plasma properties

Simultaneous regulation of multiple properties in next-generation tokamaks like ITER and fusion pilot plant may require the integration of different plasma control algorithms. Such integration requires the conversion of individual controller commands into physical actuator requests while accounting for the coupling between different plasma properties. This work proposes a tokamak and scenario-agnostic actuator-sharing algorithm (ASA) to perform the above-mentioned command-request conversion and, hence, integrate multiple plasma controllers. The proposed algorithm implicitly solves a quadratic programming (QP) problem formulated to account for the saturation limits and the relation between the controller commands and physical actuator requests. Since the constraints arising in the QP program are linear, the proposed ASA is highly computationally efficient and can be implemented in the tokamak plasma control system in real time. Furthermore, the proposed algorithm is designed to handle real-time changes in the control objectives and actuators’ availability. Nonlinear simulations carried out using the Control Oriented Transport SIMulator illustrate the effectiveness of the proposed algorithm in achieving multiple control objectives simultaneously.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Divertor heat load estimates on NSTX and DIII-D using new and open-source 2D inversion analysis code

A thermography inversion algorithm has been developed in the open-source Python-based computer code, HYPERION, to calculate the heat flux incident on plasma-facing components (PFCs) in axisymmetric tokamaks. The chosen mesh size at the surface significantly affects the calculated transient heat flux results. The calculated transient heat flux will exceed the real value when the mesh size tends to zero but will underestimate the real value when the mesh size is large. A criterion for determining the appropriate mesh size for the transient heat flux calculation will be discussed. The numerical scheme for HYPERION uses a 2D fully implicit finite-difference approach, allowing temperature-dependent thermal properties of PFC materials. The inversion algorithm is benchmarked against established heat flux calculation codes, TACO and THEODOR, based on thermography data from NSTX and DIII-D respectively. The primary benefits of HYPERION compared to TACO and THEODOR are that it is open-source and it allows for the optimization of mesh thickness along the substrate. The algorithm also accounts for the thermal properties of thin surface layers that characteristically form on PFCs due to plasma-material interactions. The agreement between HYPERION and THEODOR is excellent, as the percent difference between the codes is ~5% on average in the case of the DIII-D data for moderate to high heat flux. Verification tests with TACO show slightly higher average percent differences of 8% and 12%. In using HYPERION to study filaments in heat flux, the initial results indicate that small ELMs filaments significantly broaden the divertor heat flux, and decrease divertor peak flux. Compared to the inter-ELM, the small ELM filaments decrease the divertor peak surface temperature. With intermittent divertor filaments, the divertor heat flux width is comparable with that found in L-mode.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Simulation of Li-pellet triggered ELMs in EAST with an impurity model implemented under BOUT++ framework

A simple impurity model has been developed under the BOUT++ framework to investigate the Li-pellet triggered edge localized mode (ELM) in EAST configuration. The present impurity model decouples the ion pressure enhancement effect (IPEE) (which affects radial E X B flow shear and gyro-viscosity of deuterium ions and is implicitly included in our previous work) to make the simulation of Li pellet injection more physically reasonable. In addition, the present impurity model also includes the impurity equilibrium effect (IEE) (which induces modifications on vorticity and gyro-viscosity). The simulation results show that without IPEE a turbulent ELM induced by Li pellet is triggered by multiple peeling-ballooning modes (PBMs) rather than by a single dominant mode, and the simultaneous growth of multiple modes is conducive to reducing the time for pedestal entering the energy loss state. When a turbulent ELM occurs, the nonlinearly dominant modes undergo a secondary fast growth during fast crash phase. The finding explains the secondary increase of D α emission observed in the DIII-D Li injection experiments. During the evolution of a turbulent ELM, the continuous pedestal collapse dominates the pedestal energy loss in turbulent transport phase; however, in saturation phase, the stabilizing effects on PBMs (n ≠ 0) by n = 0 mode and radial E X B flow shear within the steepest gradient region are more prominent. It is also found that with IEE and without IPEE, the size threshold of ELM triggering and the magnitude of ELM sizes both show a good agreement with EAST and DIII-D experimental observations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Neural posterior unfolding

Differential cross section measurements are the currency of scientific exchange in particle and nuclear physics. A key challenge for these analyses is the correction for detector distortions, known as deconvolution or unfolding. Binned unfolding of cross section measurements traditionally rely on the regularized inversion of the response matrix that represents the detector response, mapping pre-detector (`particle level') observables to post-detector (`detector level') observables. In this paper we introduce Neural Posterior Unfolding, a modern, Bayesian approach that leverages normalizing flows for unfolding. By using normalizing flows for neural posterior estimation, NPU offers several key advantages including implicit regularization through the neural network architecture, fast amortized inference that eliminates the need for repeated retraining, and direct access to the full uncertainty in the unfolded result. In addition to introducing NPU, we implement a classical Bayesian unfolding method called Fully Bayesian Unfolding (FBU) in modern Python so it can also be studied. These tools are validated on simple Gaussian examples and then tested on simulated jet substructure examples from the Large Hadron Collider (LHC). We find that the Bayesian methods are effective and worth additional development to be analysis ready for cross section measurements at the LHC and beyond.

Analysis and statistical methods↗

Circumventing data imbalance in magnetic ground state data for magnetic moment predictions

Abstract Magnetic materials play a crucial role in the transition to more sustainable forms of energy and electric vehicles. There is an anticipated shortage in magnetic materials in the future, and as a result there is an urgent need to discover and design new magnetic materials. Computational magnetic material design using density functional theory is daunting because of the challenge in identifying magnetic ground states from a combinatorially large set of possibilities. Machine learning offers a path forward by enabling efficient surrogate models that can more readily enumerate these states, but there is a dearth of training data available, and what is available tends to be imbalanced with too much non-magnetic data. In this work we show that the discrete and previously tackled data imbalance that exists at the level of the magnetic ordering leads to an imbalanced continuous distribution with many zeros when the data is unraveled at the atomic magnetic moment level, which subsequently leads to models with low accuracy for magnetic properties. We mitigate this by using a two-part model framework. Our scheme is able to classify atoms into magnetic and non-magnetic with an F1 score and Matthew’s correlation coefficient (MCC) of ~91% and then to provide an implicit embedding representation that maps directly onto the magnitude of the magnetic moment with a mean absolute error of 0.1 μ B . Beyond screening for new magnetic materials, we demonstrate an additional practical use case of our scheme: the provision of good initial guesses for magnetic moments in first-principles electronic relaxations. Such initialization is shown to lead to faster convergence to configurations that lie closer to the ground state.

Computer Science↗

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↗

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗

MINE: maximally informative next experiment—toward a new GWAS experimental design and methodology

Abstract The computational methodology of Genome Wide Association Studies (GWAS) currently has several limitations: (i) the number of observations (rows) on a quantitative trait tends to be smaller than the number of single nucleotide polymorphisms (SNPs) (columns) in the design matrix; (ii) each SNP is usually modeled separately, failing to acknowledge interaction between each other (ie epistasis); (iii) there is implicit linkage disequilibrium (LD) between neighboring SNPs due to their linkage. To overcome these issues, we developed a tool that uses ensemble methods to fit mixed linear models to GWAS data, and these ensemble methods include the development of a new experimental design approach in GWAS, which uses the resultant models and data to select the next informative experiment over time. This new adaptive and staged approach for GWAS experimental design was developed and tested in a 3 yr adaptive model-guided discovery experiment against a fixed classical design. In Sorghum bicolor a total of 79, 86, and 78 accessions were tested in years 1, 2, and 3, respectively out of 343 accessions available in the Bioenergy Association Panel (BAP) each identified for 232,303 SNPs, 1 every 2–3 kb in the genomes. We demonstrated the feasibility of MINE enacted with 8 people in the field per year over 3 yr vs in 1 large classical design enacted with 20 people in 1 yr. The MINE results for chromosomal regions identified controlling dry weight were confirmed against results from previous sorghum GWAS experiments and 1 large classical design for the BAP panel.

Genetics & Heredity↗

LinkML: an open data modeling framework

Background Scientific research relies on well-structured, standardized data; however, much of it is stored in formats such as free-text lab notebooks, nonstandardized spreadsheets, or data repositories. This lack of structure challenges interoperability, making data integration, validation, and reuse difficult. Findings LinkML (Linked Data Modeling Language) is an open framework that simplifies the process of authoring, validating, and sharing data. LinkML can describe a range of data structures, from flat, list-based models to complex, interrelated, and normalized models that utilize polymorphism and compound inheritance. It offers an approachable syntax that is not tied to any one technical architecture and can be integrated seamlessly with many existing frameworks. The LinkML syntax provides a standard way to describe schemas, classes, and relationships, allowing modelers to build well-defined, stable, and optionally ontology-aligned data structures. Once defined, LinkML schemas may be imported into other LinkML schemas. These key features make LinkML an accessible platform for interdisciplinary collaboration and a reliable way to define and share data semantics. Conclusions LinkML helps reduce heterogeneity, complexity, and the proliferation of single-use data models while simultaneously enabling compliance with FAIR (Findable, Accessible, Interoperable, and Reusable) data standards. LinkML has seen increasing adoption in various fields, including biology, chemistry, biomedicine, microbiome research, finance, electrical engineering, transportation, and commercial software development. In short, LinkML makes implicit models explicitly computable and allows data to be standardized at their origin. LinkML documentation and code are available at https://linkml.io/.

AI-ready data↗

Dark energy survey year 3 results: likelihood-free, simulation-based w CDM inference with neural compression of weak-lensing map statistics

We present simulation-based cosmological wcold dark matter (wCDM) inference using dark energy survey year 3 weak-lensing maps, via neural data compression of weak-lensing map summary statistics: power spectra, peak counts, and direct map-level compression/inference with convolutional neural networks (CNN). Using simulation-based inference, also known as likelihood-free or implicit inference, we use forward-modelled mock data to estimate posterior probability distributions of unknown parameters. This approach allows all statistical assumptions and uncertainties to be propagated through the forward-modelled mock data; these include sky masks, non-Gaussian shape noise, shape measurement bias, source galaxy clustering, photometric redshift uncertainty, intrinsic galaxy alignments, non-Gaussian density fields, neutrinos, and non-linear summary statistics. We include a series of tests to validate our inference results. This paper also describes the Gower Street simulation suite: 791 full-sky pkdgrav3 dark matter simulations, with cosmological model parameters sampled with a mixed active-learning strategy, from which we construct over 3000 mock dark energy survey lensing data sets. For wCDM inference, for which we allow –1 < w < –$\frac{1}{3}$⁠, our most constraining result uses power spectra combined with map-level (CNN) inference. Using gravitational lensing data only, this map-level combination gives Ω m = 0.283$^{+0.020}_{–0.027}$⁠, S 8 = 0.804$^{+0.025}_{–0.017⁠}$, and w < –0.80 (with a 68 per cent credible interval); compared to the power spectrum inference, this is more than a factor of two improvement in dark energy parameter (Ω⁠ DE , w⁠) precision.

79 ASTRONOMY AND ASTROPHYSICS↗

Dark Energy Survey Year 3 results: Simulation-based 𝑤CDM inference from weak lensing and galaxy clustering maps with deep learning: Analysis design

Data-driven approaches using deep learning are emerging as powerful techniques to extract non-Gaussian information from cosmological large-scale structure. Here, this work presents the first simulation-based inference (SBI) pipeline that combines weak lensing and galaxy clustering maps in a realistic Dark Energy Survey Year 3 (DES Y3) configuration and serves as preparation for a forthcoming analysis of the survey data. We develop a scalable forward model based on the CosmoGridV1 suite of N-body simulations to generate over one million self-consistent mock realizations of DES Y3 at the map level. Leveraging this large dataset, we train deep graph convolutional neural networks on the full survey footprint in spherical geometry to learn low-dimensional features that approximately maximize mutual information with target parameters. These learned compressions enable neural density estimation of the implicit likelihood via normalizing flows in a ten-dimensional parameter space spanning cosmological 𝑤CDM, intrinsic alignment, and linear galaxy bias parameters, while marginalizing over baryonic, photometric redshift, and shear bias nuisances. To ensure robustness, we extensively validate our inference pipeline using synthetic observations derived from both systematic contaminations in our forward model and independent Buzzard galaxy catalogs. Our forecasts yield significant improvements in cosmological parameter constraints, achieving 2−3× higher figures of merit in the 𝛺 𝑚 − 𝑆 8 plane relative to our implementation of baseline two-point statistics and effectively breaking parameter degeneracies through probe combination. These results demonstrate the potential of SBI analyses powered by deep learning for upcoming Stage-IV wide-field imaging surveys.

Thomsen, A. [Zurich, ETH] (ORCID:0000000203099021)↗

Learning nuclear cross sections across the chart of nuclides with graph neural networks

We explore the use of deep learning techniques to learn how nuclear cross sections change as we add or remove protons and neutrons. As a proof of principle, we focus on the neutron-induced reactions in the fast energy regime. Our approach follows a two-stage learning framework. First, we apply representation learning to encode cross section data into a latent space using either variational autoencoders (VAEs) or implicit neural representations (INRs). Then, we train graph neural networks (GNNs) on the resulting embeddings to predict missing values across the nuclear chart by leveraging the topological structure of neighboring isotopes. We demonstrate accurate cross section predictions within a 9 × 9 block of missing nuclei. We also find that the optimal GNN training strategy depends on the type of latent representation used, with VAE embeddings performing best under end-to-end optimization in the original space, while INR embeddings achieve better results when the GNN is trained only in the latent space. Furthermore, using clustering algorithms, we map groups of latent vectors into regions of the nuclear chart and show that VAEs and INRs can discover some of the neutron magic numbers. These findings suggest that deep-learning models based on the representation encoding of cross sections combined with graph neural networks hold significant potential in augmenting nuclear theory models, e.g., by providing reliable estimates of covariances of cross sections, including cross-material covariances.

Machine learning↗

Photon calibration techniques for high resolution cryogenic detectors

Monoenergetic photons from a pulsed laser diode or LED are commonly used to calibrate the detector response of high-resolution calorimetric detectors. However, when the detector’s resolution is larger than the energy of a single photon, a calibration is normally derived using Poisson statistics. In this paper, we clarify the assumptions implicit in this calibration method, before considering how a more realistic model of a detector’s performance will violate these assumptions, biasing the calibration. Lastly, we judge the individual impact of specific detector parameters on our calibration, and conclude with discussion of both the limits of our calculations and the implications for state-of-the art detectors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Generalized Wigner theorem for noninvertible symmetries

In this article, we establish the conditions under which a conservation law associated with a non-invertible operator may be realized as a symmetry in quantum physics. As established by Wigner, all quantum symmetries must be represented by either unitary or antiunitary transformations. Relinquishing an implicit assumption of invertibility, we demonstrate that the fundamental invariance of quantum transition probabilities under the application of symmetries mandates that all non-invertible symmetries may only correspond to projective unitary or antiunitary transformations, i.e., partial isometries. This extends the notion of physical states beyond conventional rays in Hilbert space to equivalence classes in an extended, gauged Hilbert space, thereby broadening the traditional understanding of symmetry transformations in quantum theory. Our generalized theorem applies irrespective of the origin of the (non)invertible symmetry, holds in arbitrary spatial dimensions, and is independent of the Hamiltonian or action. We explore its physical consequences and, using simple model systems, illustrate how the distinction between invertible and non-invertible symmetries can sometimes be tied to the choice of boundary conditions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Langevin and Fokker-Planck analyses for diffusion-mediated passing of circular and discorectangular species in two-dimensional channels

The propensity for pairs of diffusing species to pass each other within narrow channels or pores is of basic interest as a first-passage-type problem. It is also of relevance for solution-phase transport in nanoporous materials, and in particular for catalytic conversion reactions where high yield requires that product species can efficiently pass reactant species to exit the pores. Here, we analyze a two-dimensional model with nonoverlapping circular and discorectangular species confined to a rectangular channel, and where passing is mediated by Brownian dynamics in an implicit solvent. For narrower channels where passing is still possible, the discorectangle must align with the channel to pass the circular species. Behavior of the passing propensity, 𝑃, can be assessed by strongly damped Langevin simulations, or within an equivalent Fokker-Planck equation (FPE) formalism. The latter corresponds to a diffusion problem in a “higher-dimensional channel” with a constriction. We assess the variation of the passing propensity, 𝑃, for a broad range of channel width including its scaling just above the threshold where passing is sterically blocked. Analysis of 𝑃 versus the rotational diffusion coefficient 𝐷 𝑟 of the discorectangle reveals a significant decrease in 𝑃 for lower 𝐷 𝑟 for moderate channel width. This prompts a direct analysis of the regime where 𝐷 𝑟 → 0 , for which the FPE can be reduced to a three-dimensional diffusion problem, precise analysis of which is facilitated by adaptive-mesh finite element methods. The dependence of 𝑃 on the aspect ratio of the discorectangle is also assessed.

Rahman, Md Khaledur [Ames Laboratory (AMES), Ames,↗