Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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,459 records · Page 81

Massively parallel Monte Carlo for many-particle simulations on GPUs

Current trends in parallel processors call for the design of efficient massively parallel algorithms for scientific computing. Parallel algorithms for Monte Carlo simulations of thermodynamic ensembles of particles have received little attention because of the inherent serial nature of the statistical sampling. In this paper, we present a massively parallel method that obeys detailed balance and implement it for a system of hard disks on the GPU. We reproduce results of serial high-precision Monte Carlo runs to verify the method. This is a good test case because the hard disk equation of state over the range where the liquid transforms into the solid is particularly sensitive to small deviations away from the balance conditions. On a Tesla K20, our GPU implementation executes over one billion trial moves per second, which is 148 times faster than on a single Intel Xeon E5540 CPU core, enables 27 times better performance per dollar, and cuts energy usage by a factor of 13. With this improved performance we are able to calculate the equation of state for systems of up to one million hard disks. These large system sizes are required in order to probe the nature of the melting transition, which has been debated for the last forty years. In this paper we present the details of our computational method, and discuss the thermodynamics of hard disks separately in a companion paper.

97 MATHEMATICS AND COMPUTING↗

Computing resonant modes of accelerator cavities by solving nonlinear eigenvalue problems via rational approximation

Here, we present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems arising from the modeling of particle accelerator cavities. The eigenvalue nonlinearity in these problems results from the use of waveguides to couple external power sources or to allow certain excited electromagnetic modes to exit the cavity. We use a rational approximation to reduce the nonlinear eigenvalue problem first to a rational eigenvalue problem. We then apply a special linearization procedure to turn the rational eigenvalue problem into a larger linear eigenvalue problem with the same eigenvalues, which can be solved by existing iterative methods. By using a compact scheme to represent both the linearized operator and the eigenvectors to be computed, we obtain a numerical method that only involves solving linear systems of equations of the same dimension as the original nonlinear eigenvalue problem. We refer to this method as a compact rational Krylov (CORK) method. We implemented the CORK method in the Omega3P module of the Advanced Computational Electromagnetic 3D Parallel (ACE3P) simulation suite and validated it by comparing the computed cavity resonant frequencies and damping Q factors of a small model problem to those obtained from a fitting procedure that uses frequency responses computed by another ACE3P module called S3P. We also used the CORK method to compute trapped modes damped in an ideal eight 9-cell SRF cavity cryomodule. This was the first time it was possible to compute these modes directly. The damping Q factors of the computed modes match well with those measured in experiments and the difference in resonant frequencies is within the range introduced by cavity imperfection. Therefore, the CORK method is an extremely valuable tool for computational cavity design.

43 PARTICLE ACCELERATORS↗

Estimation of distributions via multilevel Monte Carlo with stratified sampling

We design and implement a novel algorithm for computing a multilevel Monte Carlo (MLMC) estimator of the joint cumulative distribution function (CDF) of a vector-valued quantity of interest in problems with random input parameters and initial conditions. Our approach combines MLMC with stratified sampling of the input sample space by replacing standard Monte Carlo at each level with stratified Monte Carlo initialized with proportionally allocated samples. We show that the resulting stratified MLMC (sMLMC) algorithm is more efficient than its standard MLMC counterpart due to the additional variance reduction provided by the stratification of the random parameter's domain, especially at the coarsest levels. Additional computational cost savings are obtained by smoothing the indicator function with a Gaussian kernel, which proves to be an efficient and robust alternative to recently developed polynomial-based techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast neural network training on a cluster of GPUs for action recognition with high accuracy

In this work, we propose algorithms and techniques to accelerate training of deep neural networks for action recognition on a cluster of GPUs. The convergence analysis of our algorithm shows it is possible to reduce communication cost and at the same time minimize the number of iterations needed for convergence. We customize the Adam optimizer for our distributed algorithm to improve efficiency. In addition, we employ transfer-learning to further reduce training time while improving validation accuracy. For the UCF101 and HMDB51 datasets, the validation accuracies achieved are 93.1% and 67.9% respectively. With an additional end-to-end trained temporal stream, the validation accuracies achieved for UCF101 and HMDB51 are 93.47% and 81.24% respectively. As far as we know, these are the highest accuracies achieved with the two-stream approach using ResNet that does not involve computationally expensive 3D convolutions or pretraining on much larger datasets.

