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,405 records · Page 78

Wang–Landau approach to the simulation of water clusters

The Wang–Landau Monte Carlo method [Wang FG, Landau DP. Efficient, multiple-range random walk algorithm to calculate the density of states. Phys Rev Lett. 2001;86:2050-2053; Determining the density of states for classical statistical models: a random walk algorithm to produce a flat histogram. Phys Rev E. 2001;64:056101] has been established as an effective computational approach for studying complex systems. In this study, we review the properties of 6 popular empirical water potentials, including a recently proposed explicit 3-body potential, obtained by applying the Wang–Landau method to the simulation of water clusters. Finally, comparing to numerous classical and first principle calculations, we show that several classical water models can provide a consistent description of the structural and thermodynamical properties of water clusters partially in agreement of ab initio results, although they were designed to reproduce macroscopic properties of water at ambient conditions.

74 ATOMIC AND MOLECULAR PHYSICS↗

A LINK TO THE PAST: USING MARKOV CHAIN MONTE CARLO FITTING TO CONSTRAIN FUNDAMENTAL PARAMETERS OF HIGH-REDSHIFT GALAXIES

We have developed a new method for fitting spectral energy distributions (SEDs) to identify and constrain the physical properties of high-redshift (4 < z < 8) galaxies. Our approach uses an implementation of Bayesian based Markov Chain Monte Carlo that we have dubbed '{pi}MC{sup 2}'. It allows us to compare observations to arbitrarily complex models and to compute 95% credible intervals that provide robust constraints for the model parameters. The work is presented in two sections. In the first, we test {pi}MC{sup 2} using simulated SEDs to not only confirm the recovery of the known inputs but to assess the limitations of the method and identify potential hazards of SED fitting when applied specifically to high-redshift (z > 4) galaxies. In the second part of the paper we apply {pi}MC{sup 2} to thirty-three 4 < z < 8 objects, including the spectroscopically confirmed Grism ACS Program for Extragalactic Science Ly{alpha} sample (4 < z < 6), supplemented by newly obtained Hubble Space Telescope/WFC3 near-IR observations, and several recently reported broadband selected z > 6 galaxies. Using {pi}MC{sup 2}, we are able to constrain the stellar mass of these objects and in some cases their stellar age and find no evidence that any of these sources formed at a redshift larger than z = 8, a time when the universe was Almost-Equal-To 0.6 Gyr old.

79 ASTRONOMY AND ASTROPHYSICS↗

Many-body perturbation theory for understanding optical excitations in organic molecules and solids

Semiconductors composed of organic molecules are promising as components for flexible and inexpensive optoelectronic devices, with many recent studies aimed at understanding their electronic and optical properties. In particular, computational modeling of these complex materials has provided new understanding of the underlying properties which give rise to their excited-state phenomena. Here, this article provides an overview of recent many-body perturbation theory (MBPT) studies of optical excitations within organic molecules and solids. We discuss the accuracy of MBPT within the GW/BSE approach in predicting excitation energies and absorption spectra, and assess the impact of two commonly used approximations, the DFT starting point and the Tamm–Dancoff approximation. Moreover, we summarize studies that elucidate the role of solid-state structure on the nature of excitons in organic crystals. These studies show that a rich physical understanding of organic materials can be obtained from GW/BSE.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Preliminary Introduction of a Free Vortex Wake Method Into OpenFAST

Increasing wind turbine size can have substantial economic benefits. However, increasing wind turbine turbine size requires the use of models that accurately capture the aerodynamic response to large deflections and nonstraight blade geometries. Additionally, the installation of offshore floating turbines requires turbine models that can handle large rotor motion. Free vortex wake (FVW) methods are capable of modeling this type of complex physics while remaining computationally tractable to perform the many simulations necessary for turbine design. In this work, a FVW model is added to the National Renewable Energy Laboratory engineering tool OpenFAST to allow for the aerodynamic modeling of highly flexible turbines along with the aero-hydro-servo-elastic response capabilities of OpenFAST. Code implementation is not complete and thus no results are presented. However, areas of potential modeling improvement are discussed, such as modifications to the circulation calculation and the need for different FVW input model specifications when high-thrust cases are being modeled.

17 WIND ENERGY↗

