Search NASA⌕ Search

SEARCH · Search NASA

Results for “DISCRETE FUNCTION”

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

A high-order computational framework for particle-resolved simulations of disperse multiphase flows

This work presents a high-order numerical approach for particle-resolved simulations of disperse multiphase flows, where the Navier-Stokes equations for fluid flow are solved using a high-order spectral element method in the Eulerian framework, and the particle phase is directly simulated with a discrete element method. The coupling between particles and fluids is explicitly handled using an adapted direct-forcing immersed boundary method. Unlike the conventional schemes, a high-order barycentric Lagrange interpolation method and a Gaussian projection kernel are used to ensure accurate momentum exchange between local boundary points and surrounding fluid nodes in the framework of high-order fluid solver. Benchmark tests of increasing complexity are conducted to demonstrate the accuracy and efficiency of our method. Here, it is found that our approach exhibits an excellent convergence performance, as the fluid element/grid is refined and the number of boundary points increases. Compared to conventional low-order methods, the proposed high-order framework enables the use of substantially larger fluid elements while maintaining high accuracy in modeling fluid-particle interactions, owing to the enhanced resolution of high-order basis functions. Moreover, since the primary unknowns are stored at element or grid nodes, the high-order approach offers improved efficiency in both CPU memory usage and total computational cost.

42 ENGINEERING↗

Siegert-pseudostate formulation with B-splines

Siegert states (SSs) serve as a useful basis for studying quantum scattering from finite-range potentials. Since they form a discrete instead of continuous set of eigen-solutions, SSs are convenient for performing electronic structure calculations in atoms, molecules, and plasmas. Numerical instabilities may arise, however, in the computation of SSs if the potential vanishes for some extended region, a situation commonly occurring in plasma calculations. Here, in this paper, we identify the cause of these instabilities as the use of non-localized radial basis functions. We thus advocate the use of localized radial basis functions, in particular B-splines, for more robust computations of SSs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Autonomous Operations for Advanced Reactors Utilizing Supervisory Control

Automation is a critical tenet of reactor plant operations as reliance on nuclear energy increases. Nuclear power plants require a large workforce which does not scale with output; that is, the cost per megawatt increases as reactor output becomes smaller. The economic viability of advanced reactors, particularly small modular reactors (SMRs) and microreactors, requires a significantly reduced onsite workforce. The logical solution is establishing a systematic process of elimination of reliance on human operators, and to the extent possible, replacing these actions with automated functions. In this paper, we propose a method for such transformation to establish a robust technical basis to enable transition to autonomy. Our method is based on finite state automata (FSA)—also known as finite state machines (FSMs). Relying on this method allows us to exploit the rich set of mathematical proofs available in the field of regular languages. FSA are one of the mathematical tools to model discrete event systems (DES). These properties are applied to produce an automated startup controller for the Massachusetts Institute of Technology Research Reactor (MITR). The startup procedure is captured in terms of discrete changes from one state to another while an independent supervisory control system directs the sequence of states and alerts a human in the event of an abnormal operation. First, the design and behavior of the MITR rod control system were modeled in Simulink. Then, the startup procedure was applied to the rod control system and the DES performed a startup by procedurally withdrawing rods to the subcritical position. The simulation also stops rod motion in response to an uncontrollable event and restarts rod motion once the event has been cleared.

46 - INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AN↗

Accurate numerical simulations of open quantum systems using spectral tensor trains

Decoherence between qubits is a major bottleneck in quantum computations. Decoherence results from intrinsic quantum and thermal fluctuations as well as noise in the external fields that perform the measurement and preparation processes. With prescribed colored noise spectra for intrinsic and extrinsic noise, we present a numerical method, Quantum Accelerated Stochastic Propagator Evaluation (Q-ASPEN), to solve the time-dependent noise-averaged reduced density matrix in the presence of intrinsic and extrinsic noise. Q-ASPEN is arbitrarily accurate and can be applied to provide estimates for the resources needed to error-correct quantum computations. We employ spectral tensor trains, which combine the advantages of tensor networks and pseudospectral methods, as a variational ansatz to the quantum relaxation problem and optimize the ansatz using methods typically used to train neural networks. Here, the spectral tensor trains in Q-ASPEN make accurate calculations with tens of quantum levels feasible. We present benchmarks for Q-ASPEN on the spin-boson model in the presence of intrinsic noise and on a quantum chain of up to 32 sites in the presence of extrinsic noise. In our benchmark, the memory cost of Q-ASPEN scales as a low-order polynomial in the size of the system once the number of system states surpasses the number of basis functions used in the spectral expansion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Thiol post-translational modifications modulate allosteric regulation of the OpcA–G6PDH complex through conformational gate control