97 MATHEMATICS AND COMPUTING↗

Debunking common myths in coastal circulation modeling

Despite tremendous progress in algorithm development, computational efficiency and transition into operations over the past two decades, coastal modeling still lacks scientific rigor due to proliferation of many ‘gray’ areas related to various modeling choices made by modelers. Here, in this paper, we propose some guiding principles for the modeling community to improve performance, and we also debunk commonly held myths that make the coastal modeling lack rigor. Using our own experience in developing seamless cross-scale unstructured-grid based models for the past two decades, we describe in unprecedented detail the end-to-end modeling process (i.e., from digital elevation models (DEMs) to mesh generation to post analysis), and demonstrate that defensible modeling is within reach for any end user by following three guiding principles: (1) Bathymetry is a first order forcing in coastal domains and thus should be respected in all aspects of modeling; (2) Oceanographic processes are driven across multiple spatial scales and so models should enable appropriate resolution as needed; and (3) Model assessment should focus on physical processes. Through qualitative and quantitative model assessments, we demonstrate the fundamental role played by bathymetry/topography as embedded in DEMs in making the results defensible, which is unfortunately glossed over in many modeling studies. Focusing on process-based assessment simplifies the calibration process. A major conclusion of this work is that model developers and operators should maximize the scientific rigor for in silico oceanography by avoiding some common pitfalls that rely on error compensation at the expense of representation of physical system processes. We present some best practice procedures for defensive and trustworthy numerical modeling.

54 ENVIRONMENTAL SCIENCES↗

Multiobjective Particle Swarm Optimization for the optimal design of photovoltaic grid-connected systems

Particle Swarm Optimization (PSO) is a highly efficient evolutionary optimization algorithm. In this paper a multiobjective optimization algorithm based on PSO applied to the optimal design of photovoltaic grid-connected systems (PVGCSs) is presented. The proposed methodology intends to suggest the optimal number of system devices and the optimal PV module installation details, such that the economic and environmental benefits achieved during the system's operational lifetime period are both maximized. The objective function describing the economic benefit of the proposed optimization process is the lifetime system's total net profit which is calculated according to the method of the Net Present Value (NPV). The second objective function, which corresponds to the environmental benefit, equals to the pollutant gas emissions avoided due to the use of the PVGCS. The optimization's decision variables are the optimal number of the PV modules, the PV modules optimal tilt angle, the optimal placement of the PV modules within the available installation area and the optimal distribution of the PV modules among the DC/AC converters. (author)

14 SOLAR ENERGY↗

Resilient NdFeB magnet recycling under the impacts of COVID-19 pandemic: Stochastic programming and Benders decomposition

Neodymium-iron-boron (NdFeB) magnets are the most powerful magnets per unit volume sold in the commercial market. Despite the increasing demand for clean energy applications such as electric vehicles and wind turbines, disruptive events including the COVID-19 pandemic have caused significant uncertainties in the supply and demand for NdFeB magnets. Therefore, this study aims to alleviate the risk of supply shortage for NdFeB magnets and the containing critical materials, rare-earth elements (REEs), through the development of a resilient reverse supply chain and logistics network design. We develop scenarios to model the unique impact of the COVID-19 pandemic on the proposed business, incorporating both disruption intensity and recovery rate. We formulate a chance-constrained two-stage stochastic programming model to maximize the profit while guaranteeing the network resiliency against disruption risks. To solve the problem in large-scale instances, we develop an efficient Benders decomposition algorithm that reduces the computational time by 98.5% on average compared to the default CPLEX algorithm. When applied to the United States, the model suggests the optimal facility locations, processing capacities, inventory levels, and material flows for NdFeB magnet recyclers that could meet 99.7% of the demand. To the best of our knowledge, this study is the first to incorporate the impacts of the COVID-19 pandemic to design a resilient NdFeB magnet recycling supply chain and logistics network, leveraging risk-averse stochastic programming.

