Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational complexity”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,801 records · Page 100

Creating Feature Representations of Antibody-Antigen Complexes for Fast Binding Prediction with Machine Learning

Antibody-antigen interactions underlie the function of the immune system. Numerous computational tools exist that aim to predict important quantities associated with antibodyantigen interactions, such as binding energy. Efficient and accurate prediction of such quantities would greatly accelerate vaccine (antigen) and therapeutic antibody design. Current methods and tools, however, rely on varying degrees of computationally expensive steps that limit their use on problems that require many predictions, and moreover, no single method produces consistently accurate estimates. In this project, we determined the feasibility of creating feature representations that concisely describe interacting pairs of antibody and antigen as rapidly computable numerical vectors, given the antibody-antigen co-complex. Such a featurization will allow the use of a statistical machine learning model that jointly models the results of the disparate existing computational tools available. In turn, this will greatly enhance their combined predictive performance. We developed a feature representation consisting of 86 descriptors of the antigen-antibody interface which is then reduced into a lower dimensional representation using a neural network dimensionality reduction step. We have demonstrated that this feature representation serves its intended purpose of rapidly describing antigen-antibody pairs for the task of binding strength prediction. While this feasibility study has proven that such a feature representation is feasible, additional research is likely improve its ability to support various tasks, including binding strength prediction.

59 BASIC BIOLOGICAL SCIENCES↗

Hydrogenolysis of Dinuclear PCN R Ligated Pd II μ‐Hydroxides and Their Mononuclear Pd II Hydroxide Analogues

Abstract The hydrogenolysis of mono‐ and dinuclear Pd II hydroxides was investigated both experimentally and computationally. It was found that the dinuclear μ‐hydroxide complexes {[(PCN R )Pd] 2 (μ‐OH)}(OTf) (PCN H =1‐[3‐[(di‐ tert ‐butylphosphino)methyl]phenyl]‐1 H ‐pyrazole; PCN Me =1‐[3‐[(di‐ tert ‐butylphosphino)methyl]phenyl]‐5‐methyl‐1 H ‐pyrazole) react with H 2 to form the analogous dinuclear hydride species {[(PCN R )Pd] 2 (μ‐H)}(OTf). The dinuclear μ‐hydride complexes were fully characterized, and are rare examples of structurally characterized unsupported singly bridged μ‐H Pd II dimers. The {[(PCN Me )Pd] 2 (μ‐OH)}(OTf) hydrogenolysis mechanism was investigated through experiments and computations. The hydrogenolysis of the mononuclear complex (PCN H )Pd‐OH resulted in a mixed ligand dinuclear species [(PCN H )Pd](μ‐H)[(PCC)Pd] (PCC=a dianionic version of PCN H bound through phosphorus P, aryl C, and pyrazole C atoms) generated from initial ligand “rollover” C−H activation. Further exposure to H 2 yields the bisphosphine Pd 0 complex Pd[(H)PCN H ] 2 . When the ligand was protected at the pyrazole 5‐position in the (PCN Me )Pd−OH complex, no hydride formed under the same conditions; the reaction proceeded directly to the bisphosphine Pd 0 complex Pd[(H)PCN Me ] 2 . Reaction mechanisms for the hydrogenolysis of the monomeric and dimeric hydroxides are proposed.

Bailey, Wilson D.↗

Scalable Simulation of Pressure Gradient-Driven Transport of Rarefied Gases in Complex Permeable Media Using Lattice Boltzmann Method

