Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network convergence”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Large-eddy simulation of non-vaporizing sprays using the spectral-element method

Predictive simulations of high-pressure sprays require accurate representation of the turbulent gaseous flow field generated by liquid jet. Typically, the accuracy that can be obtained with low-order numerical methods (e.g. finite volume, finite element) is limited by stability issues in fine grids and the order of convergence of the method. In this work, we resolve the turbulent flow field in an Eulerian manner using the high-order spectral element method, coupled with a Lagrangian parcels approach to model the atomizing liquid jet. Large eddy simulations of single-hole sprays under non-evaporative conditions were conducted and compared against experimental data from Margot et al. (2008) and Spray A data from the Engine Combustion Network. The sensitivity of liquid penetration and droplet sizes to different breakup model parameters was studied. The effect of different numerical parameters, such as polynomial order of the solution (grid resolution), on liquid penetration was also analyzed. The method achieved grid-independent results using p-refinement, achieving finer resolution (by a factor of x 1.7 - x 3.5) in the gas-phase solution than in state-of-the-art simulations using the finite-volume method. Here the results showed good agreement with experimental data, demonstrating the ability of the current method to accurately capture liquid penetration and the shape of the spray.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Designing the Protocols for Programmable Ammonia Catalysis

Programmable catalysis can provide a more energy-efficient and cost-effective route to enhancing commercial ammonia production, a key process in the advancement of renewable energy technologies and the manufacture of fertilizers and basic chemicals. This work explores the computational discovery of optimal forcing protocols to drive such dynamic catalysis models. By employing matrix-free time-stepper methods, coupled with an optimization approach, that integrates Bayesian optimization with a Bayesian continuation strategy to efficiently discover the periodic steady states of such periodically forced systems, we enable the discovery of complex optimal catalyst strain waveforms, while ensuring robust solver convergence. We demonstrate the flexibility of our approach to discover optimized forcing protocols under varying physical constraints on strain modulation or other catalyst operating parameters. We show that these can have a temporal structure more complex than simple step functions. In order to detect undesirable catalytic loops that may correlate with overall reduced performance, we perform a study using graph-theoretical analysis to investigate the dynamics of catalytic kinetic networks formed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Computationally efficient Bayesian estimation of graphical networks for omics data

Graphical networks are useful, widely-used modeling approaches to represent complex biological processes with biological measurements generated by platforms such as mass spectrometry. Bayesian analyses of graphical networks for omics data have several advantages over their frequentist counterparts, such as the inclusion of prior knowledge in the estimation of models. However, Bayesian approaches to date have only been feasible for data with a couple hundred biomolecules due to prohibitive computational time, but omics data often contains tens of thousands of biomolecules. Here, we present and illustrate a more computationally efficient approach named BPlane (Bayesian PseudoLikelihood-based Algorithm for Network Estimation) to extend Bayesian modeling capabilities for larger-sized datasets, such as most untargeted proteomics data. Via simulation, we demonstrate that BPlane produces substantial computational savings over a current state-of-the-art Bayesian algorithm while maintaining competitive edge detection accuracy. On a SARS-CoV2 proteomics data with 7000 proteins, the competing algorithm takes three times as long to complete the first iteration as BPlane takes to converge after over 100 iterations.

EM algorithm↗
DOE OSTI2021

A Novel Data-based Stochastic Distribution Control for Non-Gaussian Stochastic Systems

In this note, we present a novel data-based approach to investigate the non-Gaussian stochastic distribution control problem. As the motivation of this note, the existing methods have been summarised regarding to the drawbacks, for example, neural network weights training for unknown stochastic distribution and so on. To overcome these disadvantages, a new transformation for dynamic probability density function is given by kernel density estimation using interpolation. Based upon this transformation, a representative model has been developed while the stochastic distribution control problem has been transformed into an optimisation problem. Then, data-based direct optimisation and identification-based indirect optimisation have been proposed. In addition, the convergences of the presented algorithms are analysed and the effectiveness of these algorithms has been evaluated by numerical examples. In summary, the contributions of this note are as follows: 1) a new data-based probability density function transformation is given; 2) the optimisation algorithms are given based on the presented model; and 3) a new research framework is demonstrated as the potential extensions to the existing stochastic distribution control.

