Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “theoretical and computational techniques”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Exploring the Feasibility of INCONEL® ALLOY 740H® for Power Plant Headers: Integrating Machine Learning with Computational Fluid Dynamics (CFD)

This keynote presentation explores the behavior of headers—essential components of pipeline systems—using ANSYS simulation software and machine learning techniques. The study aims to predict the thermal and mechanical performance of headers under diverse conditions through both steady-state and transient simulations. We investigate critical parameters such as heat transfer coefficient, fluid velocity, and temperature to optimize header design. Conducted as part of a DOE project led by NCAT in collaboration with UNC Charlotte, this research encompasses multiple key topics. The initial section focuses on the behavior of header systems under steady-state conditions using ANSYS simulation. It underscores the importance of headers in industrial infrastructure, especially in the energy sector, and examines the implications of material selection and flow direction on heat transfer dynamics. Methodologically, we employ Computational Fluid Dynamics (CFD) analysis through ANSYS, detailing the development of models, material properties, geometry specifications, boundary conditions, and meshing strategies. Our simulations explore various operational parameters, including temperature and mass flow rates, crucial for predicting heat transfer coefficients and enhancing header design. Results from the study include parametric investigations into mesh sensitivity, viscosity model evaluations, and the effects of heat transfer locations, all validated against theoretical calculations. We conclude with insights on mesh optimization, the suitability of viscosity models, and recommendations for future research aimed at improving header system efficiency and sustainability in industrial applications.

20 FOSSIL-FUELED POWER PLANTS↗
DOE OSTI2023

Quantum error mitigation by Pauli check sandwiching

Abstract We describe and analyze an error mitigation technique that uses multiple pairs of parity checks to detect the presence of errors. Each pair of checks uses one ancilla qubit to detect a component of the error operator and represents one layer of the technique. We build on the results on extended flag gadgets and put it on a firm theoretical foundation. We prove that this technique can recover the noiseless state under the assumption of noise not affecting the checks. The method does not incur any encoding overhead and instead chooses the checks based on the input circuit. We provide an algorithm for obtaining such checks for an arbitrary target circuit. Since the method applies to any circuit and input state, it can be easily combined with other error mitigation techniques. We evaluate the performance of the proposed methods using extensive numerical simulations on 1850 random input circuits composed of Clifford gates and non-Clifford single-qubit rotations, a class of circuits encompassing most commonly considered variational algorithm circuits. We observe average improvements in fidelity of 34 percentage points with six layers of checks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

DSPS: Differentiable stellar population synthesis

ABSTRACT Models of stellar population synthesis (SPS) are the fundamental tool that relates the physical properties of a galaxy to its spectral energy distribution (SED). In this paper, we present DSPS: a python package for SPS. All of the functionality in DSPS is implemented natively in the JAX library for automatic differentiation, and so our predictions for galaxy photometry are fully differentiable, and directly inherit the performance benefits of JAX, including portability onto GPUs. DSPS also implements several novel features, such as i) a flexible empirical model for stellar metallicity that incorporates correlations with stellar age, ii) support for the Diffstar model that provides a physically-motivated connection between the star formation history of a galaxy (SFH) and the mass assembly of its underlying dark matter halo. We detail a set of theoretical techniques for using autodiff to calculate gradients of predictions for galaxy SEDs with respect to SPS parameters that control a range of physical effects, including SFH, stellar metallicity, nebular emission, and dust attenuation. When forward modelling the colours of a synthetic galaxy population, we find that DSPS can provide a factor of 5 speed-up over standard SPS codes on a CPU, and a factor of 300-400 on a modern GPU. When coupled with gradient-based techniques for optimization and inference, DSPS makes it practical to conduct expansive likelihood analyses of simulation-based models of the galaxy–halo connection that fully forward model galaxy spectra and photometry.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

A multi-dimensional Child–Langmuir law for any diode geometry

