Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized algorithm”

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 1,513 records · Page 84
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Deep Learning Based Workflow for Accelerated Industrial X-Ray Computed Tomography

X-ray computed tomography (XCT) is an important tool for high-resolution non-destructive characterization of additively-manufactured metal components. XCT reconstructions of metal components may have beam hardening artifacts such as cupping and streaking which makes reliable detection of flaws and defects challenging. Furthermore, traditional workflows based on using analytic reconstruction algorithms require a large number of projections for accurate characterization - leading to longer measurement times and hindering the adoption of XCT for in-line inspections. In this paper, we introduce a new workflow based on the use of two neural networks to obtain high-quality accelerated reconstructions from sparse-view XCT scans of single material metal parts. The first network, implemented using fully-connected layers, helps reduce the impact of BH in the projection data without the need of any calibration or knowledge of the component material. The second network, a convolutional neural network, maps a low-quality analytic 3D reconstruction to a high-quality reconstruction. Using experimental data, we demonstrate that our method robustly generalizes across several alloys, and for a range of sparsity levels without any need for retraining the networks thereby enabling accurate and fast industrial XCT inspections.

Rahman, Obaid↗
DOE OSTI2021

All-Atom Simulation of 3D Hot Spot Formation in Shocked TATB Explosive

TATB is an insensitive high explosive (IHE) critical to the stockpile that is challenging to model at the continuum scale. Advanced detonation models in the Cheetah high explosive chemistry code require validation though subscale simulations. High explosive initiation is determined by micron-scale physics of hot spots formed a shock-collapsed pores. Pore sizes between 100 nm and 1 μm are believed to be the most important for determining the shock sensitivity of TATB. This range of pore sizes is difficult to access at the atomic scale through allatom molecular dynamics (MD) simulations, even with Sierra-class computers. Quasi-2D simulations are widely used and allow much larger pore sizes (up to 400 nm) to be studied, but the applicability of 2D simulations to the actual 3D pore response is not understood. Resolving these uncertainties through “full physics” MD modeling is key for generalizing, parameterizing, and validating the kinds of continuum models used to inform design, safety, and performance. This work was a continuation of FY20 efforts pushing simulations to full 3D with the largest-ever all-atom simulations of an explosive. These were the first all-atom full-3D simulations of large hot spots thought to govern explosive detonation and required over a billion atoms. Simulations were performed using LAMMPS, an open SNL science code. MD explosive models present unique challenges, even for established codes such as LAMMPS. Their model forms are more complex than typical models for metals, while simulating high temperature-pressure conditions is demanding and increases computational cost. Scaling problems in GPU-enabled MD algorithms initially limited simulations to <100 million atoms but were resolved through collaboration with SNL. An overall 24x speedup was obtained relative to CPU machines. Specialized analysis of these simulations required a bottom-up refactoring and algorithm parallelization of in-house codes and application of computer vision algorithms to extract meaningful information.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Simulating lossy Gaussian boson sampling with matrix-product operators

Gaussian boson sampling, a computational model that is widely believed to admit quantum supremacy, has already been experimentally demonstrated and is claimed to surpass the classical simulation capabilities of even the most powerful supercomputers today. However, whether the current approach limited by photon loss and noise in such experiments prescribes a scalable path to quantum advantage is an open question. Here, to understand the effect of photon loss on the scalability of Gaussian boson sampling, we analytically derive the asymptotic operator entanglement entropy scaling, which relates to the simulation complexity. As a result, we observe that efficient tensor network simulations are likely possible under the N out ∝ √N scaling of the number of surviving photons N out in the number of input photons N. We numerically verify this result using a tensor network algorithm with U⁡(1) symmetry, and we overcome previous challenges due to the large local Hilbert-space dimensions in Gaussian boson sampling with hardware acceleration. Additionally, we observe that increasing the photon number through larger squeezing does not increase the entanglement entropy significantly. Finally, we numerically find the bond dimension necessary for fixed accuracy simulations, providing more direct evidence for the complexity of tensor networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

A path integral ground state Monte Carlo algorithm for entanglement of lattice bosons

