Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Discretization error”

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 343 records · Page 19

NRC Multiphysics Analysis Capability Deployment FY2020 - Part 4

This report details progress and activities of Idaho National Laboratory (INL) on the Nuclear Regulatory Commission (NRC) project “Development and Modeling Sup- port for Advanced Non-Light Water Reactors.” The tasks completed for this report are: • Task 3a: This task demonstrates the effectiveness of Griffin’s methods for interpolating cross sections and SPH correction factors as a function of control drum rotation. The Monte Carlo code Serpent is used to generate reference results. The accuracy of Griffin-calculated eigenvalues and reaction rates are studied as a function of control drum rotation for cross section and SPH factor libraries of varying fidelity. Higher-fidelity libraries require less interpolation and are therefore inherently more accurate; however, they require more computational resources to create. Overall, Griffin is able to accurately model eigenvalue and reaction rates over the full range of drum rotation using a library generated from three to five discrete drum rotations for a particular microreactor design. • Task 3c: This preliminary task successfully demonstrates the performance of a coupled neutron-photon transport calculation with Griffin using the spherical harmonics approximation. The Griffin solutions are compared to reference solutions from the continuous energy Monte Carlo codes MCNP and Serpent. Furthermore, this work also demonstrates how to prepare the neutron and photon libraries using NJOY, MCNP, and Serpent with the latest ENDF/B-VIII data for 235 U and graphite. The Griffin total energy deposition in the active core region is calculated within 0.3% of the reference, but it degrades in the reflector regions with a maximum difference of -1.5%. Overall, the results look promising and future analysis should use an improved data stream and focus on determining the potential cancellation of error within each energy group.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Data-Driven Reduced-Order Modeling of Convective Heat Transfer in Porous Media

This work presents a data-driven Reduced-Order Model (ROM) for parametric convective heat transfer problems in porous media. The intrusive Proper Orthogonal Decomposition aided Reduced-Basis (POD-RB) technique is employed to reduce the porous medium formulation of the incompressible Reynolds-Averaged Navier–Stokes (RANS) equations coupled with heat transfer. Instead of resolving the exact flow configuration with high fidelity, the porous medium formulation solves a homogenized flow in which the fluid-structure interactions are captured via volumetric flow resistances with nonlinear, semi-empirical friction correlations. A supremizer approach is implemented for the stabilization of the reduced fluid dynamics equations. The reduced nonlinear flow resistances are treated using the Discrete Empirical Interpolation Method (DEIM), while the turbulent eddy viscosity and diffusivity are approximated by adopting a Radial Basis Function (RBF) interpolation-based approach. The proposed method is tested using a 2D numerical model of the Molten Salt Fast Reactor (MSFR), which involves the simulation of both clean and porous medium regions in the same domain. For the steady-state example, five model parameters are considered to be uncertain: the magnitude of the pumping force, the external coolant temperature, the heat transfer coefficient, the thermal expansion coefficient, and the Prandtl number. For transient scenarios, on the other hand, the coastdown-time of the pump is the only uncertain parameter. The results indicate that the POD-RB-ROMs are suitable for the reduction of similar problems. The relative L2 errors are below 3.34% for every field of interest for all cases analyzed, while the speedup factors vary between 54 (transient) and 40,000 (steady-state).

German, Péter (ORCID:0000000307285283)↗

Influence of twist pitch on hysteretic losses and transport J c in overpressure processed high J c Bi-2212 round wires

Abstract Bi-2212 is the only high field, high-temperature superconductor (HTS) available in the macroscopically isotropic, multifilament high J c round wire (RW) form capable of generating high uniformity fields with minimum-screening current errors. However, the heat treatment that enables impressively high J c (4.2 K, 30 T) values that can attain ∼5000 A mm −2 also produces significant filament bonding (bridging). Filament bridging appears to significantly enhance hysteretic losses of the filaments themselves by coupling neighboring, nominally independent filaments, enabling shielding currents to flow across multiple filaments as though they were one filament of much larger diameter. Wire twisting can be employed to reduce filament-to-filament eddy current coupling losses due to induced currents flowing across the matrix, but twisting is less effective in reducing increased losses from bridging. Here, we compare the twist-pitch dependence of the losses of overpressure processed (OP) high J c Bi-2212 RWs with partially bridged filaments to those found in OP Bi-2212 RWs with discrete, not-bridged filaments. We show that filament sub-bundles in standard, partially-bridged wires that have some superconducting connections between filaments can exhibit significant coupling (much larger effective filament diameter), but twisting still reduces their hysteretic losses to values close to or below the ITER Nb 3 Sn wire loss specification, even though Bi-2212 wires have significantly larger J c values. Although it has been reported that twisting can reduce wire J c by damaging filaments, we found no reduction in transport J c , even for nominal twist pitches of 12 mm in 0.8 mm diameter wires. Evaluation of more-recent, higher J c Engi-Mat powder wires showed that their reduced filament bridging and improved longitudinal connectivity significantly improved transport J c and reduced the J c normalized losses, signaling that J c can be further improved without commensurate increase in losses. This important result strengthens the argument for production of high field, low loss HTS magnets made with Bi-2212 RWs.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Adaptive Uncertainty Quantification for Stochastic Hyperbolic Conservation Laws