While prior theoretical studies of multi-dimensional space-charge limited current (SCLC) assumed emission from a small patch on infinite electrodes, none have considered emission from an entire finite electrode. In this paper, we apply variational calculus (VC) and conformal mapping, which have previously been used to derive analytic solutions for SCLC density (SCLCD) for nonplanar one-dimensional geometries, to obtain mathematical relationships for any multi-dimensional macroscopic diode with finite cathode and anode. We first derive a universal mathematical relationship between space-charge limited potential and vacuum potential for any diode and apply this technique to determine SCLCD for an eccentric spherical diode. We then apply VC and the Schwartz–Christoffel transformation to derive an exact equation for SCLCD in a general two-dimensional planar geometry with emission from a finite emitter. Particle-in-cell simulations using VSim agreed within 4%–13% for a range of ratios of emitter width to gap distance using the thinnest electrodes practical for the memory constraints of our hardware, with the difference partially attributed to the theory's assumption of infinitesimally thin electrodes. After generalizing this approach to determine SCLCD for any orthogonal diode as a function of only the vacuum capacitance and vacuum potential, we derive an analytical formulation of the three-dimensional Child–Langmuir law for finite parallel rectangular and disk geometries. These results demonstrate the utility for calculating SCLCD for any diode geometry using vacuum capacitance and vacuum potential, which are readily obtainable for many diode geometries, to guide experiment and simulation development.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Supernova neutrino signals based on long-term axisymmetric simulations

ABSTRACT We study theoretical neutrino signals from core-collapse supernova (CCSN) computed using axisymmetric CCSN simulations that cover the post-bounce phase up to ∼4 s. We provide basic quantities of the neutrino signals such as event rates, energy spectra, and cumulative number of events at some terrestrial neutrino detectors, and then discuss some new features in the late phase that emerge in our models. Contrary to popular belief, neutrino emissions in the late phase are not always steady, but rather have temporal fluctuations, the vigour of which hinges on the CCSN model and neutrino flavour. We find that such temporal variations are not primarily driven by proto-neutron star convection, but by fallback accretion in exploding models. We assess the detectability of these temporal variations, and find that IceCube is the most promising detector with which to resolve them. We also update fitting formulae first proposed in our previous paper for which the total neutrino energy emitted at the CCSN source is estimated from the cumulative number of events in each detector. This will be a powerful technique with which to analyse real observations, particularly for low-statistics data.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

On-shell recursion and holomorphic HQET for heavy quark hadronic resonances

We develop a new theoretical framework for the treatment of heavy quark (HQ) resonances within heavy quark effective theory (HQET). This framework uses on-shell recursion techniques to express the resonant amplitude as a product of on-shell subamplitudes, which allows one to employ a form-factor representation of the hadronic matrix elements and to obtain an HQ expansion, but at the price of introducing complex momenta. We construct a generalized “holomorphic HQET” onto which such complex-momentum matrix elements can be matched, and we show that PT symmetry ensures the Isgur-Wise functions (and the perturbative corrections) become holomorphic functions of the complex recoil parameter with real coefficients. They are thus an analytic continuation of the standard HQET description. This framework admits a HQ hadron (strong decay) width expansion. At second order, we show it is compatible with data for the B12∗$$ {B}_{1(2)}^{\left(\ast \right)} $$ and D12∗$$ {D}_{1(2)}^{\left(\ast \right)} $$ HQ doublets. Taking the B¯→D1∗1−→Dπlν$$ \overline{B}\to \left({D}_1^{\ast}\left({1}^{-}\right)\to D\pi \right) l u $$ system as an example, we compute the holomorphic HQET expansion to first order, as well as the complex-momentum on-shell subamplitudes. A toy numerical study of the resulting differential rates demonstrates that this framework generates HQ resonance lineshapes with large tails, resembling those seen in data.

Manzari, Claudio Andrea↗
DOE OSTI2022

Qubit Assignment Using Time Reversal

As quantum computers with large numbers of qubits become increasingly available, experiments executed on a given device may not utilize all available qubits. In this case, the outcome of executing a quantum program will depend on the ability to efficiently select a subset of high-performing physical qubits. For any given quantum program and device there are many ways to assign physical qubits for execution of the program, and assignments will differ in performance due to the variability in quality across qubits and entangling operations on a single device. Evaluating the performance of each assignment using fidelity estimation introduces significant experimental overhead and will be infeasible for many applications, while relying on standard device benchmarks provides incomplete information about the performance of any specific program. Furthermore, the number of possible assignments grows combinatorially in the number of qubits on the device and in the program, motivating the use of heuristic optimization techniques. We demonstrate a practical solution to the problem of qubit assignment by using simulated annealing with a cost function based on the Loschmidt echo, a diagnostic that measures the reversibility of a quantum process. We provide theoretical justification for this choice of cost function by demonstrating that the optimal qubit assignment coincides with the optimal qubit assignment based on state fidelity in the weak error limit, and we provide experimental justification using diagnostics performed on Google’s superconducting qubit devices. We then establish the performance of simulated annealing for qubit assignment using classical simulations of noisy devices as well as optimization experiments performed on a quantum processor. Our results demonstrate that the use of Loschmidt echoes and simulated annealing provides a scalable and flexible approach to optimizing qubit assignment on near-term hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Desmearing small-angle scattering data by central moment expansions of instrument resolution

