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 649 records · Page 36

A Study of Complex Deep Learning Networks on High-Performance, Neuromorphic, and Quantum Computers

Current deep learning approaches have been very successful using convolutional neural networks trained on large graphical-processing-unit-based computers. Three limitations of this approach are that (1) they are based on a simple layered network topology, i.e., highly connected layers, without intra-layer connections; (2) the networks are manually configured to achieve optimal results, and (3) the implementation of the network model is expensive in both cost and power. In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. We use the MNIST dataset for our experiment, due to input size limitations of current quantum computers. Our results show the feasibility of using the three architectures in tandem to address the above deep learning limitations. Finally, we show that a quantum computer can find high quality values of intra-layer connection weights in a tractable time as the complexity of the network increases, a high performance computer can find optimal layer-based topologies, and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware.

97 MATHEMATICS AND COMPUTING↗

Exploring the Performance of Spark for a Scientific Use Case

We present an evaluation of the performance of a Spark implementation of a classification algorithm in the domain of High Energy Physics (HEP). Spark is a general engine for in-memory, large-scale data processing, and is designed for applications where similar repeated analysis is performed on the same large data sets. Classification problems are one of the most common and critical data processing tasks across many domains. Many of these data processing tasks are both computation- and data-intensive, involving complex numerical computations employing extremely large data sets. We evaluated the performance of the Spark implementation on Cori, a NERSC resource, and compared the results to an untuned MPI implementation of the same algorithm. While the Spark implementation scaled well, it is not competitive in speed to our MPI implementation, even when using significantly greater computational resources.

Sehrish, Saba↗

Systems, methods and computer program products for constructing complex geometries using layered and linked hexahedral element meshes

Systems, methods and computer program products for creating 3D representations of bodies are disclosed. The systems, methods and computer program products include the construction of FE meshes representing complex geometries. The complex geometries may be artificially or naturally formed or designed geometries. The techniques reduce the number of elements as much as possible to save on computer run time while maintaining computational accuracy.

97 MATHEMATICS AND COMPUTING↗

Controlling P–C/C–H Bond Cleavage in Nickel Bis(diphosphine) Complexes: Reactivity Scope, Mechanism, and Computations

The synthesis of heteroleptic [Ni(P 2 N 2 )(diphosphine)][BF 4 ] 2 complexes and the cleavage of P–C and C–H bonds of the P 2 N 2 ligand in those complexes are reported here. The products are five-coordinate complexes in which Ni–C and P–H bonds have formed to give a cyclic moiety containing Ni–CH$=$NR 2 . The reactivity of [Ni(P 2 N 2 )(diphosphine)][BF 4 ] 2 complexes is influenced by the rigidity of the diphosphine, the steric effect of the substituents, and length of the carbon linker of the diphosphine ligands. Diphosphine ligands bearing a rigid backbone (e.g., dmpbz, 1,2-bis(dimethylphosphino)benzene) or aromatic substituents (e.g., dppe, 1,2-bis(diphenylphosphino)ethane) react with [Ni(P t Bu 2 N Bn 2 )(CH 3 CN) 2 ][BF 4 ] 2 to give P–C/C–H bond cleavage products. Both [Ni(P t Bu 2 N Bn 2 )(dmpe)(MeCN)][BF 4 ] 2 and [Ni(P t Bu 2 N Bn 2 )(dmpm)(MeCN)][BF 4 ] 2 (dmpm = 1,2-bis(dimethylylphosphino)methane) were prepared by the reaction of [Ni(P t Bu 2 N Bn 2 )(CH 3 CN) 2 ][BF 4 ] 2 with the corresponding diphosphine ligands. [Ni(P t Bu 2 N Bn 2 )(dmpe)(MeCN)][BF 4 ] 2 readily undergoes P–C/C–H bond cleavage in nitromethane. In sharp contrast, [Ni(P t Bu 2 N Bn 2 )(dmpm)][BF 4 ] 2 is stabilized by dmpm, a diphosphine with small bite angle, and does not show P–C/C–H bond cleavage reactivity. Computational results show that for complexes bearing less bulky diphosphine ligands, such as dmpm, the barriers for the rate-determining transition states are in some examples higher than 30 kcal/mol with the M06 functional, higher than those for complexes bearing more rigid or more bulky ligands, consistent with experimental studies. The calculated barriers for the first transition state correlated with increased values of the dihedral angle formed by the two NiP 2 planes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Restricted and unrestricted non-Hermitian Hartree-Fock: Theory, practical considerations, and applications to metastable molecular anions

