Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computing 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 1,243 records · Page 69

Extreme-scale stochastic optimization and simulation via learning-enhanced decomposition and parallelization (Final Technical Report)

Stochastic optimization and simulation models ubiquitously arise in designing and operating complex service/engineering systems. They can be extreme in scale due to high-dimensional data and decisions, and can also involve decisions made sequentially in response to newly revealed data, both causing significant computational challenge. The objective of this research is to explore a unified framework that integrates machine learning with discrete optimization and risk-averse modeling, to improve the efficiency of decomposition paradigms for stochastic optimization and simulations at extreme scale. The models we consider represent a broad class of complex decision-making problems, where 0-1 or continuous decisions are made before and/or after knowing multiple sources of uncertainties that could be correlated. We will employ machine learning methods to dynamically decide and prioritize computational procedures, including cut generation, branching, and bounding of the optimal objective. Furthermore, the research will shed new lights on the traditional decomposition algorithms for extreme-scale computing. Deliverables of the research include new modeling and computational methods for advancing the state-of-the-art research in optimization and simulation, bringing many relevant risk-averse, data-driven optimization problems in practice within the range of tractability. Examples include distributed computing server scheduling and sensor deployment for monitoring critical infrastructures. Success in this effort will enable progress in solving multiple extreme-scale problems in the complex system design and operations arising from DoE missions in energy, environment, and national security.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Rapid QSTS Simulations for High-Resolution Comprehensive Assessment of Distributed PV

The rapid increase in penetration of distributed energy resources on the electric power distribution system has created a need for more comprehensive interconnection modeling and impact analysis. Unlike conventional scenario-based studies, quasi-static time-series (QSTS) simulations can realistically model time-dependent voltage controllers and the diversity of potential impacts that can occur at different times of year. However, to accurately model a distribution system with all its controllable devices, a yearlong simulation at 1-second resolution is often required, which could take conventional computers a computational time of 10 to 120 hours when an actual unbalanced distribution feeder is modeled. This computational burden is a clear limitation to the adoption of QSTS simulations in interconnection studies and for determining optimal control solutions for utility operations. The solutions we developed include accurate and computationally efficient QSTS methods that could be implemented in existing open-source and commercial software used by utilities and the development of methods to create high-resolution proxy data sets. This project demonstrated multiple pathways for speeding up the QSTS computation using new and innovative methods for advanced time-series analysis, faster power flow solvers, parallel processing of power flow solutions and circuit reduction. The target performance level for this project was achieved with year-long high-resolution time series solutions run in less than 5 minutes within an acceptable error.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Grand canonical inverse design of multicomponent colloidal crystals

Inverse design methods are powerful computational approaches for creating colloidal systems which self-assemble into a target morphology by reverse engineering the Hamiltonian of the system. Despite this, these optimization procedures tend to yield Hamiltonians which are too complex to be experimentally realized. An alternative route to complex structures involves the use of several different components, however, conventional inverse design methods do not explicitly account for the possibility of phase separation into compositionally distinct structures. We present an inverse design scheme for multicomponent colloidal systems by combining active learning with a method to directly compute their ground state phase diagrams. This explicitly accounts for phase separation and can locate stable regions of Hamiltonian parameter space which grid-based surveys are prone to miss. Using this we design low-density, binary structures with Lennard-Jones-like pairwise interactions that are simpler than in the single component case and potentially realizable in an experimental setting. This reinforces the concept that ground states of simple, multicomponent systems might be rich with previously unappreciated diversity, enabling the assembly of non-trivial structures with only few simple components instead of a single complex one.

36 MATERIALS SCIENCE↗

Sequential Monte Carlo for Cut-Bayesian Posterior Computation

We propose a sequential Monte Carlo (SMC) method to efficiently and accurately compute cut-Bayesian posterior quantities of interest, variations of standard Bayesian approaches constructed primarily to account for model misspecification. We prove finite sample concentration bounds for estimators derived from the proposed method along with a linear tempering extension and apply these results to a realistic setting where a computer model is misspecified. We then illustrate the SMC method for inference in a modular chemical reactor example that includes submodels for reaction kinetics, turbulence, mass transfer, and diffusion. The samples obtained are commensurate with a direct-sampling approach that consists of running multiple Markov chains, with computational efficiency gains using the SMC method. Overall, the SMC method presented yields a novel, rigorous approach to computing with cut-Bayesian posterior distributions.

