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 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Identifying and tracking bubbles and drops in simulations: A toolbox for obtaining sizes, lineages, and breakup and coalescence statistics

Knowledge of bubble and drop size distributions in two-phase flows is important for characterizing a wide range of phenomena, including combustor ignition, sonar communication, and cloud formation. The physical mechanisms driving the background flow also drive the time evolution of these distributions. Accurate and robust identification and tracking algorithms for the dispersed phase are necessary to reliably measure this evolution and thereby quantify the underlying mechanisms in interface-resolving flow simulations. The identification of individual bubbles and drops traditionally relies on an algorithm used to identify connected regions. This traditional algorithm can be sensitive to the presence of spurious structures. A cost-effective refinement is proposed to maximize volume accuracy while minimizing the identification of spurious bubbles and drops. An accurate identification scheme is crucial for distinguishing bubble and drop pairs with large size ratios. The identified bubbles and drops need to be tracked in time to obtain breakup and coalescence statistics that characterize the evolution of the size distribution, including breakup and coalescence frequencies, and the probability distributions of parent and child bubble and drop sizes. An algorithm based on mass conservation is proposed to construct bubble and drop lineages using simulation snapshots that are not necessarily from consecutive time steps. These lineages are then used to detect breakup and coalescence events, and obtain the desired statistics. Accurate identification of large-size-ratio bubble and drop pairs enables accurate detection of breakup and coalescence events over a large size range. Accurate detection of successive breakup and coalescence events requires that the snapshot interval be an order of magnitude smaller than the characteristic breakup and coalescence times to capture these successive events while minimizing the identification of repeated confounding events. Together, these algorithms serve as a toolbox for detailed analysis of two-phase simulations, and enable insights into the mechanisms behind bubble and drop formation and evolution in flows of practical importance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Exponentially Reduced Circuit Depths Using Trotter Error Mitigation

Product formulas are a popular class of digital quantum simulation algorithms due to their conceptual simplicity, low overhead, and performance, which often exceeds theoretical expectations. Recently, Richardson extrapolation and polynomial interpolation have been proposed to mitigate the Trotter error incurred by the use of these formulas. This work provides a rigorous, general analysis of these techniques for computing time-evolved observables, simplifying the interpolation algorithm in the process, and shows that extrapolation generically improves the performance of product formulas for this task. We demonstrate that, to achieve error 𝜖 in a simulation of time 𝑇 using a 𝑝 ⁢th-order product formula with extrapolation, circuit depths of 𝑂⁡(𝑇 1+1/𝑝 ⁢polylog (1/𝜖)) are sufficient—an exponential improvement in the precision over product formulas alone. Furthermore, we prove that these algorithms achieve commutator scaling, and improve the 𝑇 complexity for the interpolation algorithm. By relaxing the requirement of performing exact Chebyshev interpolation, our simplified algorithm eliminates the need for fractional implementations of Trotter steps, reducing computational overhead. Finally, we show these techniques can be combined with the classical shadows method to estimate many time-evolved local observables. Taken together, our findings provide the strongest evidence yet for the utility of Trotter error-mitigation techniques in algorithmic applications.

quantum algorithms & computation↗
DOE OSTI2020

Temperature estimation in a spatially inhomogeneous flame by diode laser absorption spectroscopy

A two-temperature (2T) model is proposed for estimating the temperature of a spatially inhomogeneous hot zone using single-beam diode laser absorption spectrometry. The proposed algorithm is based on fitting experimental absorption spectra by a linear combination of two database-simulated single-temperature spectra with different temperatures. The model efficiency is experimentally demonstrated when determining the temperature in different flame zones of a Wolfgard – Parker slot burner. The proposed 2T algorithm is used to find the maximum and minimum temperatures in different flame sections, which are compared with local temperatures in the same flame zones measured by the method of coherent anti-Stokes Raman scattering (CARS). It is shown that the maximum temperatures determined by the proposed 2T algorithm are in good agreement with CARS data in flame zones where high-temperature regions prevail. A good agreement between the minimum temperatures obtained by these two methods is also observed for predominantly cold zones. (paper)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

ExTreeM: Scalable Augmented Merge Tree Computation via Extremum Graphs