A ground state path integral quantum Monte Carlo algorithm is introduced that allows for the study of entanglement in lattice bosons at zero temperature. The Rényi entanglement entropy between spatial subregions is explored across the phase diagram of the one dimensional Bose-Hubbard model for systems consisting of up to L=256 L = 256 sites at unit-filling without any restrictions on site occupancy, far beyond the reach of exact diagonalization. The favorable scaling of the algorithm is demonstrated through a further measurement of the Rényi entanglement entropy at the two dimensional superfluid-insulator critical point for large system sizes, confirming the existence of the expected entanglement boundary law in the ground state. The Rényi estimator is extended to measure the symmetry resolved entanglement that is operationally accessible as a resource for experimentally relevant lattice gases with fixed total particle number.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

MOOSE Reactor Module Meshing Enhancements to Support Reactor Physics Analysis

The U.S. Department of Energy Office of Nuclear Energy Advanced Modeling and Simulation (NEAMS) program develops an integrated suite of advanced reactor physics tools built upon the Multiphysics Object-Oriented Simulation Environment (MOOSE) framework. Each code generally requires an input finite element mesh on which the physics solution is calculated, reported, and transferred to other physics codes. The meshing process is often burdensome for the complex geometries present in reactors due to lack of easy-to-use, open-source meshing tools. To address the bottleneck associated with meshing complex geometries found in nuclear reactors, NEAMS initiated the development of the MOOSE Reactor Module starting in FY21. The Reactor Module builds off the existing MOOSE Mesh System to include targeted meshing capabilities such as the ability to generate hexagonal pin cells, assemblies with ducts, rotating control drums, cores, peripheral zones around a core, as well as the automatic labeling (“reporting IDs”) of pin, assembly, and planar zones to simplify post-processing of results. As a Physics Module in MOOSE, the Reactor Module is open-source, available with any MOOSE installation, directly compatible with MOOSE-based tools, and can be invoked from MOOSEbased applications to generate meshes. Functionality from the Reactor Module has been applied to several advanced reactor concepts to demonstrate user workflow improvements and accuracy. The primary objective of the Reactor Module is to improve useability of MOOSEbased tools by streamlining mesh generation and output inspection processes. During FY22, the functionality of the Reactor Module (and accompanying Mesh System) has been expanded based on user needs. First, the Reactor Geometry Mesh Builder capability developed primarily in FY21 has been refactored and merged to the public MOOSE repository. This capability wraps underlying Reactor Module mesh generators into a “Pin – Assembly – Core” workflow appropriate for conventional Cartesian and hexagonal geometries, and notably assigns material IDs during mesh generation stage and generates only the minimal number of blocks needed in order to reduce computational burden. Biasing and boundary layer options have been added to the base mesh generators as required by thermal hydraulics solvers. The reporting ID functionality has been expanded to differentiate ring-wise and azimuthal sectors within a pin for use with depletion algorithms, and VectorPostProcessor and Reporter objects are now available to integrate solution variables across zones based on ID combinations. Functionality to trim hexagonal meshes along the center or periphery has been developed so users may leverage symmetry and reflective boundary conditions to reduce the mesh size. A flexible and powerful tool to fill the space between two sidesets has been introduced to the framework and can be used for transition layers such as stitching two assemblies together with different numbers of pins, or for complex geometries which do not follow conventional Cartesian/hexagonal patterns. Finally, additional verification problems were performed with NEAMS physics tools in complement with existing NEAMS work.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

Bi-cross validation of spectral clustering hyperparameters

One challenge impeding the analysis of terabyte scale X-ray scattering data from the Linac Coherent Light Source (LCLS) is determining the number of clusters required for the execution of traditional clustering algorithms. Here, we demonstrate that the previous work using bi-cross validation to determine the number of singular vectors directly maps to the spectral clustering problem of estimating both the number of clusters and hyperparameter values. Here by applying this method to LCLS X-ray scattering data enables the identification of dropped shots without manually setting boundaries on detector fluence and provides a path toward identifying rare and anomalous events.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Deep learning symmetries and their Lie groups, algebras, and subalgebras from first principles