97 MATHEMATICS AND COMPUTING↗

A Comparison of Machine Learning Methods of Association Tested on Dense Nodal Arrays

The association of phase picks to form events is one of the fundamental components of seismology. Large and dense sensor networks, such as >1000 geophone arrays (and distributed acoustic sensing), offer unique challenges in association due to the vast numbers of observations and high likelihood of errant picks. In addition, the large number of stations can greatly increase the time it takes to perform the association. For this reason, machine learning (ML) methods might provide a more optimal method of association for such networks. In this work, we examine how well ML methods (e.g., Gaussian mixture model association, PhaseLink, and Graph Earthquake Neural Interpretation Engine) can incorporate dense seismic arrays into regional networks and how well they handle the increasing numbers of stations. Here, we test their capabilities on two dense seismic deployments, one within Rock Valley Nevada (52 nodes and a 9-station sparse local network), and the LArge-n Seismic Survey in Oklahoma dense nodal array (>1800 vertical-component geophones). Processing data from these two different styles of dense seismic deployments allows testing of how the ML algorithms can merge array data with a broader regional network, how they deal with poorly picked phases, and how they handle anthropogenic noise. We compare the ML-associated bulletins to those obtained using the Rapid Earthquake Association and Location algorithm, a more traditional method of association. We find that there are very small differences in results between the methods for small networks (<100 stations) with low pick rates. For large networks (>1000), there are enough errant picks that some of the ML methods start to create false events out of noise. We also find that the ML methods vary in computation time significantly but are all faster than the traditional method tested here.

58 GEOSCIENCES↗

Advanced Modeling and Simulation Methods for Evaluation of Thermal Neutron Scattering Materials

With the rise of interest in thermal neutron scattering data for advanced reactor, criticality safety, and shielding applications, new experimental data are required for evaluation of new materials or for re-evaluation (or validations) of previously evaluated materials. New experimental data are evaluated in a three-step process: (1) computing the phonon characteristics, (2) computing the dynamic structure factor (DSF) from the data, and (3) using the experimental setup to simulate the experimental data. All three steps have challenges, ranging from the need for a sufficiently general material simulation code—a processing code that can compute the corresponding DSF—to having a detailed layout of the instrument/beamline/facility where the data were measured. Whereas phonon characteristics of materials can be computed using various methods (molecular dynamics, density functional theory, etc.), a high-fidelity computation of the DSF and the simulation of the experiment based on the DSF is vital to the accuracy of the evaluation. The latter two steps can be achieved by using the two corresponding code systems developed by instrument scientists at the Spallation Neutron Source (SNS) at Oak Ridge National Laboratory: (1) OCLIMAX, a program that calculates the dynamic structure factor from DFT and MD simulation results, and (2) MCViNE, a Monte Carlo neutron ray-tracing program designed to simulate neutron scattering experiments. Recently, polyethylene and yttrium hydride were measured at the Wide Angular-Range Chopper (ARCS) and SEQUOIA instrument stations of the SNS. These experiments are simulated using the density functional theory code, the Cambridge Serial Total Energy Package (CASTEP), to compute its phonon characteristics (eigenvalues/vectors and PDOS), which is then processed using OCLIMAX to yield the DSF, and finally the data at each instrument station are simulated by the MCViNE for comparison to the measured data for evaluation. For comparison to conventional evaluation methods, the scattering data processed from OCLIMAX are compared against those processed from the LEAPR module of NJOY, and the results from MCViNE simulations are compared against previously used simplified beamline models implemented in the Monte Carlo N-Particle (MCNP) code.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Using 2.5D super-resolution to improve flaw detection in metal additive manufacturing parts

Industrial X-ray computed tomography (XCT) enables non-destructive inspection of additively manufactured (AM) parts, but high-resolution scanning requires long acquisition times and significant computational resources, limiting throughput in production environments. Super-resolution techniques can recover high-resolution information from low-resolution scans, but existing methods face a trade-off between 2D approaches that ignore inter-slice information and 3D methods that are computationally prohibitive for practical deployment. To address this trade-off, we propose a 2.5D deep learning-based super-resolution approach that uses seven neighbouring low-resolution slices to super-resolve the centre slice. This work evaluates the method on real XCT scans of steel AM parts, comparing reconstruction quality and flaw detection performance of 2D, 2.5D, and 3D ESRGAN-based super-resolution methods. Results demonstrate that 2.5D super-resolution significantly improves detection of small, process-induced flaws (e.g. porosity) compared to 2D methods, while avoiding the prohibitive computational burden of full 3D approaches. These findings provide initial evidence of 2.5D super-resolution as a practical, deployable solution for improving flaw detection in high-throughput industrial XCT inspection.

