Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematical physics methods”

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 721 records · Page 40

Electronic structure theory with molecular point group symmetries on quantum annealers

Quantum computation has the potential to revolutionize quantum chemistry through major speedups in computation times and an exponential reduction in computational resources. Here, we combine the symmetry-adapted Jordan–Wigner encoding based on the full Boolean symmetry group $\mathbb{Z}$$^{k}_{2}$ with our new implementation of the Xia–Bian–Kais (XBK) method for improving the efficiency of electronic structure theory calculations on quantum annealers, particularly by reducing the number of qubits needed to achieve the same accuracy. By providing a more extensive symmetry-adapted encoding (SAE) than previous work, we are able to simulate molecules larger than those previously reported that have been studied using methods developed for quantum annealers and without using an active space. We calculated the potential energy surfaces of H 2 , LiH, He 2 , H 2 O, O 2 , N 2 , Li 2 , F 2 , CO, BH 3 , NH 3 , and CH 4 , with the largest molecule in the STO-6G basis set requiring 16 qubits with our SAE, and compared them with full configuration interaction results. The application of SAE to the XBK method provides an exponential reduction in the size of the Hilbert space and scales well with the size of the problem. It does not introduce significant additional errors for even or large values of a key variational parameter that determines the number of ancilla qubits used in the XBK method’s Hamiltonian embedding, or for certain molecules such as He 2 and H 2 O. Here, we provide an explanation for this behavior and a recommendation on the usage of our method. In addition, we briefly discuss the potential of extracting electronic excited states from our method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An autoencoder compression approach for accelerating large-scale inverse problems

Abstract Partial differential equation (PDE)-constrained inverse problems are some of the most challenging and computationally demanding problems in computational science today. Fine meshes required to accurately compute the PDE solution introduce an enormous number of parameters and require large-scale computing resources such as more processors and more memory to solve such systems in a reasonable time. For inverse problems constrained by time-dependent PDEs, the adjoint method often employed to compute gradients and higher order derivatives efficiently requires solving a time-reversed, so-called adjoint PDE that depends on the forward PDE solution at each timestep. This necessitates the storage of a high-dimensional forward solution vector at every timestep. Such a procedure quickly exhausts the available memory resources. Several approaches that trade additional computation for reduced memory footprint have been proposed to mitigate the memory bottleneck, including checkpointing and compression strategies. In this work, we propose a close-to-ideal scalable compression approach using autoencoders to eliminate the need for checkpointing and substantial memory storage, thereby reducing the time-to-solution and memory requirements. We compare our approach with checkpointing and an off-the-shelf compression approach on an earth-scale ill-posed seismic inverse problem. The results verify the expected close-to-ideal speedup for the gradient and Hessian-vector product using the proposed autoencoder compression approach. To highlight the usefulness of the proposed approach, we combine the autoencoder compression with the data-informed active subspace (DIAS) prior showing how the DIAS method can be affordably extended to large-scale problems without the need for checkpointing and large memory.

Mathematics↗

Spring 2023 Verification Presentation to Headquarters [Slides]

Testing codes is important, and more tests are needed. Verification testing is different than software-quality assurance, like regression suites. Tests should be simple, but not too simple, and tests should be code agnostic. Developing verification methods is still open research. Testing single-physics code pieces in isolation may lead to bad results when they are coupled. Good verification tests must include multiple physics models, multiple materials, and be performed in multiple dimensions.

97 MATHEMATICS AND COMPUTING↗

Towards exact finite temperature electronic structure in solids and molecules (Final Technical Report)

This report describes the University of Iowa portion of a project that is now continuing at Michigan State University. We are developing novel methods, algorithms, and software to enable simulations of molecules and materials at high temperature. This is a key challenge in chemistry and materials science. By refining an approach called Density Matrix Quantum Monte Carlo (DMQMC), we developed faster and more accurate ways to conduct these simulations. These advances will help us understand how temperature affects the behavior of electrons, chemical bonds, and phase transitions in solids and molecules. These breakthroughs are especially important for applications where light and heat drive chemical reactions, superconductivity, and materials used in energy and sensing. In addition, this project involved the development of the open-source HANDE-QMC software package, supporting the broader community in benchmarking and developing finite-temperature electronic structure methods.

36 MATERIALS SCIENCE↗

Global analysis peak fitting for chemical spectroscopy data

The present invention relates to methods for analyzing a chemical sample. For instance, the methods herein allow for global analysis of spectroscopy data in order to extract useful chemical properties from complicated multidimensional data. Such analysis can optionally employ data compression to further expedite computer-implemented computation. In particular, the methods herein provide global analysis of data matrices explained by both linear and non-linear terms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Classification of (2 + 1) D invertible fermionic topological phases with symmetry