Here, we propose a predictor-corrector adaptive method for the study of hyperbolic partial differential equations (PDEs) under uncertainty. Constructed around the framework of stochastic finite volume (SFV) methods, our approach circumvents sampling schemes or simulation ensembles while also preserving fundamental properties, in particular hyperbolicity of the resulting systems and conservation of the discrete solutions. Furthermore, we augment the existing SFV theory with a priori convergence results for statistical quantities, in particular push-forward densities, which we demonstrate through numerical experiments. By linking refinement indicators to regions of the physical and stochastic spaces, we drive anisotropic refinements of the discretizations, introducing new degrees of freedom where deemed profitable. To illustrate our proposed method, we consider a series of numerical examples for nonlinear hyperbolic PDEs based on Burgers’ and Euler’s equations.

97 MATHEMATICS AND COMPUTING↗

An unstructured C-grid type variational formulation for the sea ice dynamics

Historically, B-grid formulations of sea ice dynamics have been dominant because they have matched the grid type used by ocean models. The reason for the grid match is simple – it facilitates penetration of the curl of ice-ocean stress into the deep ocean with minimal numerical diffusivity because sea ice and ocean velocity are co-located. In recent years, as ocean models have increasingly progressed to C-grids, sea ice models have followed suit on quadrilateral meshes, but the implementation of an unstructured C-grid sea ice models is new. We present an unstructured C-grid discretization of the Elastic Viscous Plastic (EVP) rheology, where the velocity unknowns are discretized at the edges of the mesh cells with n-sides, where typically n is greater than or equal to four, rather than at the vertices, as in the B-grid. Our framework of choice is the Model for Prediction Across Scales (MPAS) within E3SM, the climate model of the U.S. Department of Energy, although our approach is general and could be applied to other models as well. While MPAS-Seaice is currently defined on a B-grid, MPAS-Ocean runs on a C-grid, hence interpolation operators are heavily used when coupled simulations are performed. In this work, we describe a mathematical formulation to transition the dynamics of MPAS-Seaice to a C-grid, in order to ultimately facilitate the coupling with MPAS-Ocean and reduce numerical errors associated with this communication. Numerical results are reported to highlight the features of the method.

58 GEOSCIENCES↗

Exascale Multiphysics Nuclear Reactor Simulations for Advanced Designs

ENRICO is a coupled application developed under the U.S. Department of Energy's Exascale Computing Project (ECP) targeting the modeling of advanced nuclear reactors. It couples radiation transport with heat and fluid simulation, including the high-fidelity, highresolution Monte-Carlo code Shift and the Computational fluid dynamics code NekRS. NekRS is a highly-performant open-source code for simulation of incompressible and low-Mach fluid flow, heat transfer, and combustion with a particular focus on turbulent flows in complex domains. It is based on rapidly convergent high-order spectral element discretizations that feature minimal numerical dissipation and dispersion. State-of-the-art multilevel preconditioners, efficient high-order time-splitting methods, and runtime-adaptive communication strategies are built on a fast OCCA-based kernel library, libParanumal, to provide scalability and portability across the spectrum of current and future high-performance computing platforms. On Frontier, Nek5000/RS has recently achieved an unprecedented milestone in breaching over 1 billion spectral elements and 350 billion degrees of freedom. Shift has demonstrated the capability to transport upwards of 1 billion particles per second in full core nuclear reactor simulations featuring complete temperature-dependent, continuous-energy physics on Frontier. Shift achieved a weak-scaling efficiency of 97.8% on 8192 nodes of Frontier and calculated 6 reactions in 214,896 fuel pin regions below 1% statistical error yielding first-of-a-kind resolution for a Monte Carlo transport application.

Hamilton, Steven P.↗

