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 667 records · Page 37

Optimal net-load balancing in smart grids with high PV penetration

Mitigating mismatches in supply demand curve is critical for smooth power grid operation. Traditionally, load curtailment techniques such as Demand Response (DR) have been used for this purpose. However, smart grids with high PV penetration sometimes exhibit supply surplus causing over-voltages. Thus, load curtailment techniques cannot be the only component of a net-load balancing framework. Supply curtailment techniques such as Volt-Var Optimizations are complex and computationally expensive. This increases the complexity of net-load balancing systems used by the grid operator and limits their scalability. Recently, new technologies have been developed that enable the rapid and selective connection of PV modules of an installation to the grid. Taking advantage of these advancements, we develop a unified optimal net-load balancing framework which performs both load and solar curtailment. We show that when the available curtailment values are discrete, this problem is NP-hard and develop bounded approximation algorithms for minimizing the curtailment cost. Our algorithms produce fast solutions, given the tight timing constraints required for grid operation. We also incorporate the notion of fairness to ensure that curtailment is evenly distributed among all the nodes. Finally, we develop an online algorithm which performs net-load balancing using only data available for the current interval. Using both theoretical analysis and practical evaluations, we show that our net-load balancing algorithms provide solutions which are close to optimal in a small amount of time.

14 SOLAR ENERGY↗

Modeling, Simulation and Analysis of Complex Networked Systems: A Program Plan for DOE Office of Advanced Scientific Computing Research

Many complex systems of importance to the U.S. Department of Energy consist of networks of discrete components. Examples are cyber networks, such as the internet and local area networks over which nearly all DOE scientific, technical and administrative data must travel, the electric power grid, social networks whose behavior can drive energy demand, and biological networks such as genetic regulatory networks and metabolic networks. In spite of the importance of these complex networked systems to all aspects of DOE's operations, the scientific basis for understanding these systems lags seriously behind the strong foundations that exist for the 'physically-based' systems usually associated with DOE research programs that focus on such areas as climate modeling, fusion energy, high-energy and nuclear physics, nano-science, combustion, and astrophysics. DOE has a clear opportunity to develop a similarly strong scientific basis for understanding the structure and dynamics of networked systems by supporting a strong basic research program in this area. Such knowledge will provide a broad basis for, e.g., understanding and quantifying the efficacy of new security approaches for computer networks, improving the design of computer or communication networks to be more robust against failures or attacks, detecting potential catastrophic failure on the power grid and preventing or mitigating its effects, understanding how populations will respond to the availability of new energy sources or changes in energy policy, and detecting subtle vulnerabilities in large software systems to intentional attack. This white paper outlines plans for an aggressive new research program designed to accelerate the advancement of the scientific basis for complex networked systems of importance to the DOE. It will focus principally on four research areas: (1) understanding network structure, (2) understanding network dynamics, (3) predictive modeling and simulation for complex networked systems, and (4) design, situational awareness and control of complex networks. The program elements consist of a group of Complex Networked Systems Research Institutes (CNSRI), tightly coupled to an associated individual-investigator-based Complex Networked Systems Basic Research (CNSBR) program. The CNSRI's will be principally located at the DOE National Laboratories and are responsible for identifying research priorities, developing and maintaining a networked systems modeling and simulation software infrastructure, operating summer schools, workshops and conferences and coordinating with the CNSBR individual investigators. The CNSBR individual investigator projects will focus on specific challenges for networked systems. Relevancy of CNSBR research to DOE needs will be assured through the strong coupling provided between the CNSBR grants and the CNSRI's.

97 MATHEMATICS AND COMPUTING↗

Computing the shape gradient of stellarator coil complexity with respect to the plasma boundary

Coil complexity is a critical consideration in stellarator design. The traditional two-step optimization approach, in which the plasma boundary is optimized for physics properties and the coils are subsequently optimized to be consistent with this boundary, can result in plasma shapes which cannot be produced with sufficiently simple coils. To address this challenge, we propose a method to incorporate considerations of coil complexity in the optimization of the plasma boundary. Coil complexity metrics are computed from the current potential solution obtained with the REGCOIL code (Landreman, Nucl. Fusion , vol. 57, 2017, 046003). While such metrics have previously been included in derivative-free fixed-boundary optimization (Drevlak et al. , Nucl. Fusion , vol. 59, 2018, 016010), we compute the local sensitivity of these metrics with respect to perturbations of the plasma boundary using the shape gradient (Landreman & Paul, Nucl. Fusion , vol. 58, 2018, 076023). We extend REGCOIL to compute derivatives of these metrics with respect to parameters describing the plasma boundary. In keeping with previous research on winding surface optimization (Paul et al. , Nucl. Fusion , vol. 58, 2018, 076015), the shape derivatives are computed with a discrete adjoint method. In contrast with the previous work, derivatives are computed with respect to the plasma surface parameters rather than the winding surface parameters. To further reduce the resolution required to compute the shape gradient, we present a more efficient representation of the plasma surface which uses a single Fourier series to describe the radial distance from a coordinate axis and a spectrally condensed poloidal angle. This representation is advantageous over the standard cylindrical representation used in the VMEC code (Hirshman & Whitson, Phys. Fluids , vol. 26, 1983, pp. 3553–3568), as it provides a uniquely defined poloidal angle, eliminating a null space in the optimization of the plasma surface. In comparison with previous spectral condensation methods (Hirshman & Breslau, Phys. Plasmas , vol. 5, 1998, p. 2664), the modified poloidal angle is obtained algebraically rather than through the solution of a nonlinear optimization problem. The resulting shape gradient highlights features of the plasma boundary that are consistent with simple coils and can be used to couple coil and fixed-boundary optimization.