42 ENGINEERING↗

Distribution–Based Global Sensitivity Analysis in Hydrology

Global sensitivity analysis (GSA) is routinely used in academic setting to quantify the influence of input variability and uncertainty on predictions of a quantity of interest. Practical applications of GSA are hampered by its high computational cost, which arises from the need to run large (e.g., groundwater) models multiple times, and by its reliance on the analysis of variance, which formally requires input parameters to be uncorrelated. The former difficulty can be alleviated by replacing expensive models with inexpensive (e.g., polynomial) surrogates, while adoption of distribution-based (rather than variance-based) metrics can, in principle, overcome the latter but at significantly increased computational cost. To make use of distribution-based GSA feasible for regional-scale models with a large number of degrees of freedom, we supplement it with a surrogate model built with polynomial chaos expansions with analytically updated coefficients. Here, we demonstrate the computational efficiency of our algorithm on a case study dealing with evaluation of the effects of temperature variability on annual evapotranspiration at the regional scale.

42 ENGINEERING↗

A Particle-Based Conditional Sampling Scheme for the Simulation of Transport in Fractured Rock With Diffusion Into Stagnant Water and Rock Matrix

In situ experiments and field-scale characterization studies have pointed out that, in fractured crystalline media, groundwater flow is highly channelized. This implies that, at the scale of a single fracture, only part of the fracture surface area is in contact with flowing water, while the rest of in-plane water is essentially stagnant and can be accessed by solutes via molecular diffusion. Despite their importance for contaminant retention, to date, there are no numerical or analytical approaches that could be used to assess the implication of stagnant water zones on solute transport in realistic large-scale Discrete Fracture Network-based models. In this study, we present an efficient and flexible algorithm for the simulation of transport in fractured rock with diffusion into stagnant water and rock matrix. The algorithm is a generalization of a previously developed numerical framework for time domain particle tracking in sparsely fractured rock. The key of the generalization is that total time in fracture (τ f ) is first evaluated using a Monte Carlo sampling and then a second sampling is performed conditioned on τ f . The algorithm has been successfully validated against existing independent solutions and the implication of diffusion into stagnant water and secondary diffusion into the matrix has been assessed for a realistic modeling scenario. The results show that, due to diffusion into stagnant water, contaminants are more strongly retarded. This increased retention is more significant for sorbing species, as a larger number of sorption sites is accessible. A high sensitivity to the flowing channel/stagnant water zone geometry has also been observed.

54 ENVIRONMENTAL SCIENCES↗

Predicting phase behavior of grain boundaries with evolutionary search and machine learning

The study of grain boundary phase transitions is an emerging field until recently dominated by experiments. The major bottleneck in the exploration of this phenomenon with atomistic modeling has been the lack of a robust computational tool that can predict interface structure. Here we develop a computational tool based on evolutionary algorithms that performs efficient grand-canonical grain boundary structure search and we design a clustering analysis that automatically identifies different grain boundary phases. Its application to a model system of symmetric tilt boundaries in Cu uncovers an unexpected rich polymorphism in the grain boundary structures. We find new ground and metastable states by exploring structures with different atomic densities. Our results demonstrate that the grain boundaries within the entire misorientation range have multiple phases and exhibit structural transitions, suggesting that phase behavior of interfaces is likely a general phenomenon.

36 MATERIALS SCIENCE↗

Advances in Kriging-Based Autonomous X-Ray Scattering Experiments