This study introduces an enhanced numerical technique tailored specifically for refining 1D small-angle scattering (SAS) intensity profiles affected by smearing. Our primary objective is to address the resolution blurring commonly encountered in SAS data, particularly in systems with clearly defined correlation peaks whose spread aligns with the width of the resolution function at corresponding Q positions. Unlike previous approaches that expanded the SAS intensity using central moment expansion, the new method focuses on expanding the resolution function itself, thus eliminating artificial oscillations observed in smeared spectra due to limitations inherent in our earlier algorithm. This method is straightforward to implement, computationally efficient and consistently performs well in numerical benchmarking. To illustrate its effectiveness, we present a case study of a lamellar phase characterized by distinct peaks in its small-angle neutron scattering intensities.

central moment expansions↗
DOE OSTI2025

ORNL Design Engineering Library: Validated Thermoelectric Digital Twins

Radioisotope thermoelectric generators (RTGs) serve a crucial role in supplying thermal and electrical energy for reliable and long-duration power in remote and extreme environments. The thermal energy is provided by the decay of radioisotopes and is converted into electrical energy using the steady-state thermoelectric process by exploiting the Seebeck effect. Maintaining a thermal gradient through the material is necessary to drive current production. Modern predictive multi-physics tools are able to effectively describe the complex and strongly coupled phenomena needed for accurate model-based system engineering efforts needed to develop higher performing RTGs. Experimental validation of model simulations is essential to confirm the accuracy, reliability, and applicability of predictive multiphysics tools. Validation fosters confidence among users, helps meet regulatory requirements, and contributes to the ongoing improvement of simulation techniques, ultimately leading to better, safer, and more efficient designs and processes. Validated models can then be used as digital twins and can be interrogated to understand and quantify the performance gaps between theoretical and physical systems. These insights can be used to build higher performing systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Ensuring thermodynamic consistency with invertible coarse-graining

Coarse-grained models are a core computational tool in theoretical chemistry and biophysics. A judicious choice of a coarse-grained model can yield physical insights by isolating the essential degrees of freedom that dictate the thermodynamic properties of a complex, condensed-phase system. The reduced complexity of the model typically leads to lower computational costs and more efficient sampling compared with atomistic models. Designing “good” coarse-grained models is an art. Generally, the mapping from fine-grained configurations to coarse-grained configurations itself is not optimized in any way; instead, the energy function associated with the mapped configurations is. In this work, we explore the consequences of optimizing the coarse-grained representation alongside its potential energy function. We use a graph machine learning framework to embed atomic configurations into a low-dimensional space to produce efficient representations of the original molecular system. Because the representation we obtain is no longer directly interpretable as a real-space representation of the atomic coordinates, we also introduce an inversion process and an associated thermodynamic consistency relation that allows us to rigorously sample fine-grained configurations conditioned on the coarse-grained sampling. We illustrate that this technique is robust, recovering the first two moments of the distribution of several observables in proteins such as chignolin and alanine dipeptide.

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

Multichannel Analysis of Surface Waves Accelerated (MASWAccelerated): Software for efficient surface wave inversion using MPI and GPUs

Multichannel Analysis of Surface Waves (MASW) is a technique frequently used in geotechnical engineering and engineering geophysics to infer 1D layered models of seismic shear wave velocities in the top tens to hundreds of meters of the subsurface. We aim to accelerate MASW calculations by capitalizing on modern computer hardware available in the workstations of most engineers: multiple cores and graphics processing units (GPUs). We propose new parallel and GPU accelerated algorithms for computing 1D MASW inversion, and provide software implementations in C using Message Passing Interface (MPI) and CUDA. These algorithms take advantage of sparsity that arises in the problem, and the work balance between processes considers typical data trends. We compare our methods to an existing open source Matlab MASW tool. Our serial C implementation achieves a 2x speedup over the Matlab software, and we continue to see improvements by parallelizing the problem with MPI. Here we see nearly perfect strong and weak scaling for uniform data, and improve strong scaling for realistic data by repartitioning the problem to process mapping. By utilizing GPUs available on most modern workstations, we observe an additional 1.3x speedup over the serial C implementation on the first use of the method. We typically repeatedly evaluate theoretical dispersion curves as part of an optimization procedure, and on the GPU the kernel can be cached for faster reuse on later runs. We observe a 3.2x speedup on the cached GPU runs compared to the serial C runs. This work is the first open-source parallel or GPU-accelerated software tool for MASW imaging, and should enable geotechnical engineers to fully utilize all computer hardware at their disposal.

