Results for “parallel methods” — Page 87

DOE OSTI2015

Gear-box fault detection using time-frequency based methods

Gear-box fault monitoring and detection is important for optimization of power generation and availability of wind turbines. The current industrial approach is to use condition monitoring systems, which runs in parallel with the wind turbine control system, using expensive additional sensors. An alternative would be to use the existing measurements which are normally available for the wind turbine control system. The usage of these sensors instead would cut down the cost of the wind turbine by not using additional sensors. One of these available measurements is the generator speed, in which changes in the gear-box resonance frequency can be detected. Two different time-frequency based approaches are presented in this paper. One is a filter based approach and the other is based on a Karhunen-Loeve basis. Both of them detects the gear-box fault with an acceptable detection delay.

Odgaard, Peter Fogh↗

DOE OSTI2021

Dakota A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis (V.6.14) (Theory Manual)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Theory Manual (V.6.15)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

PROPERTIES OF A CORONAL SHOCK WAVE AS A DRIVER OF EARLY SEP ACCELERATION

Coronal mass ejectmons (CMEs) are thought to drive collisionless shocks in the solar corona, which in turn have been shown to be capable of accelerating solar energetic particles (SEPs) in minutes. It has been notoriously difficult to extract information about energetic particle spectra in the corona, owing to a lack of in situ measurements. It is possible, however, to combine remote observations with data-driven models in order to deduce coronal shock properties relevant to the local acceleration of SEPs and their heliospheric connectivity to near-Earth space. We present such novel analysis applied to the 2011 May 11 CME event on the western solar limb, focusing on the evolution of the eruption-driven, dome-like shock wave observed by the Atmospheric Imaging Assembly (AIA) EUV telescopes on board the Solar Dynamics Observatory spacecraft. We analyze the shock evolution and estimate its strength using emission measure modeling. We apply a new method combining a geometric model of the shock front with a potential field source surface model to estimate time-dependent field-to-shock angles and heliospheric connectivity during shock passage in the low corona. We find that the shock was weak, with an initial speed of ∼450 km s{sup –1}. It was initially mostly quasi-parallel, but a significant portion of it turned quasi-perpendicular later in the event. There was good magnetic connectivity to near-Earth space toward the end of the event as observed by the AIA instrument. The methods used in this analysis hold a significant potential for early characterization of coronal shock waves and forecasting of SEP spectra based on remote observations.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2023

Moments-based interface reconstruction, remap and advection

Here, we present a new moment-of-fluid (MOF 2 ) interface reconstruction method. It uses the zeroth, first, and second moments of the fragment of material inside a cell of the mesh to reconstruct a convex material polygon or a union of convex polygons that approximate the respective material fragment. The new method requires information about the material moments only for the cell under consideration. The MOF 2 method allows to exactly reproduce several convex shapes: corners, filaments, and some concave shapes: cell-complements to corners and filaments. Interface reconstruction is formulated as a local (for each cell), non-linear, equality constrained optimization problem, which does not require additional communication and allows for an efficient parallel implementation. We present an extensive set of test problems, both for interface reconstruction on a single cell, and for reconstruction of a variety of shapes on a variety of meshes. We describe how to perform two-material advection using the MOF 2 method and present the results for the classical advection tests. We also show the examples of material interface remapping needed in the framework of multi-material arbitrary Lagrangian-Eulerian methods, and give a brief description of a procedure that can be used to update the material moments on the Lagrangian stage of those methods.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Scalable Bayesian optimization with randomized prior networks