Autonomous experimentation is an emerging paradigm for scientific discovery, wherein measurement instruments are augmented with decision-making algorithms, allowing them to autonomously explore parameter spaces of interest. We have recently demonstrated a generalized approach to autonomous experimental control, based on generating a surrogate model to interpolate experimental data, and a corresponding uncertainty model, which are computed using a Gaussian process regression known as ordinary Kriging (OK). We demonstrated the successful application of this method to exploring materials science problems using x-ray scattering measurements at a synchrotron beamline. Here, we report several improvements to this methodology that overcome limitations of traditional Kriging methods. The variogram underlying OK is global and thus insensitive to local data variation. We augment the Kriging variance with model-based measures, for instance providing local sensitivity by including the gradient of the surrogate model. As with most statistical regression methods, OK minimizes the number of measurements required to achieve a particular model quality. However, in practice this may not be the most stringent experimental constraint; e.g. the goal may instead be to minimize experiment duration or material usage. We define an adaptive cost function, allowing the autonomous method to balance information gain against measured experimental cost. We provide synthetic and experimental demonstrations, validating that this improved algorithm yields more efficient autonomous data collection.

36 MATERIALS SCIENCE↗

Improved particle-flow event reconstruction with scalable neural networks for current and future particle detectors

Abstract Efficient and accurate algorithms are necessary to reconstruct particles in the highly granular detectors anticipated at the High-Luminosity Large Hadron Collider and the Future Circular Collider. We study scalable machine learning models for event reconstruction in electron-positron collisions based on a full detector simulation. Particle-flow reconstruction can be formulated as a supervised learning task using tracks and calorimeter clusters. We compare a graph neural network and kernel-based transformer and demonstrate that we can avoid quadratic operations while achieving realistic reconstruction. We show that hyperparameter tuning significantly improves the performance of the models. The best graph neural network model shows improvement in the jet transverse momentum resolution by up to 50% compared to the rule-based algorithm. The resulting model is portable across Nvidia, AMD and Habana hardware. Accurate and fast machine-learning based reconstruction can significantly improve future measurements at colliders.

Physics↗

Enabling real-time multi-messenger astrophysics discoveries with deep learning

Multi-messenger astrophysics is a fast-growing, interdisciplinary field that combines data, which vary in volume and speed of data processing, from many different instruments that probe the Universe using different cosmic messengers: electromagnetic waves, cosmic rays, gravitational waves and neutrinos. In this Expert Recommendation, we review the key challenges of real-time observations of gravitational wave sources and their electromagnetic and astroparticle counterparts, and make a number of recommendations to maximize their potential for scientific discovery. These recommendations refer to the design of scalable and computationally efficient machine learning algorithms; the cyber-infrastructure to numerically simulate astrophysical sources, and to process and interpret multi-messenger astrophysics data; the management of gravitational wave detections to trigger real-time alerts for electromagnetic and astroparticle follow-ups; a vision to harness future developments of machine learning and cyber-infrastructure resources to cope with the big-data requirements; and finally, the need to build a community of experts to realize the goals of multi-messenger astrophysics.

79 ASTRONOMY AND ASTROPHYSICS↗

Experience with the alpaka performance portability library in the CMS software

ion Library for Parallel Kernel Acceleration) is a header-only C++ library that provides performance portability across different back-ends, abstracting the underlying levels of parallelism. It supports serial and parallel execution on CPUs, and extremely parallel execution on NVIDIA, AMD and Intel GPUs.This contribution will show how alpaka is used in the CMS software to develop and maintain a single code base; to use different toolchains to build the code for each supported back-end, and link them into a single application; to seamlessly select the best backend at runtime, and implement portable reconstruction algorithms that run efficiently on CPUs and GPUs from different vendors. It will describe the validation and deployment of the alpaka-based implementation in the CMS High Level Trigger, and highlight how it achieves near-native performance.

Alawieh, Jaafar [CERN]↗

Fluid electrons with kinetic closure for long wavelength energetic particles driven modes

A kinetic electron closure scheme is presented for the fluid electron model that has been implemented in the GEM code [J. Lang, Y. Chen, S. E. Parker, and G.-Y. Fu, Phys. Plasmas 16, 102101 (2009)]. The most important element of the closure scheme is a complete Ohm's law for the parallel electric field E{sub ||}, derived by combining the quasineutrality condition, the Ampere's equation and the v{sub ||} moment of the gyrokinetic equations. A discretization method for the closure scheme is presented and studied in detail for a three-dimensional shearless slab plasma. It is found that for long wavelength shear Alfven waves the kinetic closure scheme is both more accurate and more robust than the previous GEM algorithm [Y. Chen and S. E. Parker, J. Comput. Phys. 189, 463 (2003)], whereas for the ion-gradient-driven instability the previous algorithm is more efficient. The fluid electron model with kinetic electron closure is useful for studying energetic particles driven modes with electron kinetic damping effects.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Multiscale modeling of polyisoprene on graphite