Abstract We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset. We use fully connected neural networks to model the symmetry transformations and the corresponding generators. The constructed loss functions ensure that the applied transformations are symmetries and the corresponding set of generators forms a closed (sub)algebra. Our procedure is validated with several examples illustrating different types of conserved quantities preserved by symmetry. In the process of deriving the full set of symmetries, we analyze the complete subgroup structure of the rotation groups SO (2), SO (3), and SO (4), and of the Lorentz group S O ( 1 , 3 ) . Other examples include squeeze mapping, piecewise discontinuous labels, and SO (10), demonstrating that our method is completely general, with many possible applications in physics and data science. Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

CP-DSSS: A Novel Waveform for Multiple Access in IoT

Cyclic prefix direct sequence spread spectrum (CPDSSS) is a novel waveform with versatile characteristics that positions itself well as a secondary network to relieve the congested wireless spectrum. The underlying structure of CPDSSS allows for efficient and effective multi-access capabilites through frequency and time division schemes in a given system. The sum-rate capacity of the system is maximized when the spectrum is divided and allocated to users with the best signal-to-noise (SNR) ratio for the given channel slice. We propose an algorithm for dividing and allocating portions of the spectrum to multiple users with the final goal of maximizing the sumrate capacity of the network. We also propose and develop a precoding/equalization technique that reduces the length of the channel impulse response. This, when used along with a matched filter detector, leads to some improvement in the sum-rate capacity of the network

5G and Beyond Communications↗
DOE OSTI2025

Dynamic Modeling of a Kaplan Hydroturbine Using Optimal Parametric Tuning and Real Plant Operational Data

To address grid variability caused by renewable energy integration and to maintain grid reliability and resilience, hydropower must quickly adjust its power generation over short time periods. This changing energy generation landscape requires advance technology integration and adaptive parameter optimization for hydropower systems via digital twin effort. However, this is difficult owing to the lack of characterization and modeling for the nonlinear nature of hydroturbines. To solve this issue, this paper first formulates a six-coefficient Kaplan hydroturbine model and then proposes a parametric optimization tuning framework based on the Nelder–Mead algorithm for adaptive dynamic learning of the six-coefficients so as to build models that describe the turbine. To assess the performance of the proposed optimal parametric tuning technique, operational data from a real-world Kaplan hydroturbine unit are collected and used to model the relationship between the gate opening and the generated power production. The findings show that the proposed technique can effectively and adaptively learn the unknown dynamics of the Kaplan hydroturbine while optimally tune the unknown coefficients to match the generated power output from the real hydroturbine unit with an inaccuracy of less than 5%. The method can be used to provides optimal tuning of parameters critical for controller design, operational optimization and daily maintenance for hydroturbines in general.

13 HYDRO ENERGY↗
DOE OSTI2020

Canonical Transformation of Potential Model Hamiltonian Mechanics to Geometrical Form I

Using the methods of symplectic geometry, we establish the existence of a canonical transformation from potential model Hamiltonians of standard form in a Euclidean space to an equivalent geometrical form on a manifold, where the corresponding motions are along geodesic curves. The advantage of this representation is that it admits the computation of geodesic deviation as a test for local stability, shown in recent previous studies to be a very effective criterion for the stability of the orbits generated by the potential model Hamiltonian. We describe here an algorithm for finding the generating function for the canonical transformation and describe some of the properties of this mapping under local diffeomorphisms. We give a convergence proof for this algorithm for the one-dimensional case, and provide a precise geometric formulation of geodesic deviation which relates the stability of the motion in the geometric form to that of the Hamiltonian standard form. We apply our methods to a simple one-dimensional harmonic oscillator and conclude with a discussion of the relation of bounded domains in the two representations for which Morse theory would be applicable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Bit-GraphBLAS: Bit-Level Optimizations of Matrix-Centric Graph Processing on GPU

In the graph data structure like adjacency matrix, the connectivity of two nodes can be sufficiently represented using only 1 bit, but they are generally treated as 32-bit full-precision in state-of-the-art graph frameworks to adopt common sparse format such as CSR. Meanwhile, bit-level parallelism has recently be explored to have high-performance potential and low storage requirement on GPUs with dense bit-tiles. To fill the gap, our solution is a hierarchical storage format that contains the bit-indexing base and dense bit-tile units. Inherently, the granularity of the bit-tile is an essential factor in achieving both storage compression and GPU parallelism. How to find a sweet spot that trades off between avoiding sparsity and exploiting is comprehensively researched in this work. In the experiment, we evaluate the proposed storage format and algorithms on modern generation GPUs, including Pascal and Volta, to figure out critical software co-designs in conjunction with existing hardware-specific optimization.