This work describes the implementation and applications of non-Hermitian self-consistent field (NH-SCF) theory with complex basis functions for the ab initio computation of positions and widths of shape resonances in molecules. We utilize both the restricted open-shell and the previously unexplored spin-unrestricted variants to compute Siegert energies of several anionic shape resonances in small diatomic and polyatomic molecules including carbon tetrafluoride which has been the subject of several recent experimental studies. The computation of general molecular properties from a non-Hermitian wavefunction is discussed, and a density-based analysis is applied to the {sup 2}B{sub 1} shape resonance in formaldehyde. Spin-unrestricted NH-SCF is used to compute a complex potential energy surface for the carbon monoxide anion which correctly describes dissociation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Variational Monte Carlo Calculations of A ≤ 4 Nuclei with an Artificial Neural-Network Correlator Ansatz

Here, the complexity of many-body quantum wave functions is a central aspect of several fields of physics and chemistry where nonperturbative interactions are prominent. Artificial neural networks (ANNs) have proven to be a flexible tool to approximate quantum many-body states in condensed matter and chemistry problems. In this work we introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei, and approximately solve the nuclear many-body Schrodinger equation. Using efficient stochastic sampling and optimization schemes, our approach extends pioneering applications of ANNs in the field, which present exponentially scaling algorithmic complexity. We compute the binding energies and point-nucleon densities of A ≤ 4 nuclei as emerging from a leading-order pionless effective field theory Hamiltonian. We successfully benchmark the ANN wave function against more conventional parametrizations based on two- and three-body Jastrow functions, and virtually exact Green's function Monte Carlo results.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Investigation of Computational Corrections to X-Ray Computed Tomography for Dimensional Metrology of Complex Additively Manufactured Parts

X-ray computed tomography (CT) is a nondestructive evaluation technique that may be used to image complex internal features without the line-of-sight restrictions inherent in conventional optical and contact (stylus) metrology instrumentation. Applications of CT metrology include material defects (porosity), dimensions and surface texture. However, scan artifacts, such as streaking, caused primarily by beam hardening and scatter, limit the accuracy of CTbased metrology. Reduction of these artifacts would improve the accuracy material properties and dimensional metrology information. This paper reports on the development of additively manufactured (AM) Ti5553 and 316L measurement phantoms with integral lattice (lattice) structures specifically designed to exhibit these artifacts. The phantoms were scanned in three CT systems and a scanning-probe CMM measurement. Surfaces generated from uncorrected CT data exhibited “dimple” defects that are not present in the CMM measurement. Correction methods were developed in Livermore Tomography Tools (LTT) software and this paper reports on the successful correction of these artifacts. This work is expected to have application in areas where characterization of defects, dimensions and surface texture using CT are critical.

42 ENGINEERING↗

Computing water flow through complex landscapes – Part 3: Fill–Spill–Merge: flow routing in depression hierarchies

Abstract. Depressions – inwardly draining regions – are common to many landscapes. When there is sufficient moisture, depressions take the form of lakes and wetlands; otherwise, they may be dry. Hydrological flow models used in geomorphology, hydrology, planetary science, soil and water conservation, and other fields often eliminate depressions through filling or breaching; however, this can produce unrealistic results. Models that retain depressions, on the other hand, are often undesirably expensive to run. In previous work we began to address this by developing a depression hierarchy data structure to capture the full topographic complexity of depressions in a region. Here, we extend this work by presenting the Fill–Spill–Merge algorithm that utilizes our depression hierarchy data structure to rapidly process and distribute runoff. Runoff fills depressions, which then overflow and spill into their neighbors. If both a depression and its neighbor fill, they merge. We provide a detailed explanation of the algorithm and results from two sample study areas. In these case studies, the algorithm runs 90–2600 times faster (with a reduction in compute time of 2000–63 000 times) than the commonly used Jacobi iteration and produces a more accurate output. Complete, well-commented, open-source code with 97 % test coverage is available on GitHub and Zenodo.

58 GEOSCIENCES↗

On coarse projective integration for atomic deposition in amorphous systems