The local dynamics and the conformational properties of polyisoprene next to a smooth graphite surface constructed by graphene layers are studied by a multiscale methodology. First, fully atomistic molecular dynamics simulations of oligomers next to the surface are performed. Subsequently, Monte Carlo simulations of a systematically derived coarse-grained model generate numerous uncorrelated structures for polymer systems. A new reverse backmapping strategy is presented that reintroduces atomistic detail. Finally, multiple extensive fully atomistic simulations with large systems of long macromolecules are employed to examine local dynamics in proximity to graphite. Polyisoprene repeat units arrange close to a parallel configuration with chains exhibiting a distribution of contact lengths. Efficient Monte Carlo algorithms with the coarse-grain model are capable of sampling these distributions for any molecular weight in quantitative agreement with predictions from atomistic models. Furthermore, molecular dynamics simulations with well-equilibrated systems at all length-scales support an increased dynamic heterogeneity that is emerging from both intermolecular interactions with the flat surface and intramolecular cooperativity. This study provides a detailed comprehensive picture of polyisoprene on a flat surface and consists of an effort to characterize such systems in atomistic detail.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Adiabatic state preparation study of methylene

Quantum computers attract much attention as they promise to outperform their classical counterparts in solving certain type of problems. One of them with practical applications in quantum chemistry is simulation of complex quantum systems. An essential ingredient of efficient quantum simulation algorithms are initial guesses of the exact wave functions with high enough fidelity. As was proposed in Aspuru-Guzik et al. [Science 309, 1704 (2005)], the exact ground states can in principle be prepared by the adiabatic state preparation method. Here, we apply this approach to preparation of the lowest lying multireference singlet electronic state of methylene and numerically investigate preparation of this state at different molecular geometries. We then propose modifications that lead to speeding up the preparation process. Finally, we decompose the minimal adiabatic state preparation employing the direct mapping in terms of two-qubit interactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spatial assignment of symmetry adapted perturbation theory interaction energy components: The atomic SAPT partition

We develop a physically-motivated assignment of symmetry adapted perturbation theory for intermolecular interactions (SAPT) into atom-pairwise contributions (the A-SAPT partition). The basic precept of A-SAPT is that the many-body interaction energy components are computed normally under the formalism of SAPT, following which a spatially-localized two-body quasiparticle interaction is extracted from the many-body interaction terms. For electrostatics and induction source terms, the relevant quasiparticles are atoms, which are obtained in this work through the iterative stockholder analysis (ISA) procedure. For the exchange, induction response, and dispersion terms, the relevant quasiparticles are local occupied orbitals, which are obtained in this work through the Pipek-Mezey procedure. The local orbital atomic charges obtained from ISA additionally allow the terms involving local orbitals to be assigned in an atom-pairwise manner. Further summation over the atoms of one or the other monomer allows for a chemically intuitive visualization of the contribution of each atom and interaction component to the overall noncovalent interaction strength. Herein, we present the intuitive development and mathematical form for A-SAPT applied in the SAPT0 approximation (the A-SAPT0 partition). We also provide an efficient series of algorithms for the computation of the A-SAPT0 partition with essentially the same computational cost as the corresponding SAPT0 decomposition. We probe the sensitivity of the A-SAPT0 partition to the ISA grid and convergence parameter, orbital localization metric, and induction coupling treatment, and recommend a set of practical choices which closes the definition of the A-SAPT0 partition. We demonstrate the utility and computational tractability of the A-SAPT0 partition in the context of side-on cation-π interactions and the intercalation of DNA by proflavine. A-SAPT0 clearly shows the key processes in these complicated noncovalent interactions, in systems with up to 220 atoms and 2845 basis functions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