STAR Data Production Workflow on HPC: Lessons Learned & Best Practices

The Solenoidal Tracker at RHIC (STAR) is a multi-national supported experiment located at Brookhaven National Lab. The raw physics data captured from the detector is on the order of tens of PBytes per data acquisition campaign, which makes STAR fit well within the definition of a big data science experiment. The production of the data has typically run on standard nodes or on standard Grid computing environments. All embedding simulations (complex workflow mixing real and simulated events) have been run on standard Linux resources at the National Energy Research Scientific Computing Center (NERSC) aka PDSF. However, HPC resources such as Cori have become available for STAR's data production as well as embedding, and STAR has been the very first experiment to show feasibility of running a sustainable data production campaign on this computing resource. The use of Docker containers with Shifter is required to run on HPC @ NERSC - this approach encapsulates the environment in which a standard STAR workflow runs. From the deployment of a tailored Scientific Linux environment (requiring many of its own libraries and special configurations required to run) to the deployment of third-party software and the STAR specific software stack, it has become impractical to rely on a set of containers containing each specific software release. To this extent, solutions based on the CERN VM File System (CVMFS) for the deployment of software and services have been employed in HENP, but one needs to make careful scalability considerations when using a resource like Cori, such as not allowing all software to be deployed in containers or bare node. Additionally, CVMFS clients are not compatible on Cori nodes and one needs to rely on an indirect NFS/DVS mount scheme. In our contribution, we will discuss our strategies from the past and our current solution based on CVMFS. Furthermore, running on HPC is not a simple task as each aspect of the workflow must be enabled to scale, run efficiently, and the workflow needs to fit within the boundaries of the provided queue system (SLURM in this case). Lastly, we will also discuss what we have learned so far about what is the best method for grouping jobs to maximize a single 48 core HPC node within a specific time frame and maximize our workflow efficiency.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Automation of User Analysis Workflow in CMS

CMS has a distributed computing model, based on a hierarchy of tiered regional computing centres. However, the end physicist is not interested in the details of the computing model nor the complexity of the underlying infrastructure, but only to a ccess and use efficiently and easily the remote services. The CMS Remote Analysis Builder (CRAB) is the official CMS tool that allows the access to the distributed data in a transparent way. We present the current development direction, which is focused o n improving the interface presented to the user and adding intelligence to CRAB such that it can be used to automate more and more the work done on behalf of user. We also present the status of deployment of the CRAB system and the lessons learnt in deplo ying this tool to the CMS collaboration.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Integration of PanDA workload management system with Titan supercomputer at OLCF

The PanDA (Production and Distributed Analysis) workload management system (WMS) was developed to meet the scale and complexity of LHC distributed computing for the ATLAS experiment. While PanDA currently distributes jobs to more than 100,000 cores at well over 100 Grid sites, the future LHC data taking runs will require more resources than Grid computing can possibly provide. To alleviate these challenges, ATLAS is engaged in an ambitious program to expand the current computing model to include additional resources such as the opportunistic use of supercomputers. We will describe a project aimed at integration of PanDA WMS with Titan supercomputer at Oak Ridge Leadership Computing Facility (OLCF). The current approach utilizes a modified PanDA pilot framework for job submission to Titan’s batch queues and local data management, with light-weight MPI wrappers to run single threaded workloads in parallel on Titan’s multi-core worker nodes. It also gives PanDA new capability to collect, in real time, information about unused worker nodes on Titan, which allows precise definition of the size and duration of jobs submitted to Titan according to available free resources. This capability significantly reduces PanDA job wait time while improving Titan’s utilization efficiency. This implementation was tested with a variety of Monte-Carlo workloads on Titan and is being tested on several other supercomputing platforms.

97 MATHEMATICS AND COMPUTING↗

Quantum Krylov subspace algorithms for ground- and excited-state energy estimation