Accurate representations of slip and transitional flow regimes present a challenge in the simulation of rarefied gas flow in confined systems with complex geometries. In these regimes, continuum-based formulations may not capture the physics correctly. This work considers a regularized multi-relaxation time lattice Boltzmann (LB) method with mixed Maxwellian diffusive and halfway bounce-back wall boundary treatments to capture flow at high Kn. The simulation results are validated against atomistic simulation results from the literature. We examine the convergence behavior of LB for confined systems as a function of inlet and outlet treatments, complexity of the geometry, and magnitude of pressure gradient and show that convergence is sensitive to all three. The inlet and outlet boundary treatments considered in this work include periodic, pressure, and a generalized periodic boundary condition. Compared to periodic and pressure treatments, simulations of complex domains using a generalized boundary treatment conserve mass but require more iterations to converge. Convergence behavior in complex domains improves at higher magnitudes of pressure gradient across the computational domain, and lowering the porosity deteriorates the convergence behavior for complex domains.

42 ENGINEERING↗

Fluid flow structure around the mixer in a reactor with mechanical mixing

Fluid flow structure around the mixer in a cylindrical reactor with mechanical mixing is studied and numerical results are presented in this article. The model area is complex because of the presence of convex corners of the mixer in the fluid flow. Proper boundary conditions for the vorticity calculated on the base of the stream function values near solid boundaries of the examined area are presented. The boundary value problem of motion of swirling incompressible viscous fluid in a vertical tank reactor with a mixer is solved numerically. The calculations are made by a computer code, written in MATLAB. The complex structure of the flow around the mixing disk is described and commented.

42 ENGINEERING↗

An adelic construction of Chern classes

We give a formula expressing the second Chern class c{sub 2}(E) in terms of trivializations of a rank two vector bundle E at scheme points of a surface X over a field. To do this, starting with these trivializations, we construct a cocycle in the adelic complex associated with the sheaf K{sub 2}(O{sub X}). Furthermore we prove that the Severi formula for the second Chern class is obtained as a special case of the formula constructed in this work. Bibliography: 10 titles.

97 MATHEMATICS AND COMPUTING↗

Distinct Mechanisms and Hydricities of Cp*Ir-Based CO 2 Hydrogenation Catalysts in Basic Water

Transition metal-catalyzed reversible hydrogenation of CO 2 to formate in aqueous solutions under ambient conditions is an attractive environmentally friendly strategy for the storage and transportation of H 2 in a liquid chemical form. Here, mechanistic details for the CO 2 hydrogenation by a series of pentamethylcyclopentadienyl iridium(III) (Cp*Ir) complexes with picolinamidate ligands are investigated through density functional theory and kinetic isotope effects (KIEs) calculations. Additionally, adopting a speciation approach at a pH of 8.2, CO 2 hydrogenation mechanisms of 37 distinct protonation states and conformers of Cp*Ir type complexes are investigated. This imposes a challenging test for the computational modeling in terms of providing a consistent correlation with experimental kinetics and KIE studies of multiple catalysts instead of a single complex. Overall, H 2 heterolysis to generate an iridium hydride intermediate was demonstrated to be the rate determining step, which proceeds via distinct pathways depending on the stereoelectronic properties of the ligand. A peculiar iridium dihydride route was also uncovered, which could be optimized to accelerate the H 2 heterolysis. We have further computed the thermodynamic and kinetic hydricities of 74 complexes with [Cp*Ir(L)(H)] q ( q = -1, 0, 1 depending on the ligand charge by deprotonation or protonation events) general formula. Hydricity values do not show any noticeable correlation with the thermodynamics (Δ G ) of [Cp*Ir(L)(HCO 2 – )] formation but exhibit linear correlation with the kinetics (Δ G ‡ ) of electrophilic CO 2 attack to iridium hydride species, especially when the charges and local structural effects of the metal hydrides are considered. Insights gained in this study on (i) the factors determining the preferred pathway for the rate-limiting H 2 heterolysis step, (ii) the correlation between thermodynamic hydricity and the kinetics of CO 2 insertion to iridium hydride species, and (iii) mechanistic analysis via combination of free energy profiles and KIE studies for a series of iridium catalysts will provide guidelines for the design of next-generation catalysts for the reversible H 2 storage through CO 2 utilization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Providing a Flexible and Comprehensive Software Stack Via Spack, an Extreme-Scale Scientific Software Stack, and Software Development Kits