Over the last decade merge trees have been proven to support a plethora of visualization and analysis tasks since they effectively abstract complex datasets. Here, this paper describes the ExTreeM-Algorithm: A scalable algorithm for the computation of merge trees via extremum graphs. The core idea of ExTreeM is to first derive the extremum graph G of an input scalar field f defined on a cell complex K, and subsequently compute the unaugmented merge tree of f on G instead of K; which are equivalent. Any merge tree algorithm can be carried out significantly faster on G, since K in general contains substantially more cells than G. To further speed up computation, ExTreeM includes a tailored procedure to derive merge trees of extremum graphs. The computation of the fully augmented merge tree, i.e., a merge tree domain segmentation of K, can then be performed in an optional post-processing step. All steps of ExTreeM consist of procedures with high parallel efficiency, and we provide a formal proof of its correctness. Our experiments, performed on publicly available datasets, report a speedup of up to one order of magnitude over the state-of-the-art algorithms included in the TTK and VTK-m software libraries, while also requiring significantly less memory and exhibiting excellent scaling behavior.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

MrHyDE v.1.0

SAND2024-01324O MrHyDE, which stands for Multi-resolution Hybridized Differential Equations, is a general-purpose C++ package for the solution of coupled multiphysics and multiscale systems on massively parallel computing systems. MrHyDE is designed to enable moving beyond forward simulation for multiscale applications which includes optimization, control, uncertainty quantification, and stochastic inversion. The framework provides interfaces to several packages within the Trilinos framework and leverages automatic differentiation to enable adjoint capabilities for large-scale, gradient-based optimization. MrHyDE provides automated multiscale capabilities through a subgrid model interface and multiscale Dirichlet-to-Neumann maps. For extreme-scale applications, MrHyDE provides in situ data-compression algorithms to reduce memory requirements while maintaining performance. MrHyDE is a general-purpose, computational framework for the solution of multiscale and multiphysics applications. It uses a combination of structure-preserving, physics-compatible discretizations, fully implicit methods, multi-resolution schemes, or fully explicit methods. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

SciDAC↗
DOE OSTI2021

Proof-of-concept of a reinforcement learning framework for wind farm energy capture maximization in time-varying wind

Here, we present a proof-of-concept distributed reinforcement learning framework for wind farm energy capture maximization. The algorithm we propose uses Q-Learning in a wake-delayed wind farm environment and considers time-varying, though not yet fully turbulent, wind inflow conditions. These algorithm modifications are used to create the Gradient Approximation with Reinforcement Learning and Incremental Comparison (GARLIC) framework for optimizing wind farm energy capture in time-varying conditions, which is then compared to the FLOw Redirection and Induction in Steady State (FLORIS) static lookup table wind farm controller baseline.

17 WIND ENERGY↗
DOE OSTI2022

Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer

Abstract Realizing the potential of near-term quantum computers to solve industry-relevant constrained-optimization problems is a promising path to quantum advantage. In this work, we consider the extractive summarization constrained-optimization problem and demonstrate the largest-to-date execution of a quantum optimization algorithm that natively preserves constraints on quantum hardware. We report results with the Quantum Alternating Operator Ansatz algorithm with a Hamming-weight-preserving XY mixer (XY-QAOA) on trapped-ion quantum computer. We successfully execute XY-QAOA circuits that restrict the quantum evolution to the in-constraint subspace, using up to 20 qubits and a two-qubit gate depth of up to 159. We demonstrate the necessity of directly encoding the constraints into the quantum circuit by showing the trade-off between the in-constraint probability and the quality of the solution that is implicit if unconstrained quantum optimization methods are used. We show that this trade-off makes choosing good parameters difficult in general. We compare XY-QAOA to the Layer Variational Quantum Eigensolver algorithm, which has a highly expressive constant-depth circuit, and the Quantum Approximate Optimization Algorithm. We discuss the respective trade-offs of the algorithms and implications for their execution on near-term quantum hardware.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Pressurized-Water Reactor Core Design using Multi-Objective Plant Fuel Reload Optimization Platform

The United States (U.S.) Department of Energy (DOE) Light Water Reactor Sustainability (LWRS) Program Risk-Informed Systems Analysis (RISA) Pathway Plant Reload Optimization Project aims to develop an integrated, comprehensive framework offering an all-in-one solution for reload evaluations with a special focus on optimization of core design. The optimization of the fuel loading pattern is one of the most important considerations in reducing the amount of new fuel used in the core. Due to thousands of possible options of core configuration, finding optimal solutions is an unachievable task for a human. The Plant ReLoad Optimization (PRLO) platform which supports artificial-intelligence-based reactor core designing is now fully capable of handling realistic problems. The PRLO Platform development project aims to build a reactor core design tool that includes reactor safety and fuel performance analyses and uses artificial intelligence to support the optimization of core design solutions. The NSGA-II (Non-dominated Sorting Genetic Algorithm-II) optimizer was developed and tested within RAVEN (Risk Analysis and Virtual Environment) to handle many constraints by using an augmented objectives methodology. The demonstration was performed with constrained multi-objective optimization of a 17 × 17 pressurized-water reactor core loading patterns to minimize fuel cost and maximize fuel cycle length.