Quantification of Physical and Numerical Mixing in a Coastal Ocean Model Using Salinity Variance Budgets

Numerical mixing, the spurious mixing primarily generated by the discretization of advection, is often significant in estuarine and coastal models due to sharp, energetic fronts. In this study, we compare on- and offline estimates of numerical mixing in a submesoscale-resolving realistic simulation of the ocean state over the Texas-Louisiana continental shelf. While offline estimates of numerical mixing differ from online estimates, offline methods may be the only analysis available. This study offers insight into the differences between the on- and offline methods. We use two methods to estimate numerical mixing offline, based on salinity squared $s^2$ and volume-mean salinity variance $s^{\prime^2}$. Numerical mixing estimated from the $s^{\prime^2}$ budget is generally within 60\% of the magnitude for the online method but captures the temporal variability well. However, the $s^2$ budget compares poorly due to larger truncation errors associated with the tendency and advection terms, which can be reduced by increasing the model output frequency. We also investigate the effects of horizontal resolution on numerical mixing using a two-way nested grid. The volume-integrated numerical mixing constitutes 57\% of the bulk physical mixing -- the mixing prescribed by the turbulence closure scheme -- in the coarse model and may exceed the physical mixing by half an order of magnitude. We find that numerical mixing is reduced by 35\% on average in the nested model, less than expected based on scaling of the numerical mixing for an upwind advection scheme, likely due to new dynamical processes that emerge in the nested simulation.

54 ENVIRONMENTAL SCIENCES↗

Practical Probabilistic Programming

Recent advances in probabilistic programming languages (PPLs) have provided the capability for exact inference: computing a closed-form probability distribution for a given probabilistic program. In particular, the new language Roulette uses a language oriented programming (LOP) approach, wherein analysts build new programming languages on top of a set of primitives provided by Roulette, which then translates these structures into a weighted model counting problem which can be solved by automated reasoning tools. However, because Roulette provides few convenience features, developing these new languages is challenging even for expert users. We developed a standard library of common probability functions for Roulette with the goal of improved usability. This included approximation of continuous probability density functions using discrete probability mass functions. We demonstrated this approach by modeling a cosmic ray striking a RAM controller. We found that Roulette provides a powerful interface for highly expressive probabilistic programs to be generated. In collaboration with the NNSA Advanced Simulation and Computing program, which resulted in development of a tool called Circulette, we were able to model complex circuits expressed in Verilog using probabilistic programs with an expressivity not previously possible. Our research question that motivated the development of a Roulette standard library was to determine whether non-experts could use a PPL to model relevant problems regarding radiation effects on microelectronics. This standard library improved the expressivity of Roulette by implementing common probability density functions, mathematical operators on distributions, and support for empirical distributions. While Roulette is a powerful modeling language, the untyped, LOP approach makes error messages difficult to understand and requires expert aid. We recommend further research on Roulette, especially with its error messages, to enable improved usability. At the same time, this project demonstrated that for users familiar with Roulette and the LOP approach, Roulette provides powerful new capabilities that can be integrated with other Sandia modeling capabilities.

97 MATHEMATICS AND COMPUTING↗

Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition

This report demonstrates satisfactory data compression of SOLPS-ITER simulation output ranging from 2D fields, 1D profiles, and 0D scalar variables with a novel matrix decomposition approach. The singular value decomposition (SVD) scales poorly for large matrix sizes and is unsuited to the application on high dimensional data common to fusion plasma physics simulation. In this work, we employ the columns-submatrix-rows (CUR) matrix factorization technique in order to compute a low-rank approximation up to two orders of magnitude faster than the SVD, but within a nominal L2-norm relative error of ε = 10 –2 . In addition, the CUR approach maintains the original format of the data, in its extracted columns and rows, allowing for interpretable data storage at the original resolution of the simulation. We utilize an iterative algorithm to compute the CUR decomposition of simulation output by maximizing the volume, or linearly independent information content, of a low-rank submatrix contained within the data. Experiments over $\textit{n} × \textit{n}$ randomized test matrices with embedded rank-deficient features show that this maximum volume implementation of CUR matrix approximation has reduced asymptotic computational complexity on the order of n compared to the SVD, which scales approximately as $n^3$. These results show that the CUR technique can be used to effectively select time step snapshots (columns) of over 140 SOLPS-ITER output variables and the associated discretized coordinate timeseries (rows) allowing for reconstruction of the complete simulation dynamics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Physics-Informed and Data-Driven Prediction of Residual Stress in Three-Dimensional Machining