Chen, Jou-An↗
DOE OSTI2023

Dynamic Species Reduction for Multi-Cycle CFD Simulations (Final Technical Report)

This project primarily sought to address some of the computational cost concerns of detailed simulations by developing improved methods of handling species transport, and chemical kinetics evaluation in a commercial 3D Computational Fluid Dynamics (CFD) environment. Secondary goals were to apply these techniques to fuels and conditions of interest to better understand the key species and reactions required to adequately capture cycle to cycle coupling. Improved modeling will lead to better understanding of these combustion modes and their dependence on fuel composition, which can then enable more clean and efficient engines, ultimately benefiting the consumer as well as the general public. Two approaches were used to address the computational cost. A “Dynamic Species Reduction” (DSR) procedure was developed to remove chemical species from the simulation during periods when chemical reactions were not expected to be important, particularly during gas exchange when temperatures are low and little fuel remains. This modelling procedure automatically detects relevant species to retain in the simulation domain based on their local concentration, removes species below a specified concentration threshold, and then adjusts the remaining species mass to conserve not only the number of H, C, and O atoms in each cell, but also the relative proportions between species and the heating value of the mixture in every cell. The second procedure was a “Product Directed Remapping” (PDR) updates the algorithm used to group individual computational cells for chemical kinetics evaluation to account for non-uniform temperature distributions and the CO to CO 2 ratio in the cells. The model techniques developed in this work successfully demonstrated computational performance improvements for a range of conditions relevant for Highly Dilute SI and HCCI engine operation. Runtime reductions of 10% were observed for small mechanisms, with further reductions of up to 36% observed for larger mechanisms. Improvements were primarily related to reducing the number of chemical species tracked during the gas exchange process using the Dynamic Species Reduction method. With smaller benefits observed from changes to the kinetics binning and evaluation strategy in the post combustion region using the PDR method. The results of this work show the potential for improved computational runtime for complicated simulations. They can and should be extended to additional conditions and new bio-derived and renewable fuels as they are developed and new kinetic mechanisms become available.

10 SYNTHETIC FUELS↗
DOE OSTI2024

MFANS 2024 - Formally Proving Characteristics of Cyber-Physical Systems

Cyber-physical systems (CPS) are engineered systems that rely on the smooth integration of computational algorithms and physical elements. This integration presents new challenges for verifying that systems will behave as expected. The goal of this presentation is to present current challenges and potential solutions for the formal verification of cyber-physical systems. For cyber systems, formal methods refer to systematically rigorous mathematical techniques employed in the specification, development, analysis, and verification of both software and hardware systems. Recent advancements in computer science have yielded sophisticated tools specifically designed to address challenges associated with formal methods in complex systems. These tools leverage various foundational concepts such as logic, formal languages, program semantics, type systems, type theory, and automata theory. A notable achievement in the application of formal methods is the seL4 microkernel, claimed to be the first general-purpose operating-system kernel to be verified. Its proof implies the absence of bugs and guarantees that the kernel meets specifications. For physical systems, dynamic and control theory has a history of using rigorous analytic techniques to prove functional correctness. Lyapunov, optimal, classical, modern, and robust control theories all provide rigorous mathematical methods both to analyze system performance and to design controller that can be guaranteed to meet certain objectives. Recent computational techniques like level set theory and reachability analysis provide assertions that a system's state will avoid unsafe regions. Even though success has been independently achieved for cyber systems and physical systems, the integration of such systems creates new challenges. In particular, there is an obvious discrepancy between finite-state machines and infinite-state systems, resulting in different approaches for modeling and analyzing these system. While it is possible to simulate hybrid systems, this provides only a demonstration of a performance and not proof. For hybrid systems, current formal methods and system analysis approaches typically require a workarounds to work on hybrid systems like CPS. This paper will outline the state of the art and limits of current practice for formally verifying CPS and will identify possible research directions that require attention.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Evaluation of the Reconstruction Accuracy of the Ultrasound Model–Based Image Reconstruction (U-MBIR) Method for Concrete to Optimize Damage Detection