42 ENGINEERING↗
DOE OSTI2024

Determining the effects of U/Pu ratio on subsolidus phase transitions in U-Pu-Zr metallic fuel alloys

Here, ternary alloys consisting primarily of uranium, plutonium, and zirconium (U-Pu-Zr) are among the leading candidate fuel systems considered for fast spectrum nuclear reactors. Despite historical operation data from the testing of U-Pu-Zr rods in the Experimental Breeder Reactor-II, considerable uncertainty about the evolution of phases and microstructure across the ternary composition space exists. Due to sluggish kinetics and other difficulties in handling metal actinide specimens, quantitative measurements of phase-transitions in U-Pu-Zr alloys remain sparse in scientific literature, with most investigators reporting either phase-transition temperatures or phase identification data, but not both from the same specimens. The purpose of this paper is to critically compare experimental and calculated phase transition data and correlate with the microstructure and phase characterization data of as-cast and annealed U-Pu-Zr alloys. Phase transition peaks were measured using differential scanning calorimetry in the subsolidus regions (723-948 K) of three ternary U-Pu-Zr alloys with the same zirconium concentration but various U/Pu ratios. Overlapping peaks were deconvoluted using a Frazier-Suzuki peak fitting algorithm, and the critical peak temperatures and enthalpies were calculated. In general, increasing concentrations of Pu were associated with enhanced thermal stability of the body-centered cubic γ phase upon both heating and cooling. Experimental phase transition temperatures in this study tended to agree well with the predictions of the established ternary phase diagrams and other reported phase transition temperatures in literature. Additionally, the TAF-ID thermodynamic database was used to calculate a U-Pu-40 at.% Zr pseudobinary diagram as well as ternary diagrams from 773 to 973 K. The equilibrium phase transition temperatures tended to be considerably lower than measured peak temperatures upon both heating and cooling. Recommendations for improving the quality of data in future U-Pu-Zr characterization studies are also discussed.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2025

MHD, disruptions and control physics: Chapter 4 of the special issue: on the path to tokamak burning plasma operation

In this chapter, we review the progress in MHD stability, disruptions and control in magnetic fusion research that has occurred over the past (more than) one and a half decades since the publication by Hender et al in 2007 on the same topic as part of the update of ITER Physics Basis. During this period, remarkable progress has been achieved in the understanding of the basic physics and overall control of MHD instabilities through a wide spectrum of dedicated experiments, theory and modeling. The sawtooth activities are probably today one of the best understood of MHD events and very robust control schemes have been developed for reliable operation of tokamaks through core heating. Similarly, significant improvements have been achieved in understanding and control of neoclassical tearing modes, resistive wall modes or locked modes and their control through ECCD or error field control. The field of disruption prediction through application of artificial intelligence, machine learning or deep learning methods, which had already started at the time of the 2007 review, has progressed significantly due to general progress in these fields and application of newer, more sophisticated algorithms. However, although remarkable progress has been achieved in the field of Disruptions, their understanding, prediction, possible avoidance and mitigation still remain probably the most active fields of R&D globally in this field. This is especially because reactor grade machines like ITER and DEMO will be much less tolerant in respect of disruptions and runaway currents, and their occurrences must be either avoided altogether or minimized to an acceptable value without causing any significant hindrance to robust machine operations. This review is intended to present a broad spectrum of the R&D that has occurred in this field in support of ITER, which will also be of immense significance for all future machines, especially reactors like DEMO.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Semi-supervised Learning of Dynamical Systems with Neural Ordinary Differential Equations: A Teacher-Student Model Approach

Modeling dynamical systems is crucial for a wide range of tasks, but it remains challenging due to complex nonlinear dynamics, limited observations, or lack of prior knowledge. Recently, data-driven approaches such as Neural Ordinary Differential Equations (NODE) have shown promising results by leveraging the expressive power of neural networks to model unknown dynamics. However, these approaches often suffer from limited labeled training data, leading to poor generalization and suboptimal predictions. On the other hand, semi-supervised algorithms can utilize abundant unlabeled data and have demonstrated good performance in classification and regression tasks. We propose TS-NODE, the first semi-supervised approach to modeling dynamical systems with NODE. TS-NODE explores cheaply generated synthetic pseudo rollouts to broaden exploration in the state space and to tackle the challenges brought by lack of ground-truth system data under a teacher-student model. TS-NODE employs an unified optimization framework that corrects the teacher model based on the student's feedback while mitigating the potential false system dynamics present in pseudo rollouts. TS-NODE demonstrates significant performance improvements over a baseline Neural ODE model on multiple dynamical system modeling tasks.