Several fundamental problems in science and engineering consist of global optimization tasks involving unknown high-dimensional (black-box) functions that map a set of controllable variables to the outcomes of an expensive experiment. Bayesian Optimization (BO) techniques are known to be effective in tackling global optimization problems using a relatively small number objective function evaluations, but their performance suffers when dealing with high-dimensional outputs. To overcome the major challenge of dimensionality, here we propose a deep learning framework for BO and sequential decision making based on bootstrapped ensembles of neural architectures with randomized priors. Using appropriate architecture choices, we show that the proposed framework can approximate functional relationships between design variables and quantities of interest, even in cases where the latter take values in high-dimensional vector spaces or even infinite-dimensional function spaces. In the context of BO, we augmented the proposed probabilistic surrogates with re-parameterized Monte Carlo approximations of multiple-point (parallel) acquisition functions, as well as methodological extensions for accommodating black-box constraints and multi-fidelity information sources. We test the proposed framework against state-of-the-art methods for BO and demonstrate superior performance across several challenging tasks with high-dimensional outputs, including a constrained multi-fidelity optimization task involving shape optimization of rotor blades in turbo-machinery.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Quantum transport modelling of silicon nanobeams using heterogeneous computing scheme

We report the development of a powerful method for quantum transport calculations of nanowire/nanobeam structures with large cross sectional area. Our approach to quantum transport is based on Green's functions and tight-binding potentials. A linear algebraic formulation allows us to harness the massively parallel nature of Graphics Processing Units (GPUs) and our implementation is based on a heterogeneous parallel computing scheme with traditional processors and GPUs working together. Using our software tool, the electronic and quantum transport properties of silicon nanobeams with a realistic cross sectional area of ∼22.7 nm{sup 2} and a length of ∼81.5 nm—comprising 105 000 Si atoms and 24 000 passivating H atoms in the scattering region—are investigated. The method also allows us to perform significant averaging over impurity configurations—all possible configurations were considered in the case of single impurities. Finally, the effect of the position and number of vacancy defects on the transport properties was considered. It is found that the configurations with the vacancies lying closer to the local density of states (LDOS) maxima have lower transmission functions than the configurations with the vacancies located at LDOS minima or far away from LDOS maxima, suggesting both a qualitative method to tune or estimate optimal impurity configurations as well as a physical picture that accounts for device variability. Finally, we provide performance benchmarks for structures as large as ∼42.5 nm{sup 2} cross section and ∼81.5 nm length.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

Parallel simulation via SPPARKS of on-lattice kinetic and Metropolis Monte Carlo models for materials processing

Abstract SPPARKS is an open-source parallel simulation code for developing and running various kinds of on-lattice Monte Carlo models at the atomic or meso scales. It can be used to study the properties of solid-state materials as well as model their dynamic evolution during processing. The modular nature of the code allows new models and diagnostic computations to be added without modification to its core functionality, including its parallel algorithms. A variety of models for microstructural evolution (grain growth), solid-state diffusion, thin film deposition, and additive manufacturing (AM) processes are included in the code. SPPARKS can also be used to implement grid-based algorithms such as phase field or cellular automata models, to run either in tandem with a Monte Carlo method or independently. For very large systems such as AM applications, the Stitch I/O library is included, which enables only a small portion of a huge system to be resident in memory. In this paper we describe SPPARKS and its parallel algorithms and performance, explain how new Monte Carlo models can be added, and highlight a variety of applications which have been developed within the code.

36 MATERIALS SCIENCE↗

DOE OSTI2017

Triton: Igiugig Fish Video Analysis (Project Report)