Direct molecular dynamics simulation of atomic deposition under realistic conditions is notoriously challenging because of the wide range of time scales that must be captured. Numerous simulation approaches have been proposed to address the problem, often requiring a compromise between model fidelity, algorithmic complexity, and computational efficiency. Coarse projective integration, an example application of the “equation-free” framework, offers an attractive balance between these constraints. Here, periodically applied, short atomistic simulations are employed to compute time derivatives of slowly evolving coarse variables that are then used to numerically integrate differential equations over relatively large time intervals. A key obstacle to the application of this technique in realistic settings is the “lifting” operation in which a valid atomistic configuration is recreated from knowledge of the coarse variables. Using Ge deposition on amorphous SiO{sub 2} substrates as an example application, we present a scheme for lifting realistic atomistic configurations comprised of collections of Ge islands on amorphous SiO{sub 2} using only a few measures of the island size distribution. The approach is shown to provide accurate initial configurations to restart molecular dynamics simulations at arbitrary points in time, enabling the application of coarse projective integration for this morphologically complex system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

New Methods of Uncertainty Quantification for Mixed Discrete-Continuous Variable Models

The scale and complexity of problems such as designing power grids or planning for climate change is growing rapidly, driving the development of complicated computer models. More complex models have longer run times and incorporate larger numbers of inputs, both continuous and discrete. For example, a detailed physics model may have continuous variables such as temperature, height or pressure along with discrete variables that indicate the choice of a material for a particular piece or the model to be used to calculate air flow. A power grid design model may have continuous variables such as generation capacity, power flow or demand along with discrete variables such as number of generators, number of transmission lines or binary variables to indicate whether or not a node is chosen for generation expansion. A growing awareness of uncertainty and the desire to make risk-informed decisions is causing uncertainty quantification (UQ) to be more routine and often required. UQ provides the underpinnings necessary to establish confidence in models and their use; therefore, much time and effort is being invested in creating efficient approaches for UQ. However, these efforts have been focused on models that take continuous variables as inputs. When discrete inputs are thrown into the mix, the basic approach is to repeat the UQ analysis for each combination of discrete inputs or some subset thereof; this rapidly becomes intractable. Because of the computational complexity inherent in mixed discrete-continuous models, researchers will focus on the uncertainty in their particular problem finding ways to take advantage of symmetries, simplifications or structures. For example, uncertainty propagation in certain dynamical systems can be efficiently carried out after various decomposition steps or uncertainty propagation in stochastic programming is confined to scenario generation. Unfortunately models are not always available for such machinations: models may be embedded in legacy codes, may utilize commercial off the shelf codes or may be created by stringing a series of codes together. It is also time consuming to start each problem from scratch; worse there may not be any simplifications or symmetries to take advantage of. For these situations a UQ method developed for any black box function is necessary. This report documents a new conceptual model for performing UQ for mixed discrete-continuous models which not only applies to any simulator function, but allows the use of the efficient UQ methods that have been developed for continuous inputs only. The conceptual model is presented and an estimation procedure is fleshed out for one class of problems. This is applied to variations of a mixed discrete-continuous optimization test problem. This procedure provides comparable results to a benchmark solution with fewer function evaluations.

Bauman, Lara E.↗

Conforming Morse-Smale Complexes

Morse-Smale (MS) complexes have been gaining popularity as a tool for feature-driven data analysis and visualization. However, the quality of their geometric embedding and the sole dependence on the input scalar field data can limit their applicability when expressing application-dependent features. In this paper we introduce a new combinatorial technique to compute an MS complex that conforms to both an input scalar field and an additional, prior segmentation of the domain. The segmentation constrains the MS complex computation guaranteeing that boundaries in the segmentation are captured as separatrices of the MS complex. We demonstrate the utility and versatility of our approach with two applications. First, we use streamline integration to determine numerically computed basins/mountains and use the resulting segmentation as an input to our algorithm. This strategy enables the incorporation of prior flow path knowledge, effectively resulting in an MS complex that is as geometrically accurate as the employed numerical integration. Our second use case is motivated by the observation that often the data itself does not explicitly contain features known to be present by a domain expert. We introduce edit operations for MS complexes so that a user can directly modify their features while maintaining all the advantages of a robust topology-based representation.

97 MATHEMATICS AND COMPUTING↗

Complex functionality with minimal computation: Promise and pitfalls of reduced‐tracer ocean biogeochemistry models