Reinforced concrete is a critical structural material used to construct nuclear power plants (NPPs). As such, its safety and performance must be thoroughly examined throughout the life cycle of the NPP infrastructure system. Ultrasonic measurements have been an industry standard for both surface and subsurface inspections. To support the development of these techniques, Oak Ridge National Laboratory (ORNL) has researched and developed advanced image reconstruction algorithms to capture internal damage. The results and discussion presented herein summarize the current state of the ultrasonic model–based iterative reconstruction (U-MBIR) algorithm developed at ORNL. In the work documented in this report, the U-MBIR methodology was applied to four sets of ultrasonic data collected from concrete specimens. The results demonstrate that the U-MBIR algorithm can successfully detect defects within the four concrete samples. The reconstruction images help identify the specimen thickness, regions of delamination, and location of rebar embedded within the concrete. The reconstruction images allow engineers and technicians to characterize the internal defects within concrete specimens and structural members. Ultimately, this knowledge can guide engineers in making informed decisions regarding the performance, safety, and reliability of structural materials (i.e., reinforced concrete) throughout the life cycle of NPPs.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Iterative subspace algorithms for finite-temperature solution of Dyson equation

One-particle Green’s functions obtained from the self-consistent solution of the Dyson equation can be employed in the evaluation of spectroscopic and thermodynamic properties for both molecules and solids. However, typical acceleration techniques used in the traditional quantum chemistry self-consistent algorithms cannot be easily deployed for the Green’s function methods because of a non-convex grand potential functional and a non-idempotent density matrix. Moreover, the optimization problem can become more challenging due to the inclusion of correlation effects, changing chemical potential, and fluctuations of the number of particles. In this paper, we study acceleration techniques to target the self-consistent solution of the Dyson equation directly. We use the direct inversion in the iterative subspace (DIIS), the least-squared commutator in the iterative subspace (LCIIS), and the Krylov space accelerated inexact Newton method (KAIN). We observe that the definition of the residual has a significant impact on the convergence of the iterative procedure. Based on the Dyson equation, we generalize the concept of the commutator residual used in DIIS and LCIIS and compare it with the difference residual used in DIIS and KAIN. The commutator residuals outperform the difference residuals for all considered molecular and solid systems within both GW and GF2. For a number of bond-breaking problems, we found that an easily obtained high-temperature solution with effectively suppressed correlations is a very effective starting point for reaching convergence of the problematic low-temperature solutions through a sequential reduction of temperature during calculations.

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

Symbol alphabets from plabic graphs

Symbol alphabets of n-particle amplitudes in N = 4 super-Yang-Mills theory are known to contain certain cluster variables of Gr(4, n) as well as certain algebraic functions of cluster variables. In this paper we suggest an algorithm for computing these symbol alphabets from plabic graphs by solving matrix equations of the form C ∙ Z = 0 to associate functions on Gr(m, n) to parameterizations of certain cells of Gr(k, n) indexed by plabic graphs. For m = 4 and n = 8 we show that this association precisely reproduces the 18 algebraic symbol letters of the two-loop NMHV eight-particle amplitude from four plabic graphs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Database-wide hazard modelling of the onset of DIII-D tearing modes with field features

The rate of onset (hazard) of tearing modes is modelled probabilistically using statistical learning algorithms. Axisymmetric energy-density equilibrium fields are taken as raw high-dimensional input features which are reduced with principal component analysis. Signal processing of non-axisymmetric magnetics fluctuation array data provides the target information from which to learn. Model selection, visualization and calibration assessment procedures are detailed. Here, the analysis is deployed at large scale across the DIII-D tokamak database. Standard model selection criteria suggest that the energy-density post-processed feature is a better choice for modelling the onset rate compared to the non-processed equilibrium reconstruction solution. Two example applications of the learned rate function are demonstrated: (i) proximity-to-onset discharge monitoring and (ii) database analysis showing an (expected) observational global trend that the general hazard increases as a plasma performance metric increases. An important connection between the hazard function and its use as a conditional probability generator is reviewed in the Appendix.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