Here we provide a classification of invertible topological phases of interacting fermions with symmetry in two spatial dimensions for general fermionic symmetry groups G f and general values of the chiral central charge c - . Here G f is a central extension of a bosonic symmetry group G b by fermion parity, (-1) F , specified by a second cohomology class [ω 2 ]∈ $\mathscr{H}^2$(Gb,$\mathbb{Z}_2$). Our approach proceeds by gauging fermion parity and classifying the resulting G b symmetry-enriched topological orders while keeping track of certain additional data and constraints. We perform this analysis through two perspectives, using G-crossed braided tensor categories and Spin(2c - ) 1 Chern-Simons theory coupled to a background G gauge field. These results give a way to characterize and classify invertible fermionic topological phases in terms of a concrete set of data and consistency equations, which is more physically transparent and computationally simpler than the more abstract methods using cobordism theory and spectral sequences. Our results also generalize and provide a different approach to the recent classification of fermionic symmetry-protected topological phases by Wang and Gu, which have chiral central charge c - = 0. We show how the tenfold way classification of topological insulators and superconductors fits into our scheme, along with general nonperturbative constraints due to certain choices of c - and G f . Mathematically, our results also suggest an explicit general parametrization of deformation classes of (2 + 1)D invertible topological quantum field theories with G f symmetry.

36 MATERIALS SCIENCE↗

Surface fluctuating hydrodynamics methods for the drift-diffusion dynamics of particles and microstructures within curved fluid interfaces

Here we introduce fluctuating hydrodynamics approaches on surfaces for capturing the drift-diffusion dynamics of particles and microstructures immersed within curved fluid interfaces of spherical shape. We take into account the interfacial hydrodynamic coupling, traction coupling with the surrounding bulk fluid, and thermal fluctuations. For fluid-structure interactions, we introduce Immersed Boundary Methods (IBM) and related Stochastic Eulerian-Lagrangian Methods (SELM) for curved surfaces. We use these approaches to investigate the statistics of surface fluctuating hydrodynamics and microstructures. For velocity autocorrelations, we find characteristic power-law scalings $τ^{-1}, τ^{-2}$, and plateaus can emerge. This depends on the physical regime associated with the geometry, surface viscosity, and bulk viscosity. This differs from the characteristic $τ^{-3/2}$ scaling for bulk three dimensional fluids. We develop theory explaining these observed power-laws associated with time-scales for dissipation within the fluid interface and coupling to the surrounding fluid. We then use our introduced methods to investigate a few example systems and roles of hydrodynamic coupling and thermal fluctuations including for the kinetics of passive particles and active microswimmers in curved fluid interfaces.

97 MATHEMATICS AND COMPUTING↗

Power Grid Reliability Estimation via Adaptive Importance Sampling

Electricity production currently generates approximately 25% of greenhouse gas emissions in the USA. Thus, increasing the amount of renewable energy is a key step to carbon neutrality. However, integrating a large amount of fluctuating renewable generation is a significant challenge for power grid operating and planning. Grid reliability, i.e., an ability to meet operational constraints under power fluctuations, is probably the most important of them. In this letter, we propose computationally efficient and accurate methods to estimate the probability of line overflow, i.e., reliability constraints violation, under a known distribution of renewable energy generation. To this end, we investigate an importance sampling approach, a flexible extension of Monte-Carlo methods, which adaptively changes the sampling distribution to generate more samples near the reliability boundary. The approach allows to estimate overload probability in real-time based only on a few dozens of random samples, compared to thousands required by the plain Monte-Carlo. Our study focuses on high voltage direct current power transmission grids with linear reliability constraints on power injections and line currents. Herein, we propose a novel theoretically justified physics-informed adaptive importance sampling algorithm and compare its performance to state-of-the-art methods on multiple IEEE power grid test cases.

power system faults↗

Tag and seal employing a micromachine artifact

A method and apparatus to authenticate a tamper resistant seal that includes a population of particles embedded in an adhesive, the population including at least one micromachine artifact of a predetermined physical shape.

47 OTHER INSTRUMENTATION↗

Expansion of Machine-Learning Method for Classifying Neutron Resonances