In cyanobacteria, the redox-sensitive protein OpcA acts as a metabolic switch for G6PDH, enabling rapid adjustment of reducing power generation from glycogen catabolism and thereby precisely regulating carbon flux between anabolic and catabolic pathways. Although redox-sensitive cysteines in OpcA are known to regulate G6PDH, the mechanisms by which redox post-translational modifications (PTMs) on OpcA control G6PDH structure and activity remain unclear. Here, we combine computational modeling with experimental redox proteomics in Synechococcus elongatus PCC 7942 to dissect this mechanism. Experimentally, redox proteome analysis revealed differential redox PTM patterns, particularly on cysteines within the G6PDH-binding site of OpcA. These environmentally sensitive PTM changes at the interface suggest that thiol modifications in this region form a key regulatory node. More broadly, redox proteomics identified site-specific cysteine modifications under light/dark transitions and circadian cycling, linking distinct redox regimes to discrete PTM states. We employed PTM-Psi simulations to show that thiol PTMs near the OpcA–G6PDH interface are critical for allosteric regulation of G6PDH. The thiol PTMs on OpcA affect a putative gate region in G6PDH for substrate ingress and product egress as well as key hydrogen-bond networks within the active site. We infer that PTMs on OpcA tune the conformational landscapes of individual G6PDH subunits toward functionally relevant configurations according to environmental gradients, biasing the enzyme toward catalytically favorable states. Together, our results reveal a molecular mechanism in which thiol PTMs on OpcA modulate G6PDH structure and function through PTM-induced reorganization of conformational dynamics and allosteric communication. These findings demonstrate that PTM-level regulation provides a critical control layer from genotypes to phenotypes that enables cyanobacteria to rapidly adapt to environmental fluctuations through precise metabolic fine-tuning.

Allosteric regulation↗

Operator dynamics in Floquet many-body systems

We study operator dynamics in many-body quantum systems, focusing on generic features of systems that are ergodic, spatially extended, and lack conserved densities. Quantum circuits of various types provide simple models for such systems. We focus on Floquet quantum circuits, comparing their behavior with what has been found previously for circuits that are random in time. Floquet circuits, which have discrete time-translation symmetry, represent an intermediate case between circuits that are random in time and lack any symmetry, and systems with a time-independent Hamiltonian and continuous time-translation invariance. By making this comparison, one of our aims is to identify signatures of time-translation symmetry in Floquet operator dynamics. To characterize behavior we examine a variety of quantities in solvable models and numerically: operator autocorrelation functions; the partial spectral form factor; the out-of-time-order correlator (OTOC); and the paths in operator space that make the dominant contributions to the ensemble-averaged autocorrelation functions. Our most striking result is that ensemble-averaged autocorrelation functions show behavior that is distinctively different in Floquet systems compared to systems in which successive time-steps are independent. Specifically, while average autocorrelation functions decay on a microscopic timescale for circuits that are random in time, in Floquet systems they have a late-time tail with a duration that grows parametrically with the size of the operator support. In the simplest models this tail is separated from the initial decay by a minimum, so that the average autocorrelation function has an intermediate-time peak. The existence of these tails provides a way to understand deviations of the spectral form factor from random matrix behavior at times shorter than the Thouless time. In contrast to this feature in autocorrelation functions, we find no new aspects to the behavior of OTOCs for Floquet models compared to random-in-time circuits. We show that this difference between averaged autocorrelation functions and OTOCs can be understood in terms of the paths in operator space that contribute to the two quantities: paths for the former retain a limited support at late times, while paths for the latter are dominated by operator spreading. Published by the American Physical Society 2025