To manage the complex demands of modern high-performance computing (HPC), software applications increasingly depend on software developed by other teams, often at other institutions. An HPC software ecosystem approach is required to support dependencies on third-party scientific software. An ecosystem approach provides layers of activity above the individual software product level that promote interoperability, quality improvement, porting, testing, and deployment. The U.S. Exascale Computing Project (ECP) developed its HPC software ecosystem using a three-pronged approach. First, the ECP adopted and invested in Spack, a package manager designed to handle complex HPC package dependencies. Second, the ECP created the Extreme Scale Scientific Software Stack, an effort that supports developing, deploying, and running scientific applications on HPC platforms. Third, the ECP supported software product communities, or software development kits, to develop and promote best practices, improve software interoperability, and other collaborative efforts. This article describes ECP contributions to HPC software ecosystem challenges.

97 MATHEMATICS AND COMPUTING↗

Time complexity and gate complexity

We formulate and investigate the simplest version of time-optimal quantum computation theory (TO-QCT), where the computation time is defined by the physical one and the Hamiltonian contains only one- and two-qubit interactions. This version of TO-QCT is also considered as optimality by sub-Riemannian geodesic length. The work has two aims: One is to develop a TO-QCT itself based on a physically natural concept of time, and the other is to pursue the possibility of using TO-QCT as a tool to estimate the complexity in conventional gate-optimal quantum computation theory (GO-QCT). In particular, we investigate to what extent is true the following statement: Time complexity is polynomial in the number of qubits if and only if gate complexity is also. In the analysis, we relate TO-QCT and optimal control theory (OCT) through fidelity-optimal computation theory (FO-QCT); FO-QCT is equivalent to TO-QCT in the limit of unit optimal fidelity, while it is formally similar to OCT. We then develop an efficient numerical scheme for FO-QCT by modifying Krotov's method in OCT, which has a monotonic convergence property. We implemented the scheme and obtained solutions of FO-QCT and of TO-QCT for the quantum Fourier transform and a unitary operator that does not have an apparent symmetry. The former has a polynomial gate complexity and the latter is expected to have an exponential one which is based on the fact that a series of generic unitary operators has an exponential gate complexity. The time complexity for the former is found to be linear in the number of qubits, which is understood naturally by the existence of an upper bound. The time complexity for the latter is exponential in the number of qubits. Thus, both the targets seem to be examples satisfyng the preceding statement. The typical characteristics of the optimal Hamiltonians are symmetry under time reversal and constancy of one-qubit operation, which are mathematically shown to hold in fairly general situations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Covalency-Driven Differences in the Hydrogenation Chemistry of Lanthanide- and Actinide-Based Frustrated Lewis Pairs