The understanding of astrophysics processes and the performance of nuclear reactors and other nuclear systems depend on a precise description of the neutron interaction cross sections for materials and nuclei present in these environments. At low neutron energies, these cross sections exhibit resonance structure represented by sharp enhancements when the neutron energy is sufficiently close to excited levels in a compound nucleus. Such resonances can be characterized by their quantum numbers relative to angular momenta, which are often deduced in an ad hoc and irreproducible manner from the shape of the cross sections. The correct assignment of the quantum numbers of neutron resonances is therefore of paramount importance. To address this we have developed a machine-learning method to automate the identification and correction of these spin assignments. The algorithm is trained from simulated data, generated from statistical properties of resonance data for a given nucleus, to mimic the errors found in real data. In this project we describe five independent approaches to further develop and expand the applicability of the machine-learning spin classifier: i) Feature impact; ii) Integration with the Atlas; iii) Training optimization; iv) Spacings systematics; and v) Validation with polarized data. The premises, methods, results, and future perspectives are discussed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Accomplishments of Thermal Neutron Scattering Research at North Carolina State University [Slides]

Thermal neutron scattering law (TSL) data evaluations have been completed and contributed to ENDF. New evaluations are underway. FLASSH is developing as a modern platform for thermal neutron data analysis featuring an enhanced user experience and low learning overhead. Advanced TSL techniques in combination with Doppler analysis have been developed, which were incorporated into FLASSH. ML/DL NeTS method development has been initiated. Experimental capabilities for validation have been developed at the PULSTAR reactor.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Predicting rare events using neural networks and short-trajectory data

Estimating the likelihood, timing, and nature of events is a major goal of modeling stochastic dynamical systems. When the event is rare in comparison with the timescales of simulation and/or measurement needed to resolve the elemental dynamics, accurate prediction from direct observations becomes challenging. In such cases a more effective approach is to cast statistics of interest as solutions to Feynman-Kac equations (partial differential equations). Here, we develop an approach to solve Feynman-Kac equations by training neural networks on short-trajectory data. Our approach is based on a Markov approximation but otherwise avoids assumptions about the underlying model and dynamics. This makes it applicable to treating complex computational models and observational data. Additionally, we illustrate the advantages of our method using a low-dimensional model that facilitates visualization, and this analysis motivates an adaptive sampling strategy that allows on-the-fly identification of and addition of data to regions important for predicting the statistics of interest. Finally, we demonstrate that we can compute accurate statistics for a 75-dimensional model of sudden stratospheric warming. This system provides a stringent test bed for our method.

97 MATHEMATICS AND COMPUTING↗

Guided skyrmion motion along pinning array interfaces

We examine ac driven skyrmions interacting with the interface between two different obstacle array structures. We consider drive amplitudes at which skyrmions in a bulk obstacle lattice undergo only localized motion and show that when an obstacle lattice interface is introduced, directed skyrmion transport can occur along the interface. The skyrmions can be guided by a straight interface and can also turn corners to follow the interface. For a square obstacle lattice embedded in a square pinning array with a different obstacle radius, we find that skyrmions can undergo transport in all four primary symmetry directions under the same fixed ac drive. We map where localized or translating motion occurs as a function of the ac driving parameters. Our results suggest a new method for controlling skyrmion motion based on transport along obstacle lattice interfaces.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gradient-enhanced physics-informed neural networks for forward and inverse PDE problems

Deep learning has been shown to be an effective tool in solving partial differential equations (PDEs) through physics-informed neural networks (PINNs). PINNs embed the PDE residual into the loss function of the neural network, and have been successfully employed to solve diverse forward and inverse PDE problems. However, one disadvantage of the first generation of PINNs is that they usually have limited accuracy even with many training points. Here, we propose a new method, gradient-enhanced physics-informed neural networks (gPINNs), for improving the accuracy of PINNs. gPINNs leverage gradient information of the PDE residual and embed the gradient into the loss function. We tested gPINNs extensively and demonstrated the effectiveness of gPINNs in both forward and inverse PDE problems. Our numerical results show that gPINN performs better than PINN with fewer training points. Additionally, we combined gPINN with the method of residual-based adaptive refinement (RAR), a method for improving the distribution of training points adaptively during training, to further improve the performance of gPINN, especially in PDEs with solutions that have steep gradients.

42 ENGINEERING↗

Physics constrained learning for data-driven inverse modeling from sparse observations

Deep neural networks (DNN) have been used to model nonlinear relations between physical quantities. Those DNNs are embedded in physical systems described by partial differential equations (PDE) and trained by minimizing a loss function that measures the discrepancy between predictions and observations in some chosen norm. This loss function often includes the PDE constraints as a penalty term when only sparse observations are available. As a result, the PDE is only satisfied approximately by the solution. However, the penalty term typically slows down the convergence of the optimizer for stiff problems. We present a new approach that trains the embedded DNNs while numerically satisfying the PDE constraints. We develop an algorithm that enables differentiating both explicit and implicit numerical solvers in reverse-mode automatic differentiation. This allows the gradients of the DNNs and the PDE solvers to be computed in a unified framework. We demonstrate that our approach enjoys faster convergence and better stability in relatively stiff problems compared to the penalty method. Furthermore, our approach allows for the potential to solve and accelerate a wide range of data-driven inverse modeling, where the physical constraints are described by PDEs and need to be satisfied accurately.