Yoshimura, Takato (ORCID:0000000309159846)↗

High‐Pressure Synthesis of Ultra‐Incompressible, Hard and Superconducting Tungsten Nitrides

Abstract Transition metal nitrides, particularly those of 5 d metals, are known for their outstanding properties, often relevant for industrial applications. Among these metal elements, tungsten is especially attractive given its low cost. In this high‐pressure investigation of the W–N system, two novel ultra‐incompressible tungsten nitride superconductors, namely W 2 N 3 and W 3 N 5 , are successfully synthesized at 35 and 56 GPa, respectively, through a direct reaction between N 2 and W in laser‐heated diamond anvil cells. Their crystal structure is determined using synchrotron single‐crystal X‐ray diffraction. While the W 2 N 3 solid's sole constituting nitrogen species are N 3‐ units, W 3 N 5 features both discrete N 3‐ as well as N 2 4‐ pernitride anions. The bulk modulus of W 2 N 3 and W 3 N 5 is experimentally determined to be 380(3) and 406(7) GPa, and their ultra‐incompressible behavior is rationalized by their constituting WN 7 polyhedra and their linkages. Importantly, both W 2 N 3 and W 3 N 5 are recoverable to ambient conditions and stable in air. Density functional theory calculations reveal W 2 N 3 and W 3 N 5 to have a Vickers hardness of 30 and 34 GPa, and superconducting transition temperatures at ambient pressure (50 GPa) of 11.6 K (9.8 K) and 9.4 K (7.2 K), respectively. Additionally, transport measurements performed at 50 GPa on W 2 N 3 corroborate with the calculations.

Chemistry↗

Solid state 59 Co NMR study of a Np(VII) compound

Np(VII) compounds with [Co(NH 3 ) 6 ] 3+ cations were synthesized and structurally examined using powder X-ray diffraction. Multiple phases were observed, consisting of octahedral [Co(NH 3 ) 6 ] 3+ cations, discrete tetragonal bipyramidal [NpO 4 (OH) 2 ] 3− anions, and waters of hydration. Electric field gradient tensors at Co sites were measured by solid state 59 Co nuclear magnetic resonance (NMR) spectroscopy and compared with theoretical calculations. The relative contributions of the chemical shift and electric field tensors to the NMR lineshape were determined by recording spectra at field strengths of 7.04 and 11.74 Tesla. Further, the evolution of structure and morphology as a function of sample age and the effects on NMR spectral parameters has also been investigated. These results demonstrate the use of NMR at multiple fields to expand understanding of the stability and electronic structure of high valent neptunium compounds.

heptavalent neptunium↗

Adaptive Sampling-Based Bi-Fidelity Stochastic Trust Region Method for Stochastic Derivative-Free Optimization

Bi-fidelity stochastic optimization has gained increasing attention as an efficient approach to reduce computational costs by leveraging a low-fidelity (LF) model to optimize an expensive high-fidelity (HF) objective. In this paper, we propose ASTRO-BFDF, an adaptive sampling trust-region method specifically designed for unconstrained bi-fidelity stochastic derivative-free optimization problems. In ASTRO-BFDF, the LF function serves two purposes: (i) to identify better iterates for the HF function when the optimization process indicates a high correlation between them and (ii) to reduce the variance of the HF function estimates using bi-fidelity Monte Carlo (BFMC). The algorithm dynamically determines sample sizes while adaptively choosing between crude Monte Carlo and BFMC to balance the trade-off between optimization and sampling errors. We prove that the iterates generated by ASTRO-BFDF converge to a first-order stationary point almost surely. Additionally, we demonstrate the effectiveness of the proposed algorithm through numerical experiments on synthetic benchmarks and simulation optimization problems involving discrete event systems.

97 MATHEMATICS AND COMPUTING↗

Separable physics-informed DeepONet: Breaking the curse of dimensionality in physics-informed machine learning