X-ray CT↗

Quantifying spatiotemporal variability in occupant exposure to an indoor airborne contaminant with an uncertain source location

Well-mixed zone models are often employed to compute indoor air quality and occupant exposures. While effective, a potential downside to assuming instantaneous, perfect mixing is underpredicting exposures to high intermittent concentrations within a room. When such cases are of concern, more spatially resolved models, like computational-fluid dynamics methods, are used for some or all of the zones. But, these models have higher computational costs and require more input information. A preferred compromise would be to continue with a multi-zone modeling approach for all rooms, but with a better assessment of the spatial variability within a room. Here to do so, we present a quantitative method for estimating a room's spatiotemporal variability, based on influential room parameters. Our proposed method disaggregates variability into the variability in a room's average concentration, and the spatial variability within the room relative to that average. This enables a detailed assessment of how variability in particular room parameters impacts the uncertain occupant exposures. To demonstrate the utility of this method, we simulate contaminant dispersion for a variety of possible source locations. We compute breathing-zone exposure during the releasing (source is active) and decaying (source is removed) periods. Using CFD methods, we found after a 30 minutes release the average standard deviation in the spatial distribution of exposure was approximately 28% of the source average exposure, whereas variability in the different average exposures was lower, only 10% of the total average. We also find that although uncertainty in the source location leads to variability in the average magnitude of transient exposure, it does not have a particularly large influence on the spatial distribution during the decaying period, or on the average contaminant removal rate. By systematically characterizing a room's average concentration, its variability, and the spatial variability within the room important insights can be gained as to how much uncertainty is introduced into occupant exposure predictions by assuming a uniform in-room contaminant concentration. We discuss how the results of these characterizations can improve our understanding of the uncertainty in occupant exposures relative to well-mixed models.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Preparation of excited states for nuclear dynamics on a quantum computer

We study two different methods to prepare excited states on a quantum computer, a key initial step to study dynamics within linear response theory. The first method uses unitary evolution for a short time T = O(√1 - F) to approximate the action of an excitation operator Ô with fidelity F and success probability P ≈ 1 – F. The second method probabilistically applies the excitation operator using the Linear Combination of Unitaries (LCU) algorithm. We benchmark these techniques on emulated and real quantum devices, using a toy model for thermal neutron-proton capture. Despite its larger memory footprint, the LCU-based method is efficient even on current generation noisy devices and can be implemented at a lower gate cost than a naive analysis would suggest. Here, these findings show that quantum techniques designed to achieve good asymptotic scaling on fault tolerant quantum devices might also provide practical benefits on devices with limited connectivity and gate fidelity.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Cardinal: Seismic and Geoacoustic Array Processing

Data collected via seismic and infrasound array deployments are leveraged in the geosciences to detect and characterize a myriad of natural and anthropogenic sources. These deployments consist of numerous sensors placed in a predetermined configuration to amplify signal strength and improve the efficacy of array processing techniques used to measure signal directionality and waveform coherence. High‐fidelity feature extraction is often predicated on interstation distance as well as the frequency content and wavelength of an incident signal. Numerous array processing softwares analyze data in sequential frequency bands to obtain a more detailed characterization of a signal. However, current algorithms are limited in their ability to determine optimal array configuration for each band. We introduce an open‐source Python code, called Cardinal, to process seismic and infrasound array data in discretized time–frequency space with the option of applying an adaptive array design to determine optimal subarray configuration for each frequency band. To reduce computational time, the array processing step can be run in parallel using multithreading. Furthermore, the software has the capability to aggregate array processing results from different time–frequency pixels to produce separate sets of detections, or families, with added utility via the application of an adaptive semblance threshold, which aids in isolating signals‐of‐interest from coherent background noise. Upon appropriate configuration, Cardinal exhibits the potential to combine distinct seismic and infrasound phases into separate families.