The electronic organization of Frustrated Lewis Pairs (FLPs) allows them to activate strong bonds in mechanisms that are usually free of redox events at the Lewis acidic site. The unique 6d/5f manifold of uranium could serve as an interesting FLP acceptor site, but to date FLP-like catalysis with actinide ions is unknown. In this paper, the catalytic, FLP-like hydrogenation reactivity of trivalent uranium complexes is explored in the presence of base-stabilized silylenes. Comparison to isoelectronic, isostructural lanthanide and thorium complexes lends insight into the electronic factors governing dihydrogen activation. Mechanistic studies of the uranium- and lanthanide-catalyzed hydrogenations are presented, including discussion of likely intermediates. Computational modeling of the f-element complexes, combined with experimental comparison to p-block Lewis acids, elucidates the relevance of steric hindrance to productive reactivity with dihydrogen. As a result, consideration of the complete experimental and theoretical evidence provides a clear picture of the electronic and steric factors governing dihydrogen activation by these FLPs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Gauges, loops, and polynomials for partition functions of graphical models

Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and optimization applications. The problem is #P-hard that is of an exponential complexity with respect to the number of variables. Here, aimed at approximating the partition function, we consider multi-graph models where binary variables and multivariable factors are associated with edges and nodes, respectively, of an undirected multi-graph. We suggest a new methodology for analysis and computations that combines the Gauge function technique from Chertkov and Chernyak with the technique developed in Anari and Oveis Gharan 2017 arXiv:1702.02937; Gurvits 2011 arXiv:1106.2844; Straszak and Vishnoi 2017 55th Annual Allerton Conf. on Communication, Control, and Computing, based on the recent progress in the field of real stable polynomials. We show that the Gauge function, representing a single-out term in a finite sum expression for the partition function which achieves extremum at the so-called belief-propagation gauge, has a natural polynomial representation in terms of gauges/variables associated with edges of the multi-graph. Moreover, Gauge function can be used to recover the partition function through a sequence of transformations allowing appealing algebraic and graphical interpretations. Algebraically, one step in the sequence consists of the application of a differential operator over gauges associated with an edge. Graphically, the sequence is interpreted as a repetitive elimination/contraction of edges resulting in multi-graph models on decreasing in size (number of edges) graphs with the same partition function as in the original multi-graph model. Even though the complexity of computing factors in the sequence of the derived multi-graph models and respective Gauge functions grow exponentially with the number of eliminated edges, polynomials associated with the new factors remain bi-stable if the original factors have this property. Moreover, we show that BP estimations in the sequence do not decrease, each low-bounding the partition function.

97 MATHEMATICS AND COMPUTING↗

Temporal breakdown and Borel resummation in the complex Langevin method

We reexamine the Parisi-Klauder conjecture for complex e{sup i{theta}/2}{phi}{sup 4} measures with a Wick rotation angle 0{<=}{theta}/2{<=}{pi}/2 interpolating between Euclidean signature and Lorentzian signature. Our main result is that the asymptotics for short stochastic times t encapsulates information also about the equilibrium aspects. The moments evaluated with the complex measure and with the real measure defined by the stochastic Langevin equation have the same t{yields}0 asymptotic expansion which is shown to be Borel summable. The Borel transform correctly reproduces the time dependent moments of the complex measure for all t, including their t{yields}{infinity} equilibrium values. On the other hand the results of a direct numerical simulation of the Langevin moments are found to disagree from the 'correct' result for t larger than a finite t{sub c}. The breakdown time t{sub c} increases powerlike for decreasing strength of the noise's imaginary part but cannot be excluded to be finite for purely real noise. To ascertain the discrepancy we also compute the real equilibrium distribution for complex noise explicitly and verify that its moments differ from those obtained with the complex measure. - Highlights: Black-Right-Pointing-Pointer The Parisi-Klauder conjecture is reexamined for complex e{sup i{theta}/2}{phi}{sup 4} measures. Black-Right-Pointing-Pointer The time dependent moments are evaluated by temporal Borel resummation. Black-Right-Pointing-Pointer The results disagree with the Langevin simulations beyond a critical time t{sub c}. Black-Right-Pointing-Pointer t{sub c} increases with decreasing strength of the noise's imaginary part. Black-Right-Pointing-Pointer The technical reason for the breakdown is identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Metal additive manufacturing simulation across length, time, and computing scales