Physics↗

Complex optimization for big computational and experimental neutron datasets

Here, we present a framework to use high performance computing to determine accurate solutions to the inverse optimization problem of big experimental data against computational models. We demonstrate how image processing, mathematical regularization, and hierarchical modeling can be used to solve complex optimization problems on big data. We also demonstrate how both model and data information can be used to further increase solution accuracy of optimization by providing confidence regions for the processing and regularization algorithms. Finally, we use the framework in conjunction with the software package SIMPHONIES to analyze results from neutron scattering experiments on silicon single crystals, and refine first principles calculations to better describe the experimental data.

36 MATERIALS SCIENCE↗

Spectroscopic and computational investigations of organometallic complexation of group 12 transition metals by methanobactins from Methylocystis sp. SB2

Methanotrophic bacteria catalyze the aerobic oxidation of methane to methanol using Cu-containing enzymes, thereby exerting a modulating influence on the global methane cycle. To facilitate the acquisition of Cu ions, some methanotrophic bacteria secrete small modified peptides known as “methanobactins,” which strongly bind Cu and function as an extracellular Cu recruitment relay, analogous to siderophores and Fe. In addition to Cu, methanobactins form complexes with other late transition metals, including the Group 12 transition metals Zn, Cd, and Hg, although the interplay among solution-phase configurations, metal interactions, and the spectroscopic signatures of methanobactin-metal complexes remains ambiguous. In this study, the complexation of Zn, Cd, and Hg by methanobactin from Methylocystis sp. strain SB2 was studied using a combination of absorbance, fluorescence, extended x-ray absorption fine structure (EXAFS) spectroscopy, and time-dependent density functional theory (TD-DFT) calculations. We report changes in sample absorbance and fluorescence spectral dynamics, which occur on a wide range of experimental timescales and characterize a clear stoichiometric complexation dependence. Mercury L3-edge EXAFS and TD-DFT calculations suggest a linear model for Hg--S coordination, and TD-DFT suggests a tetrahedral model for Zn 2+ and Cd 2+ . We observed an enhancement in the fluorescence of methanobactin upon interaction with transition metals and propose a mechanism of complexation-hindered isomerization drawing inspiration from the wild-type Green Fluorescent Protein active site. Collectively, our results represent the first combined computational and experimental spectroscopy study of methanobactins and shed new light on molecular interactions and dynamics that characterize complexes of methanobactins with Group 12 transition metals.

59 BASIC BIOLOGICAL SCIENCES↗

Generalized quasiharmonic approximation via space group irreducible derivatives

The quasiharmonic approximation (QHA) is the simplest nontrivial approximation for interacting phonons under constant pressure, bringing the effects of anharmonicity into temperature-dependent observables. Nonetheless, the QHA is often implemented with additional approximations due to the complexity of computing phonons under arbitrary strains, and the generalized QHA, which employs constant stress boundary conditions, has not been completely developed. In this work we formulate the generalized QHA, providing a practical algorithm for computing the strain state and other observables as a function of temperature and true stress. We circumvent the complexity of computing phonons under arbitrary strains by employing irreducible second-order displacement derivatives of the Born-Oppenheimer potential and their strain dependence, which are efficiently and precisely computed using the lone irreducible derivative approach. We formulate two complementary strain parametrizations: a discretized strain grid interpolation and a Taylor series expansion in symmetrized strain. We illustrate our approach by evaluating the temperature and pressure dependence of select elastic constants and the thermal expansion in thoria (ThO 2 ) using density functional theory with three exchange-correlation functionals. The QHA results are compared to our measurements of the elastic constant tensor using time-domain Brillouin scattering and inelastic neutron scattering. Our irreducible derivative approach simplifies the implementation of the generalized QHA, which will facilitate reproducible, data-driven applications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Solving differential‐algebraic equations in power system dynamic analysis with quantum computing

Abstract Power system dynamics are generally modeled by high dimensional non‐linear differential‐algebraic equations (DAEs) given a large number of components forming the network. These DAEs' complexity can grow exponentially due to the increasing penetration of distributed energy resources, whereas their computation time becomes sensitive due to the increasing interconnection of the power grid with other energy systems. This paper demonstrates the use of quantum computing algorithms to solve DAEs for power system dynamic analysis. We leverage a symbolic programming framework to equivalently convert the power system's DAEs into ordinary differential equations (ODEs) using index reduction methods and then encode their data into qubits using amplitude encoding. The system non‐linearity is captured by Hamiltonian simulation with truncated Taylor expansion so that state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can solve the power system's DAEs accurately with a computational complexity polynomial in the logarithm of the system dimension. We also illustrate the use of recent advanced tools in scientific machine learning for implementing complex computing concepts, that is, Taylor expansion, DAEs/ODEs transformation, and quantum computing solver with abstract representation for power engineering applications.

computational complexity↗

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↗