42 ENGINEERING↗
DOE OSTI2021

Proton switching molecular magnetoelectricity

Abstract The convergence of proton conduction and multiferroics is generating a compelling opportunity to achieve strong magnetoelectric coupling and magneto-ionics, offering a versatile platform to realize molecular magnetoelectrics. Here we describe machine learning coupled with additive manufacturing to accelerate the design strategy for hydrogen-bonded multiferroic macromolecules accompanied by strong proton dependence of magnetic properties. The proton switching magnetoelectricity occurs in three-dimensional molecular heterogeneous solids. It consists of a molecular magnet network as proton reservoir to modulate ferroelectric polarization, while molecular ferroelectrics charging proton transfer to reversibly manipulate magnetism. The magnetoelectric coupling induces a reversible 29% magnetization control at ferroelectric phase transition with a broad thermal hysteresis width of 160 K (192 K to 352 K), while a room-temperature reversible magnetic modulation is realized at a low electric field stimulus of 1 kV cm −1 . The findings of electrostatic proton transfer provide a pathway of proton mediated magnetization control in hierarchical molecular multiferroics.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Deep learning of structural morphology imaged by scanning X-ray diffraction microscopy

Scanning X-ray nanodiffraction microscopy is a powerful technique for spatially resolving nanoscale structural morphologies by diffraction contrast. One of the critical challenges in experimental nanodiffraction data analysis is posed by the convergence angle of nanoscale focusing optics which creates simultaneous dependency of the far-field scattering data on three independent components of the local strain tensor-corresponding to dilation and two potential rigid body rotations of the unit cell. All three components are in principle resolvable through a spatially mapped sample tilt series; however, traditional data analysis is computationally expensive and prone to artifacts. In this study, we implement NanobeamNN, a convolutional neural network specifically tailored to the analysis of scanning probe X-ray microscopy data. NanobeamNN learns lattice strain and rotation angles from simulated diffraction of a focused X-ray nanobeam by an epitaxial thin film and can directly make reasonable predictions on experimental data without the need for additional fine-tuning. We demonstrate that this approach represents a significant advancement in computational speed over conventional methods, as well as a potential improvement in accuracy over the current standard.