Adaptive Array↗

Capturing Surface Coverage Effects in Heterogeneous Catalysis

Adsorbate–adsorbate lateral interactions at relevant surface coverages have a significant effect on chemical kinetics, thereby influencing the activity of a heterogeneous catalyst. Coverage-dependent kinetic and thermodynamic parameters therefore must be included in studies of such complex systems to properly predict the turnover frequencies and kinetic trends. Thus, it becomes extremely important to accurately capture the strength of lateral interactions between neighboring species under realistic reaction conditions. In this Perspective, we discuss the various existing computational and experimental methods for determining adspecies coverage and configurational effects. The choice of the tools and methods employed in such studies depends on factors such as time, length scales, computational cost, the presence of solvents, and reaction conditions. The applications of each method and the respective challenges are also discussed here. As a result, we discuss the recent developments and future of the state-of-the-art for inclusion of surface coverage and configuration into a holistic picture for accurate predictions of catalytic behavior.

09 BIOMASS FUELS↗

Pseudospectral convex optimization for on-ramp merging control of connected vehicles

It can be a daunting task for human drivers to merge into highways because of the intricate vehicle negotiations and potential risk within limited time and space. Connected vehicle (CV) technologies could be a solution to this problem and offer many benefits to the road safety, traffic mobility, and energy efficiency. However, real-time optimal control of CVs is still an open challenge, due to the nonlinear vehicle dynamics, non-convex fuel consumption model, and highly dynamic uncertain inter-vehicle interactions. To tackle these issues, a novel real-time optimal control approach that balances the computational efficiency and solution optimality is proposed for the purpose of onboard application. To this end, the pseudospectral collocation method is integrated with a sequential convex programming approach to develop two new optimization algorithms, which are implemented within a model predictive control (MPC) framework to allow for real-time generation of optimal merging speed profiles. One algorithm leverages the line search technique to improve convergence, and the other benefits from the trust region method for better computational efficiency. The optimality and convergence process of both proposed algorithms are investigated by comparing their solutions with a popular non-linear solver. Furthermore, simulation results show that the proposed methods outperform the benchmark in terms of computational cost, fuel consumption, and traffic efficiency. In particular, the proposed fuel-economy merging rule can save 57.1% fuel consumption on average on four different traffic volumes. Meanwhile, the proposed optimal control algorithms can reduce 2.2% travel time on average comparing to the “first-in-first-out” merging rule.

33 ADVANCED PROPULSION SYSTEMS↗

Robust Measurements of n -Point Correlation Functions of Driven-Dissipative Quantum Systems on a Digital Quantum Computer

We propose and demonstrate a unified hierarchical method to measure n -point correlation functions that can be applied to driven, dissipative, or otherwise open or nonequilibrium quantum systems. In this method, the time evolution of the system is repeatedly interrupted by interacting an ancilla qubit with the system through a controlled operation, and measuring the ancilla immediately afterward. We discuss the robustness of this method as compared to other ancilla-based interferometric techniques (such as the Hadamard test), and highlight its advantages for near-term quantum simulations of open quantum systems. We implement the method on a quantum computer in order to measure single-particle Green’s functions of a driven-dissipative fermionic system. This Letter shows that dynamical correlation functions for driven-dissipative systems can be robustly measured with near-term quantum computers. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Suppressing Quantum Circuit Errors Due to System Variability

We present a quantum circuit optimization technique that takes into account the variability in error rates that is inherent across present-day noisy quantum computing platforms. This method can be run after qubit routing or postcompilation and consists of computing isomorphic subgraphs to input circuits and scoring each using heuristic cost functions derived from system calibration data. Using an independent standard algorithmic test suite, we show that it is possible to recover on average nearly 40% of missing fidelity using better qubit selection via efficient to compute cost functions. We demonstrate additional performance gains by considering qubit placement over multiple quantum processors. The overhead from these tools is minimal with respect to other compilation steps, such as qubit routing, as the number of qubits increases. As such, our method can be used to find qubit mappings for problems at the scale of quantum advantage and beyond.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TAMM: Tensor algebra for many-body methods