Efficient and reliable prediction of machining-induced residual stress (RS) is a key requirement for truly integrated computational materials engineering (ICME). Currently available process modeling approaches, including empirical, analytical, and numerical methodologies lack predictive power and require substantial calibration and validation data. Moreover, most model-based approaches consider only two-dimensional (2D) (i.e., orthogonal), cutting processes. Meanwhile, industrial processes such as milling, turning, and drilling are inherently three-dimensional (3D). The present work attempts to bridge the gap between 2D and 3D through careful consideration of the process physics, including geometric, kinematic, and size-effect constraints to realize robust prediction of how RS develops in 3D machining. Using a novel in-situ experimental technique and digital image correlation (DIC) to determine equivalent Hertzian contact widths, contact pressures, and friction coefficients, the proposed methodology leverages a discretized conversion algorithm that includes multi-pass shakedown effects. This paper presents a semi-analytical model to predict machining-induced RS in 3D turning operations, which are used representatively for 3D processes more generally. Rather than follow a ‘brute force’ 3D FEM approach or conduct countless experiments to train a purely data-driven machine learning algorithm, the proposed approach builds on previous 2D modeling work. Through careful consideration of the process physics, including complex geometry/kinematic considerations of 3D turning, the authors demonstrated an experimentally calibrated approach, as well as validation based on published RS data. Model predictions and previously published measurement data of RS depth profiles for turning of Inconel 718 were compared for a range of process parameters. Correlation between the proposed 3D model and validation data was found to be within the margin of experimental error for most conditions. The proposed model appears to capture the overall behavior of 3D RS depth profiles with acceptable accuracy, particularly the key metrics of near-surface stress, peak stress magnitude and location, as well as overall stress profile depth. This report presents a physics-informed, data-driven approach for efficient calibration of a 2D model for machining-induced RS through DIC analysis of in-situ characterized subsurface displacement fields.

42 ENGINEERING↗

Fermion-bag inspired Hamiltonian lattice field theory for fermionic quantum criticality

Motivated by the fermion-bag approach, in this work we construct a new class of Hamiltonian lattice field theories that can help us to study fermionic quantum critical points, particularly those with four-fermion interactions. Although these theories are constructed in discrete time with a finite temporal lattice spacing ϵ, when ϵ → 0, conventional continuous-time Hamiltonian lattice field theories are recovered. The fermion-bag algorithms run relatively faster when ϵ = 1 as compared to ϵ → 0 but still allow us to compute universal quantities near the quantum critical point even at such a large value of ϵ. As an example of this new approach, here we study the $N_f$ = 1 Gross-Neveu chiral-Ising universality class in 2 + 1 dimensions by calculating the critical scaling of the staggered mass order parameter. We show that we are able to study lattice sizes up to 100 2 sites when ϵ = 1, while with comparable resources we can reach lattice sizes of only up to 64 2 when ϵ → 0. The critical exponents obtained in both these studies match within errors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Projecting the Thermal Response in a HTGR-Type System during Conduction Cooldown Using Graph-Laplacian Based Machine Learning

Accurate prediction of an off-normal event in a nuclear reactor is dependent upon the availability of sensory data, reactor core physical condition, and understanding of the underlying phenomenon. This work presents a method to project the data from some discrete sensory locations to the overall reactor domain during conduction cooldown scenarios similar to High Temperature Gas-cooled Reactors (HTGRs). The existing models for conductive cooldown in a heterogeneous multi-body system, such as an assembly of prismatic blocks or pebble beds relies on knowledge of the thermal contact conductance, requiring significant knowledge of local thermal contacts and heat transport possibilities across those contacts. With a priori knowledge of bulk geometry features and some discrete sensors, a machine learning approach was devised. The presented work uses an experimental facility to mimic conduction cooldown with an assembly of 68 cylindrical rods initially heated to 1200 K. High-fidelity temperature data were collected using an infrared (IR) camera to provide training data to the model and validate the predicted temperature data. The machine learning approach used here first converts the macroscopic bulk geometry information into Graph-Laplacian, and then uses the eigenvectors of the Graph-Laplacian to develop Kernel functions. Support vector regression (SVR) was implemented on the obtained Kernels and used to predict the thermal response in a packed rod assembly during a conduction cooldown experiment. The usage of SVR modeling differs from most models today because of its representation of thermal coupling between rods in the core. When trained with thermographic data, the average normalized error is less than 2% over 400 s, during which temperatures of the assembly have dropped by more than 500 K. The rod temperature prediction performance was significantly better for rods in the interior of the assembly compared to those near the exterior, likely due to the model simplification of the surroundings.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Propagating sample variance uncertainties in redshift calibration: simulations, theory, and application to the COSMOS2015 data