This document summarizes the analysis of video data collected around the Ocean Renewable Power Company’s RivGen® device in the Kvichak River during July and August 2015. Human (manual) analysis of the data was undertaken and used to develop automated algorithms to detect fish in the frames and describe interaction behavior. In addition, a web application, EyeSea, was developed to combine manual and automated processing, so that ultimately the automated algorithms could be used to identify where human analysis was needed (i.e., when fish are present in video frames). The aim of the project was to develop algorithms that could identify video frames with fish present that could then be used to enable faster manual analysis. However, the project has also identified recommendations for future data collection, and research that could help analysis and interpretation. The manual analysis started to look at all data from the start of the deployment; this was to ensure rare events were seen, and initially focused on night-time data when more fish were present. This process highlighted the amount of time taken to identify fish, and ultimately only 42.33 hours of video were reviewed due to the time-consuming analysis. The data were classified as ‘Fish’, when the reviewer was confident it was a fish, and ‘Maybe’ fish, when it was difficult to distinguish. This was based on the movement, shape and color characteristics. ‘Fish’ were further classified as ‘adult’, ‘juvenile’, or ‘unidentifiable’. Behavioral attributes were noted, which were broadly divided into passive and avoidance activities. In over 42 hours data, there were only 20 potential contact interactions, of which 3 were ‘Maybe’ classifications, 12 were juveniles and 5 were adults; on only one occasion was an actual contact confirmed, and this was an adult fish with the camera, not the turbine itself. This also highlights the difficulties associated with confirming a strike or collision event as occurring or being a near-miss. More interactions were detected at night; this was probably biased by nighttime artificial light use, which may have attracted fish, but also could have increased detection probability as the light is reflected from the fish itself. For the algorithm development, background subtraction, optical flow, and deep learning techniques were considered. The deep learning approach was determined as needing too much training data for this application, and therefore was not continued. The optical flow analysis was considered promising, but did not give immediate results, so would need further investigation. Therefore, background subtraction was the main focus. Three methods of background subtraction were tried: Robust Principal Components Analysis (RPCA), Gaussian Mixture Model (GMM) and Video Background Extraction(ViBE). A classification technique was then applied to the foreground images to determine fish presence. Using this combination, it was found that fish could be accurately detected when occupying more pixels (>200 pixels, 98.2% correct; 100-200 pixels, 99.6% correct; 5-100 pixels, 85.4% correct; 2-5 pixels, 66.3% correct). In parallel, EyeSea was developed to convert the video data to a usable form and to enable manual and automated analysis of the data that would have a standardized output. Recommendations for further research, and standardized methods for data collection are given.

13 HYDRO ENERGY↗

DOE OSTI2016

Analysis of the static magnetic field-dependent optical transmission of Ni nanorod colloidal suspensions

The magnetic field-dependent optical transmission of dilute Ni nanorod aqueous suspensions was investigated. A series of four samples of nanorods were synthesized using the AAO template method and processed to stable colloids. The distributions of their length and diameter were characterized by analysis of TEM images and revealed average diameters of ∼25 nm and different lengths in the range of 60 nm–1100 nm. The collinear magnetic and optical anisotropy was studied by static field-dependent transmission measurements of linearly polarized light parallel and perpendicular to the magnetic field direction. The experimental results were modelled assuming the field-dependent orientation distribution function of a superparamagnetic ensemble for the uniaxial ferromagnetic nanorods in liquid dispersion and extinction cross sections for longitudinal and transversal optical polarization derived from different approaches, including the electrostatic approximation and the separation of variables method, both applied to spheroidal particles, as well as finite element method simulations of spheroids and capped cylindrical particles. The extinction cross sections were compared to reveal the differences associated with the approximations of homogeneous polarization and/or particle shape. The consequences of these approximations for the quantitative analysis of magnetic field-dependent optical transmission measurements were investigated and a reliable protocol derived. Furthermore, the changes in optical cross sections induced by electromagnetic interaction between two nanorods in parallel end-to-end and side-by-side configuration as a function of their separation were studied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2015

3D localization of electrophysiology catheters from a single x-ray cone-beam projection