Tensor algebra operations such as contractions in computational chemistry consume a significant fraction of the computing time on large-scale computing platforms. The widespread use of tensor contractions between large multi-dimensional tensors in describing electronic structure theory has motivated the development of multiple tensor algebra frameworks targeting heterogeneous computing platforms. In this paper, we present Tensor Algebra for Many-body Methods (TAMM), a framework for productive and performance-portable development of scalable computational chemistry methods. TAMM decouples the specification of the computation from the execution of these operations on available high-performance computing systems. With this design choice, the scientific application developers (domain scientists) can focus on the algorithmic requirements using the tensor algebra interface provided by TAMM, whereas high-performance computing developers can direct their attention to various optimizations on the underlying constructs, such as efficient data distribution, optimized scheduling algorithms, and efficient use of intra-node resources (e.g., graphics processing units). The modular structure of TAMM allows it to support different hardware architectures and incorporate new algorithmic advances. We describe the TAMM framework and our approach to the sustainable development of scalable ground- and excited-state electronic structure methods. We present case studies highlighting the ease of use, including the performance and productivity gains compared to other frameworks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Comparison of Shape Optimization Methods for Heat Exchanger Fins Using Computational Fluid Dynamics

Inverse design techniques are one way to leverage advances in 3D printing, artificial intelligence, and computational resources to achieve increased performance of heat exchangers. Two optimization techniques (genetic algorithm and particle swarm) and three geometry representations (binary level set, composite Bézier, and free form deformation) are used to increase the heat transfer and reduce the pressure drop of a heat exchanger fin. After running 210,810 OpenFOAM simulations, results indicate that a significant performance increase of the fin can be realized in less than 48 hrs, allowing for such a process to be integrated in traditional design processes. The best design increased the performance of the objective function, compared to the baseline rectangular geometry by 75%. A custom distributed infrastructure was built, allowing for all methods to reach 95% of the final objective values in a little over 4 hrs, handling 1674 OpenFoam simulations per hour.

42 ENGINEERING↗

Shape Optimization for Control and Isolation of Structural Vibrations in Aerospace and Defense Applications

Among the main challenges in shape optimization is the coupling of Finite Element Method (FEM) codes in a way that facilitates efficient computation of shape derivatives. This is particularly difficult with multi-physics problems involving legacy codes, where the costs of implementing and maintaining shape derivative capabilities are prohibitive. There are two mathematically equivalent approaches to computing the shape derivative: the volume method, and the boundary method. Each has a major drawback: the boundary method is less accurate, while the volume method is more invasive to the FEM code. Prior implementations of shape derivatives at Sandia have been based on the volume method. We introduce the strip method, which computes shape derivatives on a strip adjacent to the boundary. The strip method makes code coupling simple. Like the boundary method, it queries the state and adjoint solutions at quadrature nodes, but requires no knowledge of the FEM code implementations. At the same time, it exhibits the higher accuracy of the volume method. The development of the strip method also offers us the opportunity to share some lessons learned about implementing the volume method and boundary method, to show shape optimization results on problems of interest, and to begin addressing the other main challenges at hand: constraints on optimized shapes, and their interplay with optimization algorithms.

97 MATHEMATICS AND COMPUTING↗

An uncertainty quantification method relevant to material test reactors

Within material test reactor calculations, energy dependent flux and reaction rate uncertainties are typically not quantified when performing as-run analyses to determine the neutron field experienced by the experiment. When high fidelity Monte-Carlo codes are used in such analyses, straight forward methods to calculate output uncertainties are not available, instead expert opinion is used to postulate computational uncertainties. New methods to propagate uncertainties through these high fidelity simulations are available when sufficient computational power is available. A tool is developed here for sampling any part of an MCNP input from random distributions to determine output uncertainties based on those inputs. Another tool is developed to sample nuclear data cross-section in ACE format using multi-group nuclear data covariances. The Total Monte-Carlo Method and Gesellschaft für Anlagen-und Reaktorsicherheit method (GRS) are implemented and compared to one another as well as MCNP sensitivity and uncertainty calculations. The methods were applied to the Godiva critical sphere k-eigenvalue, the UAM pin-cell benchmark energy dependent flux and reaction rates, and the Advanced Test Reactor energy dependent flux within an experimental location. Furthermore, the two methods agree well, with GRS allowing for an order of magnitude speedup for reaction rate uncertainty calculations and several orders of magnitude for eigenvalue uncertainty calculations.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