Metal additive manufacturing (AM) offers a unique opportunity for production of advanced materials and complex geometries. However, variability in microstructure and properties challenges conventional approaches to design, process optimization, qualification, and materials selection. Modeling and simulation can improve understanding of AM processing and materials, but also poses major challenges for existing computational methods. Simultaneously, modern scientific computing hardware has become increasingly complex, most notably with the adoption of hybrid architectures such as Graphical Processing Units (GPUs). If appropriately utilized, emerging computational capabilities provide an opportunity to reveal new insight into AM processing and the resulting material structure and properties. In this review we describe the computational AM landscape, identify critical gaps, and highlight opportunities to impact the development and application of AM. First, the requirements and challenges of representative AM problem statements will be defined. Here, these problems range from scientific studies to industrial applications and are designed to capture the breadth of challenges facing the AM community. Next, the current state of AM modeling and simulation is evaluated, broken down by enabling hardware and software, process simulation, microstructure simulation, and property simulation. Each section describes the diversity of simulation approaches and associated trade-offs in physical fidelity and computational expense. Each area is then assessed based on their suitability and readiness for current and developing computational architectures. Lastly, the greatest opportunities for future research and application are highlighted, including gaps in modeling capabilities, opportunities for near-term application, and key scientific challenges.

additive manufacturing↗

Use of Continuous Integration Tools for Application Performance Monitoring

High performance computing systems are becom- ing increasingly complex, both in node architecture and in the multiple layers of software stack required to compile and run applications. As a consequence, the likelihood is increasing for application performance regressions to occur as a result of routine upgrades of system software components which interact in complex ways. The purpose of this study is to evaluate the effectiveness of continuous integration tools for application performance monitoring on HPC systems. In addition, this paper also describes a prototype system for application perfor- mance monitoring based on Jenkins, a Java-based continuous integration tool. The monitoring system described leverages several features in Jenkins to track application performance results over time. Preliminary results and lessons learned from monitoring applications on Cray systems at the Oak Ridge Leadership Computing Facility are presented.

Vergara Larrea, Veronica G↗

Scale-Dependent Fracture-Matrix Interactions and Their Impact on Radionuclide Transport: Development of efficient particle-tracking methods

Matrix Diffusion and Adsorption within a rock matrix are important mechanisms for retarding transport of radionuclides in fractured rock. Due to computational limitations and difficulties in characterizing complex subsurface systems, diffusive exchange between a fracture network and surrounding rock matrix is often modeled using simplified conceptual representations. There is significant uncertainty in “effective” parameters used in these models, such as the “effective matrix diffusivity”. Often, these parameters are estimated by fitting sparse breakthrough data, and estimated values fall outside meaningful ranges, because simplified interpretive models do not consider complex three-dimensional flow. There is limited understanding of the relationship between the effective parameters and rock mass characteristics including network structure and matrix properties. There is also evidence for an apparent scale-dependence in “effective matrix diffusion” coefficients. These observations raise questions on whether fracture-matrix interaction parameters estimated from small-scale tracer tests can be used for predicting radionuclide fate and transport at the scale of DOE field sites. High-resolution three-dimensional Discrete-Fracture-Network-Matrix (DFNM) models based on well-defined local scale transport equations can help to address some of these questions. Due to tremendous advances in computational technology over the last 10 years, DFNM modeling in relatively large domains is now feasible. The overarching objective of our research is to use DFNM modeling to improve fundamental understanding of how effective parameters in conceptual models are related to fracture network structure and matrix properties. An advanced three-dimensional DFNM model is being developed, which combines upscaled particle-tracking algorithms for fracture-matrix interaction and a parallel fracture-network flow simulator. The particle-tracking algorithms allow complexity in flow fields at different scales, and track transport across fracture-matrix interfaces based on rigorous local approximations to the transport equations. This modeling approach can incorporate aperture variability, multi-scale preferential flow and matrix heterogeneity. We developed efficient particle-tracking methods for handling matrix diffusion and adsorption on fracture walls and demonstrated their efficiency for use within the context of large-scale complex fracture network models with variability in apertures across a network of fractures and within individual fractures.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A fast and accurate domain decomposition nonlinear manifold reduced order model