Quantum Krylov subspace diagonalization (QKSD) algorithms provide a low-cost alternative to the conventional quantum phase estimation algorithm for estimating the ground- and excited-state energies of a quantum many-body system. While QKSD algorithms typically rely on using the Hadamard test for estimating Krylov subspace matrix elements of the form $\langle \phi_i|e^{-\widehat{H}τ}|\phi_j\rangle$, the associated quantum circuits require an ancilla qubit with controlled multiqubit gates that can be quite costly for near-term quantum hardware. In this paper, we show that a wide class of Hamiltonians relevant to condensed-matter physics and quantum chemistry contain symmetries that can be exploited to avoid the use of the Hadamard test. We propose a multifidelity estimation protocol that can be used to compute such quantities, showing that our approach, when combined with efficient single-fidelity estimation protocols, provides a substantial reduction in circuit depth. In addition, here we develop a unified theory of quantum Krylov subspace algorithms and present three quantum-classical algorithms for the ground- and excited-state energy estimation problems, where each algorithm provides various advantages and disadvantages in terms of total number of calls to the quantum computer, gate depth, classical complexity, and stability of the generalized eigenvalue problem within the Krylov subspace.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient grid-based method in nonequilibrium Green's function calculations: Application to model atoms and molecules

The finite-element discrete variable representation is proposed to express the nonequilibrium Green's function for strongly inhomogeneous quantum systems. This method is highly favorable against a general basis approach with regard to numerical complexity, memory resources, and computation time. Its flexibility also allows for an accurate representation of spatially extended Hamiltonians and thus opens the way toward a direct solution of the two-time Schwinger-Keldysh-Kadanoff-Baym equations on spatial grids, including, for example, the description of highly excited states in atoms. As benchmarks, we compute and characterize, in Hartree-Fock and second Born approximations, the ground states of the He atom, the H{sub 2} molecule, and the LiH molecule in one spatial dimension. Thereby, the ground-state and binding energies, densities, and bond lengths are compared with the direct solution of the time-dependent Schroedinger equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Uncertainty quantification in breakup reactions

Breakup reactions are one of the favored probes to study loosely bound nuclei, particularly those in the limit of stability forming a halo. In order to interpret such breakup experiments, the continuum discretized coupled channel method is typically used. In this study, the first Bayesian analysis of a breakup reaction model is performed. Herein we use a combination of statistical methods together with a three-body reaction model (the continuum discretized coupled channel method) to quantify the uncertainties on the breakup observables due to the parameters in the effective potential describing the loosely bound projectile of interest. The combination of tools we develop opens the path for a Bayesian analysis of not only breakup processes, but also a wide array of complex processes that require computationally intensive reaction models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Computation of the spectral density of two-point functions: Complex masses, cut rules, and beyond

We present a steepest descent calculation of the Kaellen-Lehmann spectral density of two-point functions involving complex conjugate masses in Euclidean space. This problem occurs in studies of (gauge) theories with Gribov-like propagators. As the presence of complex masses and the use of Euclidean space brings the theory outside of the strict validity of the Cutkosky cut rules, we discuss an alternative method based on the Widder inversion operator of the Stieltjes transformation. It turns out that the results coincide with those obtained by naively applying the cut rules. We also point out the potential usefulness of the Stieltjes (inversion) formalism when nonstandard propagators are used, in which case cut rules are not available at all.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Growth interactions between icosahedral quasicrystals

We investigate the solidification pathways of a population of icosahedral quasicrystals in a liquid through in situ synchrotron x-ray tomography. The wealth of three-dimensional space- and time-resolved data enables us to test the predictions of various models and theories of crystallization on a quasi-crystal-forming alloy. Remarkably, we find the general evolution equation—that accounts for the competing effects of growth, coalescence, and coarsening—fits well our experimental data on surface area concentration. Furthermore, we quantify the orientation selection, screening length, and coarsening rate of the dodecahedra, and compare these results to that of periodic crystals. The latter is a full order of magnitude smaller than that of elemental metal dendrites in the limit of zero volume fraction, a reflection of the low solid-liquid interfacial energy of the icosahedral phase. Furthermore, our paper provides the critical input data for microstructural models used for integrated computational materials engineering of complex intermetallics, including quasicrystals.

36 MATERIALS SCIENCE↗

A Real-Time Implementation and Validation of Federated Learning for Grid Services