97 MATHEMATICS AND COMPUTING↗

Learning Only on Boundaries: A Physics-Informed Neural Operator for Solving Parametric Partial Differential Equations in Complex Geometries

Recently, deep learning surrogates and neural operators have shown promise in solving partial differential equations (PDEs). However, they often require a large amount of training data and are limited to bounded domains. In this work, we present a novel physics-informed neural operator method to solve parameterized boundary value problems without labeled data. By reformulating the PDEs into boundary integral equations (BIEs), we can train the operator network solely on the boundary of the domain. This approach reduces the number of required sample points from $O(N^d)$ to $O(N^{d-1}$), where $d$ is the domain’s dimension, leading to a significant acceleration of the training process. Additionally, our method can handle unbounded problems, which are unattainable for existing physics-informed neural networks (PINNs) and neural operators. Finally, our numerical experiments show the effectiveness of parameterized complex geometries and unbounded problems.

97 MATHEMATICS AND COMPUTING↗

Autonomous anomaly detection of proliferation in the AGN-201 nuclear reactor digital twin

The expansion of global nuclear power necessitates advanced methods for analyzing proliferation indicators. This study introduces a novel application of the Isolation Forest Machine Learning (IFML) algorithm within a digital twin (DT) of the AGN-201 nuclear reactor to autonomously detect anomalies. Leveraging real-time operational data from the AGN-201 DT, the IFML algorithm identifies outliers without prior data labeling and operates as a lightweight, complementary approach to traditional physics-based anomaly detection methods for nuclear safeguards. In a simulated Red vs. Blue team exercise, the IFML algorithm successfully detected six significant unseen anomalies related to reactivity changes, achieving an accuracy of 99% for identifying operational deviationxs. These anomalies, caused by deliberate perturbations, were detected alongside known physics-based models, underscoring the potential of IFML to enhance real-time monitoring without displacing traditional methods. Further, this study highlights the applicability of IFML in nuclear environments by providing an additional, redundant layer of anomaly detection to improve safeguards and operational safety in complex systems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Detection of DoS Attacks Using ARFIMA Modeling of GOOSE Communication in IEC 61850 Substations

Integration of Information and Communication Technology (ICT) in modern smart grids (SGs) offers many advantages including the use of renewables and an effective way to protect, control and monitor the energy transmission and distribution. To reach an optimal operation of future energy systems, availability, integrity and confidentiality of data should be guaranteed. Research on the cyber-physical security of electrical substations based on IEC 61850 is still at an early stage. In the present work, we first model the network traffic data in electrical substations, then, we present a statistical Anomaly Detection (AD) method to detect Denial of Service (DoS) attacks against the Generic Object Oriented Substation Event (GOOSE) network communication. According to interpretations on the self-similarity and the Long-Range Dependency (LRD) of the data, an Auto-Regressive Fractionally Integrated Moving Average (ARFIMA) model was shown to describe well the GOOSE communication in the substation process network. Based on this ARFIMA-model and in view of cyber-physical security, an effective model-based AD method is developed and analyzed. Two variants of the statistical AD considering statistical hypothesis testing based on the Generalized Likelihood Ratio Test (GLRT) and the cumulative sum (CUSUM) are presented to detect flooding attacks that might affect the availability of the data. Our work presents a novel AD method, with two different variants, tailored to the specific features of the GOOSE traffic in IEC 61850 substations. The statistical AD is capable of detecting anomalies at unknown change times under the realistic assumption of unknown model parameters. The performance of both variants of the AD method is validated and assessed using data collected from a simulation case study. We perform several Monte-Carlo simulations under different noise variances. The detection delay is provided for each detector and it represents the number of discrete time samples after which an anomaly is detected. In fact, our statistical AD method with both variants (CUSUM and GLRT) has around half the false positive rate and a smaller detection delay when compared with two of the closest works found in the literature. Our AD approach based on the GLRT detector has the smallest false positive rate among all considered approaches. Whereas, our AD approach based on the CUSUM test has the lowest false negative rate thus the best detection rate. Depending on the requirements as well as the costs of false alarms or missed anomalies, both variants of our statistical detection method can be used and are further analyzed using composite detection metrics.

IEC 61850 electrical substations↗