ABSTRACT Cosmological analyses of galaxy surveys rely on knowledge of the redshift distribution of their galaxy sample. This is usually derived from a spectroscopic and/or many-band photometric calibrator survey of a small patch of sky. The uncertainties in the redshift distribution of the calibrator sample include a contribution from shot noise, or Poisson sampling errors, but, given the small volume they probe, they are dominated by sample variance introduced by large-scale structures. Redshift uncertainties have been shown to constitute one of the leading contributions to systematic uncertainties in cosmological inferences from weak lensing and galaxy clustering, and hence they must be propagated through the analyses. In this work, we study the effects of sample variance on small-area redshift surveys, from theory to simulations to the COSMOS2015 data set. We present a three-step Dirichlet method of resampling a given survey-based redshift calibration distribution to enable the propagation of both shot noise and sample variance uncertainties. The method can accommodate different levels of prior confidence on different redshift sources. This method can be applied to any calibration sample with known redshifts and phenotypes (i.e. cells in a self-organizing map, or some other way of discretizing photometric space), and provides a simple way of propagating prior redshift uncertainties into cosmological analyses. As a worked example, we apply the full scheme to the COSMOS2015 data set, for which we also present a new, principled SOM algorithm designed to handle noisy photometric data. We make available a catalogue of the resulting resamplings of the COSMOS2015 galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗

The Effect of the Flux Separability Approximation on Multigroup Neutron Transport

The angular dependence of flux-weighted multigroup cross sections is commonly neglected when generating multigroup libraries. The error of this flux separability approximation is typically not isolated from other error sources due to a lack of availability of library generation and corresponding solvers that cannot relax this approximation. These errors can now be isolated and quantified with the availability of a multigroup Monte Carlo transport and multigroup library-generation capability in the OpenMC Monte Carlo transport code. This work will discuss relevant details of the OpenMC implementation, provide an example case useful for detailing the type of errors one can expect from making the flux separability approximation, and end with more realistic problems which show the impact of the approximation and highlight how it can strongly arise from an energy-dependent resonance absorption effect. Since the angle-dependence is intrinsically linked to the energy group structure, these examples also show that relaxing the flux separability approximation with angle-dependent cross sections could be used to reduce either the fine-tuning required to set a multigroup energy structure for a specific reactor type or the number of energy groups required to obtain a desired level of accuracy for a given problem. This trade-off could increase the costs of generating multigroup cross sections, and has the potential to require more memory for storing the multigroup library during the transport calculations, but it can significantly reduce the computational time required since the runtime of a discrete ordinates or method of characteristics neutron transport solver scales roughly linearly with the number of groups.

42 ENGINEERING↗

Fault Tolerant Decoding of QLDPC-GKP Codes with Circuit Level Soft Information

Concatenated bosonic-stabilizer codes have recently gained prominence as promising candidates for achieving low-overhead fault-tolerant quantum computing in the long term. In such systems, analog information obtained from the syndrome measurements of an inner bosonic code is used to inform decoding for an outer code layer consisting of a discrete-variable stabilizer code such as a surface code. The use of Quantum Low-Density Parity Check (QLDPC) codes as an outer code is of particular interest due to the significantly higher encoding rates offered by these code families, leading to a further reduction in overhead for large-scale quantum computing. Recent works have investigated the performance of QLDPC-GKP codes in detail, and the use of analog information from the inner code significantly boosts decoder performance. However, the noise models assumed in these works are typically limited to depolarizing or phenomenological noise. In this paper, we investigate the performance of QLDPC-GKP concatenated codes under circuit-level noise, based on a model introduced by Noh et al. in the context of the surface-GKP code. To demonstrate the performance boost from analog information, we investigate three scenarios: (a) decoding without soft information, (b) decoding with precomputed error probabilities but without real-time soft information, and (c) decoding with real-time soft information obtained from round-to-round decoding of the inner GKP code. Results show minimal improvement between (a) and (b), but a significant boost in (c), indicating that real-time soft information is critical for concatenated decoding under circuit-level noise. We also study the effect of measurement schedules with varying depths and show that using a schedule with minimum depth is essential for obtaining reliable soft information from the inner code.

Borah, Shantom K. [Arizona U. (main)]↗

Geometric Interpretation of the Cluster Location Problem Part I: Theory