Grid-edge devices are becoming increasingly important in the energy transition. Preserving privacy was not previously considered an important aspect for power grid operations, but with the increased proliferation of customer-owned assets, it is now an essential consideration. Several mechanisms have been proposed to provide privacy for non-utility owned assets in the power grid. Federated learning (FL) is one method gaining prominence in this area. Although FL has been used for other applications, such as auto-complete in phones, there has not been much investigation into whether these approaches are feasible for grid applications. In this work, we use a research platform with real-time simulators and hardware-in-the-loop capabilities to investigate how FL can be applied to grid-edge devices, and we present the potential grid services that can be derived for these devices. We discuss the computational challenges with deploying complex FL approaches, and we explore several grid services, including participation in retail electricity markets, voltage control, and resilience-driven reconfiguration.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distilling Knowledge from Ensembles of Cluster-Constrained-Attention Multiple-Instance Learners for Whole Slide Image Classification

The peculiar nature of whole slide imaging (WSI), digitizing conventional glass slides to obtain multiple high resolution images which capture microscopic details of a patient’s histopathological features, has garnered increased interest from the computer vision research community over the last two decades. Given the unique computational space and time complexity inherent to gigapixel-size whole slide image data, researchers have proposed novel machine learning algorithms to aid in the performance of diagnostic tasks in clinical pathology. One effective algorithm represents a Whole slide image as a bag of smaller image patches, which can be represented as low-dimension image patch embeddings. Weakly supervised deep-learning methods, such as cluster-constrained-attention multiple instance learning (CLAM), have shown promising results when combined with image patch embeddings. While traditional ensemble classifiers yield improved task performance, such methods come with a steep cost in model complexity. Through knowledge distillation, it is possible to retain some performance improvements from an ensemble, while minimizing costs to model complexity. In this work, we implement a weakly supervised ensemble using clustering-constrained-attention multiple-instance learners (CLAM), which uses attention and instance-level clustering to identify task salient regions and feature extraction in whole slides. By applying logit-based and attention-based knowledge distillation, we show it is possible to retain some performance improvements resulting from the ensemble at zero cost to model complexity.

Alamudun, Folami↗

Efficient Unitary Designs from Random Sums and Permutations

A unitary k-design is an ensemble of unitaries that matches the first k moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(k poly (n)) many gates. The k dependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-N expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension N.

algebra↗

On the Impact of Widening Vector Registers on Sequence Alignment

Vector extensions, such as SSE, have been part of the x86 since the 1990s, with applications in graphics, signal processing, and scientific applications. Although many algorithms and applications can naturally benefit from automatic vectorization techniques, there are still many that are difficult to vectorize due to their dependence on irregular data structures, dense branch operations, or data dependencies. Sequence alignment, one of the most widely used operations in bioinformatics workflows, has a computational footprint that features complex data dependencies. In this paper, we demonstrate that the trend of widening vector registers adversely affects the state-of-the-art sequence alignment algorithm based on striped data layouts. We present a practically efficient SIMD implementation of a parallel scan based sequence alignment algorithm that can better exploit wider SIMD units. We conduct comprehensive workload and use case analyses to characterize the relative behavior of the striped and scan approaches and identify the best choice of algorithm based on input length and SIMD width.

Needleman-Wunsch↗

On Residual Stresses and Reference Temperatures in Thermomechanical Simulations of Photovoltaic Modules Using the Finite Element Method

Thermomechanical simulation of photovoltaic (PV) modules using the finite element method (FEM) is a useful tool to evaluate module design features in terms of structural integrity, reliability, and durability. One of the main challenges in the numerical modeling of a PV module is the incorporation of residual stresses induced by the manufacturing process. Modeling assumptions and abstractions are necessary to limit the model complexity and reduce the computational time. However, oversimplifications and incorrect assumptions can lead to erroneous numerical results. Unfortunately, much simulation work still neglects process-induced stresses. This can lead to incorrect predictions of the stress-strain history and erroneous conclusions during the design process. In this work, we review current modeling practices for incorporating process-induced stresses, and contrast numerical models that consider residual stresses with those that neglect them. We find that the simulation objective and available material properties dictate which process steps need to be modeled, and explore in depth the modeling of residual stresses induced by the lamination process. We demonstrate that a simplified cooldown procedure at the beginning of the simulation can increase the model accuracy and discuss appropriate choices for starting and reference temperatures in the finite element model.

14 SOLAR ENERGY↗