The deep operator network (DeepONet) has shown remarkable potential in solving partial differential equations (PDEs) by mapping between infinite-dimensional function spaces using labeled datasets. However, in scenarios lacking labeled data, the physics-informed DeepONet (PI-DeepONet) approach, which utilizes the residual loss of the governing PDE to optimize the network parameters, faces significant computational challenges, particularly due to the curse of dimensionality. This limitation has hindered its application to high-dimensional problems, making even standard 3D spatial with 1D temporal problems computationally prohibitive. Additionally, the computational requirement increases exponentially with the discretization density of the domain. Here, to address these challenges and enhance scalability for high-dimensional PDEs, we introduce the Separable physics-informed DeepONet (Sep-PI-DeepONet). This framework employs a factorization technique, utilizing sub-networks for individual one-dimensional coordinates, thereby reducing the number of forward passes and the size of the Jacobian matrix required for gradient computations. By incorporating forward-mode automatic differentiation (AD), we further optimize computational efficiency, achieving linear scaling of computational cost with discretization density and dimensionality, making our approach highly suitable for high-dimensional PDEs. We demonstrate the effectiveness of Sep-PI-DeepONet through three benchmark PDE models: the viscous Burgers’ equation, Biot’s consolidation theory, and a parameterized heat equation. Our framework maintains accuracy comparable to the conventional PI-DeepONet while reducing training time by two orders of magnitude. Notably, for the heat equation solved as a 4D problem, the conventional PI-DeepONet was computationally infeasible (estimated 289.35 h), while the Sep-PI-DeepONet completed training in just 2.5 h. These results underscore the potential of Sep-PI-DeepONet in efficiently solving complex, high-dimensional PDEs, marking a significant advancement in physics-informed machine learning.

Neural operator↗

Gaussian FLOWERS: Wind-rose-based analytical integration of Gaussian wake model for extremely fast AEP estimation

A major cost in the study of wind farm layout optimization is the repeated evaluation of the annual energy production (AEP). The current approach to estimating AEP requires a large set of flow simulations to be performed that cover each discrete wind speed and direction combination contained within the wind rose, followed by a probability-weighted sum of the power production resulting from each simulation. Even with inexpensive engineering wake models, this numerical integration scheme can lead to high computational costs. In this paper, we derive an analytical formulation for estimating farm AEP across every wind direction, based on a Gaussian wake velocity model, which reduces the number of wind farm simulations to a single function evaluation. As a result, we find that the Gaussian-FLOWERS approach reduces the time for AEP calculations by more than two orders of magnitude with a small trade-off in accuracy when compared to a conventional approach. This massive reduction in computation cost is useful to reduce overall costs in wind farm layout optimization studies.

17 WIND ENERGY↗

Entanglement Renormalization for Quantum Field Theories with Discrete Wavelet Transforms

We propose an adaptation of Entanglement Renormalization for quantum field theories that, through the use of discrete wavelet transforms, strongly parallels the tensor network architecture of the Multiscale Entanglement Renormalization Ansatz (a.k.a. MERA). Our approach, called wMERA, has several advantages of over previous attempts to adapt MERA to continuum systems. In particular, (i) wMERA is formulated directly in position space, hence preserving the quasi-locality and sparsity of entanglers; and (ii) it enables a built-in RG flow in the implementation of real-time evolution and in computations of correlation functions, which is key for efficient numerical implementations. As examples, we describe in detail two concrete implementations of our wMERA algorithm for free scalar and fermionic theories in (1+1) spacetime dimensions. Possible avenues for constructing wMERAs for interacting field theories are also discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Integrating particle flavor into deep learning models for hadronization

Hadronization models used in event generators are physics-inspired functions with many tunable parameters. Since we do not understand hadronization from first principles, there have been multiple proposals to improve the accuracy of hadronization models by utilizing more flexible parametrizations based on neural networks. These recent proposals have focused on the kinematic properties of hadrons, but a full model must also include particle flavor. In this paper, we show how to build a deep learning-based hadronization model that includes both kinematic (continuous) and flavor (discrete) degrees of freedom. Our approach is based on generative adversarial networks and we show the performance within the context of the cluster hadronization model within the erwig event generator.

Chan, Jay↗

Information divergences to parametrize astrophysical uncertainties in dark matter direct detection