We present a new framing of the seismic location problem using principles drawn from differential geometry. Our interpretation relies upon the common assumption that travel times observed across a network are continuous, differentiable functions of source location. In consequence, travel‐time functions constitute a differentiable map between the source region and a Riemannian manifold. The manifold is said to be the image of the source region embedded in a generally high‐dimension travel‐time vector space. A cluster of events in the source region has an image of discrete points on the manifold, that, except in the simplest cases, cannot be viewed directly. However, it is possible to project the image of a cluster into a tangent space of the manifold for direct visualization. The projection operator can be computed directly from the data without a velocity model, but produces a distorted rendering of the cluster geometry. With a model we can predict the distortions and correct them to estimate cluster geometry. We develop these points with the simplest possible example, one for which direct visualization of the manifold is possible, using the example as an introduction to the relevant concepts from differential geometry in a familiar setting. The tangent space, a local linearization of the manifold, plays a key role. We develop a metric to estimate the limits of linearization, that is, to determine when the curvature of the manifold invalidates the linear assumption. We also examine the interplay of model error, inadequate network geometry, and pick error. We then generalize our results from the simple case to the general case of 3D source regions observed by general networks. Although we do suggest a new “project and correct” method for location, we do not develop it into a practical algorithm. In conclusion, our intention rather is to highlight new analytical methods grounded in differential geometry.

East Pacific Ocean Islands↗

Scalable Deep Learning-Based Microarchitecture Simulation on GPUs

Cycle-accurate microarchitecture simulators are essential tools for designers to architect, estimate, optimize, and manufacture new processors that meet specific design expectations. However, conventional simulators based on discrete-event methods often require an exceedingly long time-to-solution for the simulation of applications and architectures at full complexity and scale. Given the excitement around wielding the machine learning (ML) hammer to tackle various architecture problems, there have been attempts to employ ML to perform architecture simulations, such as Ithemal and SimNet. However, the direct application of existing ML approaches to architecture simulation may be even slower due to overwhelming memory traffic and stringent sequential computation logic. This work proposes the first graphics processing unit (GPU)-based microarchitecture simulator that fully unleashes the potential of GPUs to accelerate state-of-the-art ML-based simulators. First, considering the application traces are loaded from central processing unit (CPU) to GPU for simulation, we introduce various designs to reduce the data movement cost between CPUs and GPUs. Second, we propose a parallel simulation paradigm that partitions the application trace into sub-traces to simulate them in parallel with rigorous error analysis and effective error correction mechanisms. Combined, this scalable GPU-based simulator outperforms by orders of magnitude the traditional CPU-based simulators and the state-of-the-art ML-based simulators, i.e., SimNet and Ithemal.

97 MATHEMATICS AND COMPUTING↗

The Art of Automation: Translating Electron Microscopy Workflows Into Automated Processes

Acquiring data using a scanning transmission electron microscope (STEM) is a complex, multi-step process. The intricacy of the process depends on the type of sample, composition of the material, desired results of the experiment, resolution requirement and other experimental factors. Each experiment presents unique complications, such as sample drift and contamination, that the microscopist must consider when acquiring data. All these challenges are handled fluidly and expertly by experienced microscopists, but to reach new levels of innovation in material development, including greater reproducibility, throughput, and precision, the automation of these workflows is essential. The initial phase of this work involved translating intuition-based workflows into discrete, programmable steps. Some common key stages in STEM workflows are the initial tuning, scanning the sample for areas of interest, and then acquiring the data. Each stage can be broken further into specific parameter adjustments, such as aberration correction and dwell time optimization, depending on the experiment. When deconstructing various experiments each step was assessed for automation feasibility based on the amount of real time operator decisions. There are steps that lend themselves to automation more readily than others, such as course focusing and sample screening, but there is potential for full automation of all stages with time. As an initial step, an automated montage routine was developed, allowing for the efficient acquisition of large portions of the sample without requiring continuous intervention from the operator. The automation of this small process of the procedure demonstrates the value of this capability. A major challenge in automation arises from discrepancies between commanded, reported and actual stage movements. Using systematic tests, stage movement was quantified. This error can be corrected algorithmically for more accurate workflows in the future. Expanding automation capabilities would result in larger, more efficient data acquisition which allows for more robust statistical analysis. Additionally, this work lays the groundwork for a closed loop system where machine learning algorithms would intake automatically acquired data and make real time decisions. By progressively automating this instrument, this work establishes the foundation for fully automated experimentation in transmission electron microscopy.

97 MATHEMATICS AND COMPUTING↗