Abstract Earth System Models increasingly include ocean biogeochemistry models in order to predict changes in ocean carbon storage, hypoxia, and biological productivity under climate change. However, state‐of‐the‐art ocean biogeochemical models include many advected tracers, that significantly increase the computational resources required, forcing a trade‐off with spatial resolution. Here, we compare a state‐of‐the art model with 30 prognostic tracers (TOPAZ) with two reduced‐tracer models, one with 6 tracers (BLING), and the other with 3 tracers (miniBLING). The reduced‐tracer models employ parameterized, implicit biological functions, which nonetheless capture many of the most important processes resolved by TOPAZ. All three are embedded in the same coupled climate model. Despite the large difference in tracer number, the absence of tracers for living organic matter is shown to have a minimal impact on the transport of nutrient elements, and the three models produce similar mean annual preindustrial distributions of macronutrients, oxygen, and carbon. Significant differences do exist among the models, in particular the seasonal cycle of biomass and export production, but it does not appear that these are necessary consequences of the reduced tracer number. With increasing CO 2 , changes in dissolved oxygen and anthropogenic carbon uptake are very similar across the different models. Thus, while the reduced‐tracer models do not explicitly resolve the diversity and internal dynamics of marine ecosystems, we demonstrate that such models are applicable to a broad suite of major biogeochemical concerns, including anthropogenic change. These results are very promising for the further development and application of reduced‐tracer biogeochemical models that incorporate “sub‐ecosystem‐scale” parameterizations.

58 GEOSCIENCES↗

Insights into Molecular Magnetism in Metal–Metal Bonded Systems as Revealed by a Spectroscopic and Computational Analysis of Diiron Complexes

A pair of bimetallic compounds featuring Fe–Fe bonds, [Fe( i PrNPPh 2 ) 3 FeR] (R = PMe 3 , ≡N t Bu), have been investigated using High-Frequency Electron Paramagnetic Resonance (HFEPR) as well as field- and temperature-dependent 57 Fe nuclear γ resonance (Mössbauer) spectroscopy. To gain insight into the local site electronic structure, we have concurrently studied a compound containing a single Fe(II) in a geometry analogous to that of one of the dimer sites. Our spectroscopic studies have allowed for the assessment of the electronic structure via the determination of the zero-field splitting and 57 Fe hyperfine parameters for the entire series. We also report on our efforts to correlate structure with physical properties in metal–metal bonded systems using ligand field theory guided by quantum chemical calculations. Through the insight gained in this study, we discuss strategies for the design of single-molecule magnets based on polymetallic compounds linked via direct metal–metal bonds.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Thermodynamic, spectroscopic, and computational studies of lanthanide complexation with Diethylenetriaminepentaacetic acide: temperature effect and coordination modes

Stability constants of two DTPA (diethylenetriaminepentaacetic acid) complexes with lanthanides (ML2- and MHL-, where M stands for Nd and Eu and L stands for diethylenetriaminepentaacetate) at 10, 25, 40, 55, and 70 degrees C were determined by potentiometry, absorption spectrophotometry, and luminescence spectroscopy. The enthalpies of complexation at 25 degrees C were determined by microcalorimetry. Thermodynamic data show that the complexation of Nd3þ and Eu3þ with DTPA is weakened at higher temperatures, a 10-fold decrease in the stability constants of ML2- and MHL- as the temperature is increased from 10 to 70 degrees C. The effect of temperature is consistent with the exothermic enthalpy of complexation directly measured by microcalorimetry. Results by luminescence spectroscopy and density functional theory (DFT) calculations suggest that DTPA is octa-dentate in both the EuL2- and EuHL- complexes and, for the first time, the coordination mode in the EuHL- complex was clarified by integration of the experimental data and DFT calculations. In the EuHL- complex, the Eu is coordinated by an octa-dentate H(DTPA) ligand and a water molecule, and the protonation occurs on the oxygen of a carboxylate group.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DFT and TD-DFT computation of charge transfer complex between o-phenylenediamine and 3,5-dinitrosalicylic acid

DFT and TD-DFT studies of o-phenylenediamine (PDA), 3,5-dinitrosalicylic acid (DNSA) and their charge transfer complex have been carried out at B3LYP/6-311G(d,p) level of theory. Molecular geometry and various other molecular properties like natural atomic charges, ionization potential, electron affinity, band gap, natural bond orbital (NBO) and frontier molecular analysis have been presented at same level of theory. Frontier molecular orbital and natural bond orbital analysis show the charge delocalization from PDA to DNSA.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