Astrophysical uncertainties in dark matter direct detection experiments are typically addressed by parametrizing the velocity distribution in terms of a few uncertain parameters that vary around some central values. Here we propose a method to optimize over all velocity distributions lying within a given distance measure from a central distribution. We discretize the dark matter velocity distribution as a superposition of streams and use a variety of information divergences to parametrize its uncertainties. With this, we bracket the limits on the dark matter–nucleon and dark matter–electron scattering cross sections, when the true dark matter velocity distribution deviates from the commonly assumed Maxwell-Boltzmann form. The methodology pursued is general and could be applied to other physics scenarios where a given physical observable depends on a function that is uncertain.

particle astrophysics↗

Robust 3D multi-material hydrodynamics using discontinuous Galerkin methods

A high-order discontinuous Galerkin (DG) method is presented for nonequilibrium multi-material (m ≥ 2) flow with sharp interfaces. Material interfaces are reconstructed using the algebraic THINC approach, resulting in a sharp interface resolution. The system assumes stiff velocity relaxation and pressure nonequilibrium. The presented DG method uses Dubiner's orthogonal basis functions on tetrahedral elements. This results in a unique combination of sharp multimaterial interfaces and high-order accurate solutions in smooth single-material regions. A novel shock indicator based on the interface conservation condition is introduced to mark regions with discontinuities. Slope limiting techniques are applied only in these regions so that nonphysical oscillations are eliminated while maintaining high-order accuracy in smooth regions. A local projection is applied on the limited solution to ensure discrete closure law preservation. The effectiveness of this novel limiting strategy is demonstrated for complex three-dimensional multi-material problems, where robustness of the method is critical. The presented numerical problems demonstrate that more accurate and efficient multi-material solutions can be obtained by the DG method, as compared to second-order finite volume methods.

97 MATHEMATICS AND COMPUTING↗

A projection method for particle resampling

Particle discretizations of partial differential equations are advantageous for high-dimensional kinetic models in phase-space due to their better scalability than continuum approaches with respect to dimension. Complex processes collectively referred to as particle noise hamper long time simulations with particle methods. One approach to address this problem is particle mesh adaptivity, or remapping, known as particle resampling and remeshing. Here, this work introduces a resampling method that projects particles to and from a (finite element) function space. The method is simple, using standard sparse linear algebra and finite element techniques, and it preserves all moments up to the order of a polynomial represented exactly by the continuum function space. It is distinguished from most other mesh-based methods in that new particle positions and number are decoupled from the mesh, allowing particle and continuum meshes to be adapted relatively independently. While this work is developed with structured particle and continuum phase-space grids on 1X + 1V Vlasov-Poisson models of Landau damping and two-stream instability, the method is well-suited to unstructured grids. Stable long time dynamics are demonstrated up to time T = 500. Reproducibility artifacts and data are publicly available.

Kinetic methods↗

Generation of random geological models using multi-randomization for machine learning

Generating high-fidelity geological models is essential for advancing machine learning (ML) methods in automated seismic interpretation. For instance, seismic images paired with corresponding fault labels are foundational for ML-based fault detection from seismic migration sections. While several open-access datasets of random geological models exist, open-source tools specifically designed to produce large volumes of such models for ML applications remain scarce. To address this gap, we present RGM (Random Geological Model), an open-source software package for efficiently generating 2D and 3D synthetic geological models tailored for ML workflows. RGM supports the creation of diverse model components, including medium property distributions (P-/S-wave velocities and density), seismic reflectivity images (i.e., synthetic migration sections), relative geological time, and discrete fault attributes such as probability, dip, strike, rake, and displacement. It also accommodates the creation of complex geological features such as salt bodies and unconformities. The model generation algorithm employs a multi-randomization strategy, yielding an effectively infinite-dimensional model space that encompasses a wide range of geological scenarios and associated seismic features. Furthermore, RGM incorporates a method to generate synthetic elastic migration images using analytical elastic reflection coefficients combined with frequency-dependent scaling. This functionality enables the creation of training datasets for ML models that leverage elastic seismic images. RGM is implemented in modern object-oriented Fortran, allowing users to flexibly control statistical parameters governing model variability. We demonstrate the capability, performance, and geological realism of the package through comprehensive 2D and 3D examples.

58 GEOSCIENCES↗