Purpose: X-ray images allow the visualization of percutaneous devices such as catheters in real time but inherently lack depth information. The provision of 3D localization of these devices from cone beam x-ray projections would be advantageous for interventions such as electrophysiology (EP), whereby the operator needs to return a device to the same anatomical locations during the procedure. A method to achieve real-time 3D single view localization (SVL) of an object of known geometry from a single x-ray image is presented. SVL exploits the change in the magnification of an object as its distance from the x-ray source is varied. The x-ray projection of an object of interest is compared to a synthetic x-ray projection of a model of said object as its pose is varied. Methods: SVL was tested with a 3 mm spherical marker and an electrophysiology catheter. The effect of x-ray acquisition parameters on SVL was investigated. An independent reference localization method was developed to compare results when imaging a catheter translated via a computer controlled three-axes stage. SVL was also performed on clinical fluoroscopy image sequences. A commercial navigation system was used in some clinical image sequences for comparison. Results: SVL estimates exhibited little change as x-ray acquisition parameters were varied. The reproducibility of catheter position estimates in phantoms denoted by the standard deviations, (σ{sub x}, σ{sub y}, σ{sub z}) = (0.099 mm, 0.093 mm, 2.2 mm), where x and y are parallel to the detector plane and z is the distance from the x-ray source. Position estimates (x, y, z) exhibited a 4% systematic error (underestimation) when compared to the reference method. The authors demonstrated that EP catheters can be tracked in clinical fluoroscopic images. Conclusions: It has been shown that EP catheters can be localized in real time in phantoms and clinical images at fluoroscopic exposure rates. Further work is required to characterize performance in clinical images as well as the sensitivity to clinical image quality.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2017

Accelerating Lattice QCD Multigrid on GPUs Using Fine-Grained Parallelization

The past decade has witnessed a dramatic acceleration of lattice quantum chromodynamics calculations in nuclear and particle physics. This has been due to both significant progress in accelerating the iterative linear solvers using multi-grid algorithms, and due to the throughput improvements brought by GPUs. Deploying hierarchical algorithms optimally on GPUs is non-trivial owing to the lack of parallelism on the coarse grids, and as such, these advances have not proved multiplicative. Using the QUDA library, we demonstrate that by exposing all sources of parallelism that the underlying stencil problem possesses, and through appropriate mapping of this parallelism to the GPU architecture, we can achieve high efficiency even for the coarsest of grids. Results are presented for the Wilson-Clover discretization, where we demonstrate up to 10x speedup over present state-of-the-art GPU-accelerated methods on Titan. Finally, we look to the future, and consider the software implications of our findings.

Clark, M. A.↗

DOE OSTI2015

CHOLLA: A NEW MASSIVELY PARALLEL HYDRODYNAMICS CODE FOR ASTROPHYSICAL SIMULATION

We present Computational Hydrodynamics On ParaLLel Architectures (Cholla ), a new three-dimensional hydrodynamics code that harnesses the power of graphics processing units (GPUs) to accelerate astrophysical simulations. Cholla models the Euler equations on a static mesh using state-of-the-art techniques, including the unsplit Corner Transport Upwind algorithm, a variety of exact and approximate Riemann solvers, and multiple spatial reconstruction techniques including the piecewise parabolic method (PPM). Using GPUs, Cholla evolves the fluid properties of thousands of cells simultaneously and can update over 10 million cells per GPU-second while using an exact Riemann solver and PPM reconstruction. Owing to the massively parallel architecture of GPUs and the design of the Cholla code, astrophysical simulations with physically interesting grid resolutions (≳256{sup 3}) can easily be computed on a single device. We use the Message Passing Interface library to extend calculations onto multiple devices and demonstrate nearly ideal scaling beyond 64 GPUs. A suite of test problems highlights the physical accuracy of our modeling and provides a useful comparison to other codes. We then use Cholla to simulate the interaction of a shock wave with a gas cloud in the interstellar medium, showing that the evolution of the cloud is highly dependent on its density structure. We reconcile the computed mixing time of a turbulent cloud with a realistic density distribution destroyed by a strong shock with the existing analytic theory for spherical cloud destruction by describing the system in terms of its median gas density.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2020

Dakota A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis: Version 6.12 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Dakota A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis (V.6.14) (User's Manual)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a users manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.13 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis (V.6.16 User's Manual)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.16 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota’s iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