Wang, Yu↗
DOE OSTI2025

PDF Entity Annotation Tool (PEAT)

While different text mining approaches – including the use of Artificial Intelligence (AI) and other machine based methods - continue to expand at a rapid pace, the tools used by researchers to create the labeled datasets required for training, modeling, and evaluation remain rudimentary. Labeled datasets contain the target attributes the machine is going to learn; for example, training an algorithm to delineate between images of a car or truck would generally require a set of images with a quantitative description of the underlying features of each vehicle type. Development of labeled textual data that can be used to build natural language machine learning models for scientific literature is not currently integrated into existing manual workflows used by domain experts. Published literature is rich with important information, such as different types of embedded text, plots, and tables that can all be used as inputs to train ML/natural language processing (NLP) models, when extracted and prepared in machine readable formats. Currently, both normalized data extraction of use to domain experts and extraction to support development of ML/NLP models are labor intensive and cumbersome manual processes. Automatic extraction of data and information from formats such as PDFs that are optimized for layout and human readability, not machine readability. The PDF (Portable Document Format) Entity Annotation Tool (PEAT) was developed with the goal of allowing users to annotate publications within their current print format, while also allowing those annotations to be captured in a machine-readable format. One of the main issues with traditional annotation tools is that they require transforming the PDF into plain text to facilitate the annotation process. While doing so lessens the technical challenges of annotating data, the user loses all structure and provenance that was inherent in the underlying PDF. Also, textual data extraction from PDFs can be an error prone process. Challenges include identifying sequential blocks of text and a multitude of document formats (multiple columns, font encodings, etc.). As a result of these challenges, using existing tools for development of NLP/ML models directly from PDFs is difficult because the generated outputs are not interoperable. We created a system that allows annotations to be completed on the original PDF document structure, with no plain text extraction. The result is an application that allows for easier and more accurate annotations. In addition, by including a feature that grants the user the ability to easily create a schema, we have developed a system that can be used to annotate text for different domain-centric schemas of relevance to subject matter experts. Different knowledge domains require distinct schemas and annotation tags to support machine learning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Confidence Assessment for Automatic Target Recognition

Confidence assessment is critical for effective automatic target recognition (ATR). Productive use and interpretation of ATR results by analysts or downstream algorithms requires not only algorithmic declarations of target presence and identity, but also algorithmic assessment of the certainty of those declarations in comparison to the certainties of alternative target-identity possibilities. Unfortunately, despite its importance, confidence assessment is an understudied, underdeveloped, and often-neglected function of ATR systems. This lack of regard stems not only from the difficulty of accurate algorithmic determination of target-identity certainty, but also from a general lack of understanding and careful consideration about what confidence should actually represent. We present a framework for confidence assessment that establishes a clear definition of confidence and provides a straightforward theoretical basis for its calculation. This framework is grounded in a hypothesis-theoretic consideration of ATR and it springs from from a handful of axiomatic principles concerning the nature and meaning of confidence in this context. This framework establishes a rigorous mathematical definition of confidence and it provides equations relating confidence to other information that is almost always provided by ATRs. We present an approach for computing confidence within this framework, using an advance process of ATR characterization followed by a simple computation at the time of ATR execution. We discuss practical difficulties with our approach, and we suggest methods for effective mitigation of these difficulties in implemented systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Radiation GRMHD Models of Accretion onto Stellar-mass Black Holes. I. Survey of Eddington Ratios