Luo, Aileen [Cornell Univ., Ithaca, NY (United Sta↗
DOE OSTI2022

Kingdom-Wide Analysis of Fungal Protein-Coding and tRNA Genes Reveals Conserved Patterns of Adaptive Evolution

Protein-coding genes evolved codon usage bias due to the combined but uneven effects of adaptive and nonadaptive influences. Studies in model fungi agree on codon usage bias as an adaptation for fine-tuning gene expression levels; however, such knowledge is lacking for most other fungi. Our comparative genomics analysis of over 450 species supports codon usage and transfer RNAs (tRNAs) as coadapted for translation speed and this is most likely a realization of convergent evolution. Rather than drift, phylogenetic reconstruction inferred adaptive radiation as the best explanation for the variation of interspecific codon usage bias. Although the phylogenetic signals for individual codon and tRNAs frequencies are lower than expected by genetic drift, we found remarkable conservation of highly expressed genes being codon optimized for translation by the most abundant tRNAs, especially by inosine-modified tRNAs. As an application, we present a sequence-to-expression neural network that uses codons to reliably predict highly expressed transcripts. The kingdom Fungi, with over a million species, includes many key players in various ecosystems and good targets for biotechnology. Collectively, our results have implications for better understanding the evolutionary success of fungi, as well as informing the biosynthetic manipulation of fungal genes.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Peer-to-Peer Energy Trading under Network Constraints Based on Generalized Fast Dual Ascent

We report the wide deployment of renewable energy resources, combined with a more proactive demand-side management, is inducing a new paradigm in both power system operation and electricity market trading, which especially boosts the emergence of the peer-to-peer (P2P) market. A more flexible local market mechanism is highly desirable in response to fast changes in renewable power generation at the distribution network level. Moreover, large-scale implementation of P2P energy trading inevitably affects the secure and economic operation of the distribution network. This paper presents a new P2P electricity trading framework with distribution network security constraints considered using the generalized fast dual ascent method. First, an event-driven local P2P market framework is presented to facilitate short-term or immediate local energy transactions. Then, the sensitivity analysis of nodal voltage and network loss with respect to nodal power injections is used to evaluate the impacts of P2P transactions on the distribution network, which ensures the secure operation of the distribution system. Thereby, the external operational constraints are internalized, and the cost of P2P energy trading can be appropriately allocated in an endogenous way. Moreover, a generalized fast dual ascent method is employed to implement distributed market-clearing efficiently. Finally, numerical results indicate that the proposed model could guarantee secure operation of the distribution system with P2P energy trading, and the solution method enjoys good convergence performance.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Implementation of Chemistry in the Athena++ Code

Chemistry plays a key role in many aspects of astrophysical fluids. Atoms and molecules are agents for heating and cooling, determine the ionization fraction, serve as observational tracers, and build the molecular foundation of life. We present the implementation of a chemistry module in the publicly available magnetohydrodynamic code Athena++ . We implement several chemical networks and heating and cooling processes suitable for simulating the interstellar medium (ISM). A general chemical network framework in the KIDA format is also included, allowing users to easily implement their own chemistry. Radiation transfer and cosmic-ray ionization are coupled with chemistry and solved with the simple six-ray approximation. The chemical and thermal processes are evolved as a system of coupled ordinary differential equations with an implicit solver from the CVODE library. We perform and present a series of tests to ensure the numerical accuracy and convergence of the code. Many tests combine chemistry with gas dynamics, including comparisons with analytic solutions, 1D problems of the photodissociation regions and shocks, and realistic 3D simulations of the turbulent ISM. We release the code with the new public version of Athena++ , aiming to provide a robust and flexible code for the astrochemical simulation community.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

nPINNs: Nonlocal physics-informed neural networks for a parametrized nonlocal universal Laplacian operator. Algorithms and applications

Physics-informed neural networks (PINNs) are effective in solving inverse problems based on differential and integro-differential equations with sparse, noisy, unstructured, and multifidelity data. PINNs incorporate all available information, including governing equations (reflecting physical laws), initial-boundary conditions, and observations of quantities of interest, into a loss function to be minimized, thus recasting the original problem into an optimization problem. In this paper, we extend PINNs to parameter and function inference for integral equations such as nonlocal Poisson and nonlocal turbulence models, and we refer to them as nonlocal PINNs (nPINNs). The contribution of the paper is three-fold. First, we propose a unified nonlocal Laplace operator, which converges to the classical Laplacian as one of the operator parameters, the nonlocal interaction radius $\delta$ goes to zero, and to the fractional Laplacian as $\delta$ goes to infinity. This universal operator forms a super-set of classical Laplacian and fractional Laplacian operators and, thus, has the potential to fit a broad spectrum of data sets. We also provide theoretical convergence rates with respect to $\delta$ and verify them via numerical experiments. Second, we use nPINNs to estimate the two parameters, $\delta$ and $\alpha$, characterizing the kernel of the unified operator. The strong non-convexity of the loss function yielding multiple (good) local minima reveals the occurrence of the operator mimicking phenomenon, that is, different pairs of estimated parameters could produce multiple solutions of comparable accuracy. Third, we propose another nonlocal operator with spatially variable order $\alpha(y)$, which is more suitable for modeling turbulent Couette flow. Our results show that nPINNs can jointly infer this function as well as $\delta$. More importantly, these parameters exhibit a universal behavior with respect to the Reynolds number, a finding that contributes to our understanding of nonlocal interactions in wall-bounded turbulence.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2020

nPINNs: nonlocal Physics-Informed Neural Networks for a parametrized nonlocal universal Laplacian operator. Algorithms and Applications

Physics-informed neural networks (PINNs) are effective in solving inverse problems based on differential and integro-differential equations with sparse, noisy, unstructured, and multifidelity data. PINNs incorporate all available information, including governing equations (reflecting physical laws), initial-boundary conditions, and observations of quantities of interest, into a loss function to be minimized, thus recasting the original problem into an optimization problem. In this paper, we extend PINNs to parameter and function inference for integral equations such as nonlocal Poisson and nonlocal turbulence models, and we refer to them as nonlocal PINNs (nPINNs). The contribution of the paper is three-fold. First, we propose a unified nonlocal Laplace operator, which converges to the classical Laplacian as one of the operator parameters, the nonlocal interaction radius δ goes to zero, and to the fractional Laplacian as δ goes to infinity. This universal operator forms a super-set of classical Laplacian and fractional Laplacian operators and, thus, has the potential to fit a broad spectrum of data sets. We provide theoretical convergence rates with respect to δ and verify them via numerical experiments. Second, we use nPINNs to estimate the two parameters, δ and α, characterizing the kernel of the unified operator. The strong non-convexity of the loss function yielding multiple (good) local minima reveals the occurrence of the operator mimicking phenomenon, that is, different pairs of estimated parameters could produce multiple solutions of comparable accuracy. Third, we propose another nonlocal operator with spatially variable order α(γ), which is more suitable for modeling turbulent Couette flow. Our results show that nPINNs can jointly infer this function as well as δ. More importantly, these parameters exhibit a universal behavior with respect to the Reynolds number, a finding that contributes to our understanding of nonlocal interactions in wall-bounded turbulence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Online MCMC Thinning with Kernelized Stein Discrepancy

A fundamental challenge in Bayesian inference is efficient representation of a target distribution. Many nonparametric approaches do so by sampling a large number of points using variants of Markov chain Monte Carlo (MCMC). Here, we propose an MCMC variant that retains only those posterior samples which exceed a kernelized Stein discrepancy (KSD) threshold, which we call KSD thinning. We establish the convergence and complexity trade-offs for several settings of KSD thinning as a function of the KSD threshold parameter, sample size, and other problem parameters. We provide experimental comparisons against other online nonparametric Bayesian methods that generate low-complexity posterior representations. We observe superior consistency/complexity trade-offs across a range of settings including MCMC sampling on two Bayesian inference problems from the biological sciences, and 10 × inference speedup and storage reduction for Bayesian neural networks with no loss of accuracy and no increase in training time. Our code is available at https://github.com/colehawkins/KSD-Thinning.

Bayesian inference↗
DOE OSTI2021

Tensor network study of the m = 1/2 magnetization plateau in the Shastry-Sutherland model at finite temperature

The two-dimensional infinite projected entangled pair state tensor network is evolved in imaginary time with the full update (FU) algorithm to simulate the Shastry-Sutherland model in a magnetic field at finite temperature directly in the thermodynamic limit. We focus on the phase transition into the m = 1/2 magnetization plateau, which was observed in experiments on SrCu 2 (BO 3 ) 2 . For the largest simulated bond dimension, the early evolution in the high-temperature regime is simulated with the simple update (SU) scheme and then, as the correlation length increases, continued with the FU scheme towards the critical regime. We apply a small symmetry-breaking bias field and then extrapolate towards zero bias using a simple scaling theory in the bias field. The combined SU + FU scheme provides an accurate estimate of the critical temperature, even though the results could not be fully converged in the bond dimension in the vicinity of the transition. Here, the critical temperature estimate is improved with a generalized scaling theory that combines two divergent length scales: One due to the bias, and the other due to the finite bond dimension. The obtained results are consistent with the transition being in the universality class of the two-dimensional classical Ising model. The estimated critical temperature is 3.5(2) K, which is well above the temperature 2.1 K used in the experiments.

2-dimensional systems↗
DOE OSTI2023

Automated reaction kinetics and network exploration (Arkane): A statistical mechanics, thermodynamics, transition state theory, and master equation software

The open-source statistical mechanics software described here, Arkane–Automated Reaction Kinetics and Network Exploration–facilitates computations of thermodynamic properties of chemical species, high-pressure limit reaction rate coefficients, and pressure-dependent rate coefficient over multi-well molecular potential energy surfaces (PES) including the effects of collisional energy transfer on phenomenological kinetics. Arkane can use estimates to fill in information for molecules or reactions where quantum chemistry information is missing. The software solves the internal energy master equation for complex unimolecular reaction systems. Inputs to the software include converged electronic structure computations performed by the user using a variety of supported software packages (Gaussian, Molpro, Orca, TeraChem, Q-Chem, Psi4). The software outputs high-pressure limit rate coefficients and pressure-dependent phenomenological rate coefficients, as well as computed thermodynamic properties (enthalpy, entropy, and constant pressure heat capacity) with added energy corrections. Some of the key features of Arkane include treatment of 1D, 2D or ND hindered internal rotation modes, treatment of free internal rotation modes, quantum tunneling effect consideration, transition state theory (TST) and Rice-Ramsperger-Kassel-Marcus (RRKM) rate coefficient computations, master equation solution with four implemented methods, inverse-Laplace transform of high-pressure limit rate coefficients into the energy domain, energy corrections based on bond-additivity or isodesmic reactions, automated and efficient PES exploration, and PES sensitivity analysis. The present work describes the design of Arkane, how it should be used, and refers to the theory that it employs. Arkane is distributed via the RMG-Py software suite (https://github.com/ReactionMechanismGenerator/RMG-Py).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Explainable physics-based constraints on reinforcement learning for accelerator optimization

We present a reinforcement learning (RL) framework for optimizing particle accelerator experiments that builds explainable physics-based constraints on agent behavior. The goal is to increase transparency and trust by letting users verify that the agent’s decision-making process incorporates suitable physics. Our algorithm uses a learnable surrogate function for physical observables, such as energy, and uses them to fine-tune how actions are chosen. This surrogate can be represented by a neural network or by an interpretable sparse dictionary model. We test our algorithm on a range of particle accelerator optimization environments designed to emulate the Continuous Electron Beam Accelerator Facility at Jefferson Lab. By examining the mathematical form of the learned constraint function, we are able to confirm the agent has learned to use the established physics of each environment. In addition, we find that the introduction of a physics-based surrogate enables our RL algorithms to reliably converge for difficult high-dimensional accelerator optimization environments.

explainability↗
DOE OSTI2024

Respecting causality for training physics-informed neural networks

While the popularity of physics-informed neural networks (PINNs) is steadily rising, to this date PINNs have not been successful in simulating dynamical systems whose solution exhibits multi-scale, chaotic or turbulent behavior. In this work we attribute this shortcoming to the inability of existing PINNs formulations to respect the spatio-temporal causal structure that is inherent to the evolution of physical systems. We argue that this is a fundamental limitation and a key source of error that can ultimately steer PINN models to converge towards erroneous solutions. We address this pathology by proposing a simple re-formulation of PINNs loss functions that can explicitly account for physical causality during model training. We demonstrate that this simple modification alone is enough to introduce significant accuracy improvements, as well as a practical quantitative mechanism for assessing the convergence of a PINNs model. Here we provide state-of-the-art numerical results across a series of benchmarks for which existing PINNs formulations fail, including the chaotic Lorenz system, the Kuramoto–Sivashinsky equation in the chaotic regime, and the Navier–Stokes equations. To the best of our knowledge, this is the first time that PINNs have been successful in simulating such systems, introducing new opportunities for their applicability to problems of industrial complexity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Cyber‐Resilient Distributed Energy Resource Control Algorithms for Smart Distribution Grids

ABSTRACT This paper focuses on the development of cyber‐resilient gradient‐based optimisation algorithms and theoretical proof for grid‐interactive distributed energy resource (DER) control to enable two grid services of virtual power plants (VPPs) dispatch and grid voltage regulation, considering the communication and security impacts. Firstly, the combined DER dispatch and voltage regulation as a real‐time gradient‐based optimisation problem is recapped. Thereafter, we consider a probabilistic traffic model to characterise packet delays and loss in a communication network, and study how the delays enter the process of information exchange among the grid measurement units, local DER controllers and the grid control centre that execute this control algorithm in a coordinated manner. Then, a strategy combining delay thresholds and message update rules is proposed to immunity the asynchrony resulting from the communications traffic and it avoids possible numerical instabilities and sensitivities of the power tracking and voltage regulation capabilities, resulting as cyber‐resilient DER control algorithms. Additionally, their convergence is theoretically proved. Effectiveness of proposed cyber‐resilient algorithms has been validated on the IEEE 37‐bus system in terms of convergence, VPP tracking and voltage regulation performance for smart distribution systems with high penetration of DERs.

24 POWER TRANSMISSION AND DISTRIBUTION↗