Here, this paper integrates nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD). NM ROMs approximate the full order model (FOM) state in a nonlinear-manifold by training a shallow, sparse autoencoder using FOM snapshot data. These NM-ROMs can be advantageous over linear-subspace ROMs (LS-ROMs) for problems with slowly decaying Kolmogorov n-width. However, the number of NM-ROM parameters that need to be trained scales with the size of the FOM. Moreover, for “extreme-scale” problems, the storage of high-dimensional FOM snapshots alone can make ROM training expensive. To alleviate the training cost, this paper applies DD to the FOM, computes NM-ROMs on each subdomain, and couples them to obtain a global NM-ROM. This approach has several advantages: Subdomain NM-ROMs can be trained in parallel, involve fewer parameters to be trained than global NM-ROMs, require smaller subdomain FOM dimensional training data, and can be tailored to subdomain specific features of the FOM. The shallow, sparse architecture of the autoencoder used in each subdomain NM-ROM allows application of hyper-reduction (HR), reducing the complexity caused by nonlinearity and yielding computational speedup of the NM-ROM. This paper provides the first application of NM-ROM (with HR) to a DD problem. In particular, this paper details an algebraic DD reformulation of the FOM, training a NM-ROM with HR for each sub domain, and a sequential quadratic programming (SQP) solver to evaluate the coupled global NM-ROM. Theoretical convergence results for the SQP method and a priori and a posteriori error estimates for the DD NM-ROM with HR are provided. The proposed DD NM-ROM with HR approach is numerically compared to a DD LS-ROM with HR on the 2D steady-state Burgers’ equation, showing an order of magnitude improvement in accuracy of the proposed DD NM-ROM over the DD LS-ROM.

97 MATHEMATICS AND COMPUTING↗

A moving control volume approach to computing hydrodynamic forces and torques on immersed bodies

Here, we present a moving control volume (CV) approach to computing hydrodynamic forces and torques on complex geometries. The method requires surface and volumetric integrals over a simple and regular Cartesian box that moves with an arbitrary velocity to enclose the body at all times. The moving box is aligned with Cartesian grid faces, which makes the integral evaluation straightforward in an immersed boundary (IB) framework. Discontinuous and noisy derivatives of velocity and pressure at the fluid–structure interface are avoided and far-field (smooth) velo city and pressure information is used. We re-visit the approach to compute hydrodynamic forces and torques through force/torque balance equations in a Lagrangian frame that some of us took in a prior work (Bhalla et al., 2013 [13]). We prove the equivalence of the two approaches for IB methods, thanks to the use of Peskin's delta functions. Both approaches are able to suppress spurious force oscillations and are in excellent agreement, as expected theoretically. Test cases ranging from Stokes to high Reynolds number regimes are considered. We discuss regridding issues for the moving CV method in an adaptive mesh refinement (AMR) context. The proposed moving CV method is not limited to a specific IB method and can also be used, for example, with embedded boundary methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Ligand Lone-Pair Influence on Hydrocarbon C-H Activation: A Computational Perspective Δ

Mid to late transition metal complexes that break hydrocarbon C-H bonds by transferring the hydrogen to a heteroatom ligand while forming a metal-alkyl bond offer a promising strategy for C-H activation. Here we report a density functional (B3LYP, M06, and X3LYP) analysis of cis-(acac)2MX and TpM(L)X (M = Ir, Ru, Os, and Rh; acac = acetylacetonate, Tp = tris(pyrazolyl)borate; X = CH3, OH, OMe, NH2, and NMe2) systems for methane C-H bond activation reaction kinetics and thermodynamics. We address the importance of whether a ligand lone pair provides an intrinsic kinetic advantage through possible electronic dπ-pπ repulsions for M-OR and M-NR2 systems versus M-CH3 systems. This involves understanding the energetic impact of the X ligand group on ligand loss, C-H bond coordination, and C-H bond cleavage steps as well as understanding how the nucleophilicity of the ligand X group, the electrophilicity of the transition metal center, and cis-ligand stabilization effect influence each of these steps. We also explore how spectator ligands and second- versus third-row transition metal centers impact the energetics of each of these C-H activation steps.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Refine your search to explore more results.