58 GEOSCIENCES↗
DOE OSTI2024

Statistical Complexity of Quantum Learning

Abstract Learning problems involve settings in which an algorithm has to make decisions based on data, and possibly side information such as expert knowledge. This study has two main goals. First, it reviews and generalizes different results on the data and model complexity of quantum learning, where the data and/or the algorithm can be quantum, focusing on information‐theoretic techniques. Second, it introduces the notion of copy complexity, which quantifies the number of copies of a quantum state required to achieve a target accuracy level. Copy complexity arises from the destructive nature of quantum measurements, which irreversibly alter the state to be processed, limiting the information that can be extracted about quantum data. As a result, empirical risk minimization is generally inapplicable. The paper presents novel results on the copy complexity for both training and testing. To make the paper self‐contained and approachable by different research communities, an extensive background material is provided on classical results from statistical learning theory, as well as on the distinguishability of quantum states. Throughout, the differences between quantum and classical learning are highlighted by addressing both supervised and unsupervised learning, and extensive pointers are provided to the literature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Improved information criteria for Bayesian model averaging in lattice field theory

Bayesian model averaging is a practical method for dealing with uncertainty due to model specification. Use of this technique requires the estimation of model probability weights. Here, we revisit the derivation of estimators for these model weights. Use of the Kullback-Leibler divergence as a starting point leads naturally to a number of alternative information criteria suitable for Bayesian model weight estimation. We explore three such criteria, known to the statistics literature before, in detail: a Bayesian analog of the Akaike information criterion which we call the BAIC, the Bayesian predictive information criterion, and the posterior predictive information criterion (PPIC). We compare the use of these information criteria in numerical analysis problems common in lattice field theory calculations. We find that the PPIC has the most appealing theoretical properties and can give the best performance in terms of model-averaging uncertainty, particularly in the presence of noisy data, while the BAIC is a simple and reliable alternative.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Improving the Precision of First-Principles Calculation of Parton Physics from Lattice Quantum Chromodynamics

Large momentum effective theory (LaMET) provides a general framework for computing the multi-dimensional partonic structure of the proton from first principles using lattice quantum chromodynamics (QCD). In this effective field theory approach, LaMET predicts parton distributions through a power expansion and perturbative matching of a class of Euclidean observables—quasi-distributions—evaluated at large proton momenta. Recent advances in lattice renormalization, such as the hybrid scheme with leading renormalon resummation, together with improved matching kernel that incorporates higher-loop corrections and resummations, have enhanced both the perturbative and power accuracy of LaMET, enabling a reliable quantification of theoretical uncertainties. Moreover, the Coulomb-gauge correlator approach further simplifies lattice analyses and improves the precision of transverse-momentum-dependent structures, particularly in the non-perturbative region. State-of-the-art LaMET calculations have already yielded certain parton observables with important phenomenological impact. In addition, the recently proposed kinematically enhanced lattice interpolation operators promise access to unprecedented proton momenta with greatly improved signal-to-noise ratios, which will extend the range of LaMET prediction and further suppress the power corrections. The remaining challenges, such as controlling excited-state contamination in lattice matrix elements and extracting gluonic distributions, are expected to benefit from emerging lattice techniques for ground-state isolation and noise reduction. Thus, lattice QCD studies of parton physics have entered an exciting stage of precision control and systematic improvement, which will have a broader impact for nuclear and particle experiments.