We summarize results from a survey of radiation-dominated black hole accretion flows across a wide range of mass accretion rates, as well as two values of black hole spin and initial magnetic field geometry. These models apply an algorithm targeting direct solutions to the radiation transport equation in full general relativity and have been enabled by access to modern exascale computing systems. Super-Eddington accretion flows form geometrically thick radiation-pressure-supported disks that drive powerful equatorial outflows. A narrow funnel-shaped photosphere in the inner region results in very low radiative efficiencies in this regime. The structure of near- and sub-Eddington accretion depends on whether there is net vertical magnetic flux at the midplane of the disk. With net flux, the disk forms a thin, dense layer at the midplane surrounded by a magnetically dominated corona, whereas without net flux, the disk remains magnetically dominated everywhere. Although none of our models achieve the magnetically arrested disk regime, those with net vertical flux and a rapidly spinning black hole still produce powerful relativistic jets. Our calculations adopt simple opacity models (with scalings appropriate to stellar-mass black hole accretion). We discuss the application of our results to observations of X-ray binaries and ultraluminous X-ray sources such as Cyg X-3 and SS433. We also speculate on the application of our super-Eddington models to the interpretation of little red dots recently discovered by JWST.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Fiber Bundle Morphisms as a Framework for Modeling Many-to-Many Maps

While it is not generally reflected in the `nice' datasets used for benchmarking machine learning algorithms, the real-world is full of processes that would be best described as many-to-many. That is, a single input can potentially yield many different outputs (whether due to noise, imperfect measurement, or intrinsic stochasticity in the process) and many different inputs can yield the same output (that is, the map is not injective). For example, imagine a sentiment analysis task where, due to linguistic ambiguity, a single statement can have a range of different sentiment interpretations while at the same time many distinct statements can represent the same sentiment. When modeling such a multivalued function $f: X \rightarrow Y$, it is frequently useful to be able to model the distribution on $f(x)$ for specific input $x$ as well as the distribution on fiber $f^{-1}(y)$ for specific output $y$. Such an analysis helps the user (i) better understand the variance intrinsic to the process they are studying and (ii) understand the range of specific input $x$ that can be used to achieve output $y$. Following existing work which used a fiber bundle framework to better model many-to-one processes we describe how morphisms of fiber bundles provide a template for building models which naturally capture the structure of many-to-many processes.

Coda, Elizabeth D.↗
DOE OSTI2024

Multi deep learning-based stochastic microstructure reconstruction and high-fidelity micromechanics simulation of time-dependent ceramic matrix composite response

A multi deep learning-based framework is developed for efficient, automated microstructure reconstruction and generation of stochastic representative volume elements (SRVEs) with periodic boundary conditions (PBCs) for accurate modeling of ceramic matrix composite (CMC) response. The methodology comprises a convolutional neural network coupled with regression layers to act as a vanilla regression network for semantic segmentation of the microstructure, allowing accurate characterization of the phases and their distributions at the microscale. Scanning electron microscope and confocal microscope are used to obtain C/SiNC and SiC/SiNC CMCs micrographs for vanilla regression testing. Microstructure variability in terms of fiber volume fraction and porosity are quantified through the output regression layer, ensuring accurate representation of material variability in SRVE construction. Generative adversarial network (GAN) and its variants are designed to produce high-fidelity SRVE, spanning CMCs microstructure variability space. A circular padding algorithm is developed to generate SRVEs with PBCs during training of GANs. The accuracy of the generated SRVEs is established through micromechanics simulations, where an efficient formulation of the high-fidelity generalized methods of cells (HFGMC) approach is used to compute the effective mechanical properties. Furthermore, an iterative algorithm is implemented in the HFGMC solver to simulate time-dependent deformation of SiC/SiNC subjected to creep loading conditions.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Quantum computational phase transition in combinatorial problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Hybrid deep learning architecture for general disruption prediction across tokamaks

In this paper, we present a new deep learning disruption prediction algorithm based on important findings from explorative data analysis which effectively allows knowledge transfer from existing devices to new ones, thereby predicting disruptions using very limited disruptive data from the new devices. Here, the explorative data analysis conducted via unsupervised clustering techniques confirms that time-sequence data are much better separators of disruptive and non-disruptive behavior than the instantaneous plasma state data with further advantageous implications for a sequence-based predictor. Based on such important findings, we have designed a new algorithm for multi-machine disruption prediction that achieves high predictive accuracy on the C-Mod (AUC=0.801), DIII-D (AUC=0.947) and EAST (AUC=0.973) tokamaks with limited hyperparameter tuning. Through numerical experiments, we show that boosted accuracy (AUC=0.959) is achieved on EAST predictions by including in the training only 20 disruptive discharges, thousands of non-disruptive discharges from EAST, and combining this with more than a thousand discharges from DIII-D and C-Mod. The improvement of predictive ability obtained by combining disruptive data from other devices is found to be true for all permutations of the three devices. Furthermore, by comparing the predictive performance of each individual numerical experiment, we find that non-disruptive data are machine-specific while disruptive data from multiple devices contain device-independent knowledge that can be used to inform predictions for disruptions occurring on a new device.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