Zhao, Yong [Argonne National Laboratory (ANL), Arg↗
DOE OSTI2024

Patch2Self2: Self-supervised Denoising on Coresets via Matrix Sketching

Diffusion MRI (dMRI) non-invasively maps brain white matter yet necessitates denoising due to low signal-to-noise ratios. Patch2Self (P2S) employing self-supervised techniques and regression on a Casorati matrix effectively denoises dMRI images and has become the new de-facto standard in this field. P2S however is resource intensive both in terms of running time and memory usage as it uses all voxels (n) from all-but-one held-in volumes (d-1) to learn a linear mapping Phi : \mathbb R ^ n x(d-1) \mapsto \mathbb R ^ n for denoising the held-out volume. The increasing size and dimensionality of higher resolution dMRI acquisitions can make P2S infeasible for large-scale analyses. This work exploits the redundancy imposed by P2S to alleviate its performance issues and inspect regions that influence the noise disproportionately. Specifically this study makes a three-fold contribution: (1) We present Patch2Self2 (P2S2) a method that uses matrix sketching to perform self-supervised denoising. By solving a sub-problem on a smaller sub-space so called coreset we show how P2S2 can yield a significant speedup in training time while using less memory. (2) We present a theoretical analysis of P2S2 focusing on determining the optimal sketch size through rank estimation a key step in achieving a balance between denoising accuracy and computational efficiency. (3) We show how the so-called statistical leverage scores can be used to interpret the denoising of dMRI data a process that was traditionally treated as a black-box. Experimental results on both simulated and real data affirm that P2S2 maintains denoising quality while significantly enhancing speed and memory efficiency achieved by training on a reduced data subset.

Fadnavis, Shreyas↗
DOE OSTI2022

Assessment of Molten Eutectic LiF-NaF-KF Density through Experimental Determination and Semiempirical Modeling

Molten salts have favorable material properties for use in high-temperature energy systems, including thermal energy storage systems, concentrating solar power plants, nuclear reactors, and various industrial manufacturing processes. Knowledge of chemical and thermophysical property data is essential for the design and optimization of these systems, yet data are often limited or uncertain for many candidate salts due to the difficulty of thermophysical property measurements at relevant temperatures (e.g., 500–900 °C). Here, the density of molten LiF-NaF-KF eutectic is reassessed through review of previous experimental data, new density measurements from 470 to 800 °C, and semiempirical modeling. Additionally, the density was measured using the displacement technique. Compositional and temperature-dependent density estimates were calculated with a multidimensional Redlich–Kister model. The results of the new experimental measurements agree within 2% of the modeled density of molten eutectic LiF-NaF-KF. The Redlich–Kister model’s prediction shows a near-ideal density behavior for the LiF-NaF-KF system and is promising for the estimation of off-eutectic LiF-NaK-KF densities. Finally, through review of the existing literature and comparison to new measurements, recommendations are made for the density of LiF-NaF-KF.

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

Data Science Meets Physical Organic Chemistry

At the heart of synthetic chemistry is the holy grail of predictable catalyst design. In particular, researchers involved in reaction development in asymmetric catalysis have pursued a variety of strategies toward this goal. This is driven by both the pragmatic need to achieve high selectivities and the inability to readily identify why a certain catalyst is effective for a given reaction. While empiricism and intuition have dominated the field of asymmetric catalysis since its inception, enantioselectivity offers a mechanistically rich platform to interrogate catalyst-structure response patterns that explain the performance of a particular catalyst or substrate. In the early stages of an asymmetric reaction development campaign, the overarching mechanism of the reaction, catalyst speciation, the turnover limiting step, and many other details are unknown or posited based on related reactions. Considering the unclear details leading to a successful reaction, initial enantioselectivity data are often used to intuitively guide the ultimate direction of optimization. However, if the conditions of the Curtin-Hammett principle are satisfied, then measured enantioselectivity can be directly connected to the ensemble of diastereomeric transition states (TSs) that lead to the enantiomeric products, and the associated free energy difference between competing TSs (ΔΔ G ‡ = - RT ln[( S )/( R )], where ( S ) and ( R ) represent the concentrations of the enantiomeric products). We, and others, speculated that this important piece of information can be leveraged to guide reaction optimization in a quantitative way. Although traditional linear free energy relationships (LFERs), such as Hammett plots, have been used to illuminate important mechanistic features, we sought to develop data science derived tools to expand the power of LFERs in order to describe complex reactions frequently encountered in modern asymmetric catalysis. Specifically, we investigated whether enantioselectivity data from a reaction can be quantitatively connected to the attributes of reaction components, such as catalyst and substrate structural features, to harness data for asymmetric catalyst design. In this context, we developed a workflow to relate computationally derived features of reaction components to enantioselectivity using data science tools. The mathematical representation of molecules can incorporate many aspects of a transformation, such as molecular features from substrate, product, catalyst, and proposed transition states. Statistical models relating these features to reaction outputs can be used for various tasks, such as performance prediction of untested molecules. Perhaps most importantly, statistical models can guide the generation of mechanistic hypotheses that are embedded within complex patterns of reaction responses. Overall, merging traditional physical organic experiments with statistical modeling techniques creates a feedback loop that enables both evaluation of multiple mechanistic hypotheses and future catalyst design. In this Account, we highlight the evolution and application of this approach in the context of a collaborative program based on chiral phosphoric acid catalysts (CPAs) in asymmetric catalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