Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed algorithms”

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,513 records · Page 84

Modified GMDH-NN algorithm and its application for global sensitivity analysis

Global sensitivity analysis (GSA) is a very useful tool to evaluate the influence of input variables in the whole distribution range. Sobol' method is the most commonly used among variance-based methods, which are efficient and popular GSA techniques. High dimensional model representation (HDMR) is a popular way to compute Sobol' indices, however, its drawbacks cannot be ignored. We show that modified GMDH-NN algorithm can calculate coefficients of metamodel efficiently, so this paper aims at combining it with HDMR and proposes GMDH-HDMR method. The new method shows higher precision and faster convergent rate. Several numerical and engineering examples are used to confirm its advantages. - Highlights: • The GMDH-NN is improved to construct the explicit polynomial model of optimal complexity by self-organization. • The paper aims at combining improved GMDH-NN with HDMR expansions and using it to compute Sobol' indices directly. • The method can be applied in uniform, normal and exponential distribution by using suitable orthogonal polynomials. • Engineering examples, e.g., electronic circuit models can be solved by the presented method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, relies on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Experimental evaluation of a spatial resampling technique to improve the accuracy of pencil-beam dose calculation in proton therapy

Purpose: In proton therapy, pencil-beam algorithms (PBAs) are the most widely used dose calculation methods. However, the PB calculations that employ one-dimensional density scaling neglect the effects of lateral density heterogeneity on the dose distributions, whereas some particles included in such pencil beams could overextend beyond the interface of the density heterogeneity. We have simplified a pencil-beam redefinition algorithm (PBRA), which was proposed for electron therapy, by a spatial resampling technique toward an application for proton therapy. The purpose of this study is to evaluate the calculation results of the spatial resampling technique in terms of lateral density heterogeneity by comparison with the dose distributions that were measured in heterogeneous slab phantoms. Methods: The pencil beams are characterized for multiple residual-range (i.e., proton energy) bins. To simplify the PBRA, the given pencil beams are resampled on one or two transport planes, in which smaller sub-beams that are parallel to each other are generated. We addressed the problem of lateral density heterogeneity comparing the calculation results to the dose distributions measured at different depths in heterogeneous slab phantoms using a two-dimensional detector. Two heterogeneity slab phantoms, namely, phantoms A and B, were designed for the measurements and calculations. In phantom A, the heterogeneity slab was placed close to the surface. On the other hand, in phantom B, it was placed close to the Bragg peak in the mono-energetic proton beam. Results: In measurements, lateral dose profiles showed a dose reduction and increment in the vicinity of x= 0 mm in both phantoms at depths z= 142 and 161 mm due to lateral particle disequilibrium. In phantom B, these dose reduction/increment effects were higher/lower, respectively, than those in phantom A. This is because a longer distance from the surface to the heterogeneous slab increases the strength of proton scattering. Sub-beams, which were generated from the resampling plane, formed a detouring/overextending path that was different from that of elemental pencil beams. Therefore, when the spatial resampling was implemented at the surface and immediately upstream of the lateral heterogeneity, the calculation could predict these dose reduction/increment effects. Without the resampling procedure, these dose reduction/increment effects could not be predicted in both phantoms owing to the blurring of the pencil beam. We found that the PBA with the spatial resampling technique predicted the dose reduction/increment at the dose profiles in both phantoms when the sampling plane was defined immediately upstream of the heterogeneous slab. Conclusions: We have demonstrated the implementation of a spatial resampling technique for pencil-beam calculation to address the problem of lateral density heterogeneity. While further validation is required for clinical use, this study suggests that the spatial resampling technique can make a significant contribution to proton therapy.

61 RADIATION PROTECTION AND DOSIMETRY↗

Development and Validation of a Lifecycle-based Prognostics Architecture with Test Bed Validation

On-line monitoring and tracking of nuclear plant system and component degradation is being investigated as a method for improving the safety, reliability, and maintainability of aging nuclear power plants. Accurate prediction of the current degradation state of system components and structures is important for accurate estimates of their remaining useful life (RUL). The correct quantification and propagation of both the measurement uncertainty and model uncertainty is necessary for quantifying the uncertainty of the RUL prediction. This research project developed and validated methods to perform RUL estimation throughout the lifecycle of plant components. Prognostic methods should seamlessly operate from beginning of component life (BOL) to end of component life (EOL). We term this "Lifecycle Prognostics." When a component is put into use, the only information available may be past failure times of similar components used in similar conditions, and the predicted failure distribution can be estimated with reliability methods such as Weibull Analysis (Type I Prognostics). As the component operates, it begins to degrade and consume its available life. This life consumption may be a function of system stresses, and the failure distribution should be updated to account for the system operational stress levels (Type II Prognostics). When degradation becomes apparent, this information can be used to again improve the RUL estimate (Type III Prognostics). This research focused on developing prognostics algorithms for the three types of prognostics, developing uncertainty quantification methods for each of the algorithms, and, most importantly, developing a framework using Bayesian methods to transition between prognostic model types and update failure distribution estimates as new information becomes available. The developed methods were then validated on a range of accelerated degradation test beds. The ultimate goal of prognostics is to provide an accurate assessment for RUL predictions, with as little uncertainty as possible. From a reliability and maintenance standpoint, there would be improved safety by avoiding all failures. Calculated risk would decrease, saving money by avoiding unnecessary maintenance. One major bottleneck for data-driven prognostics is the availability of run-to-failure degradation data. Without enough degradation data leading to failure, prognostic models can yield RUL distributions with large uncertainty or mathematically unsound predictions. To address these issues a "Lifecycle Prognostics" method was developed to create RUL distributions from Beginning of Life (BOL) to End of Life (EOL). This employs established Type I, II, and III prognostic methods, and Bayesian transitioning between each Type. Bayesian methods, as opposed to classical frequency statistics, show how an expected value, a priori, changes with new data to form a posterior distribution. For example, when you purchase a component you have a prior belief, or estimation, of how long it will operate before failing. As you operate it, you may collect information related to its condition that will allow you to update your estimated failure time. Bayesian methods are best used when limited data are available. The use of a prior also means that information is conserved when new data are available. The weightings of the prior belief and information contained in the sampled data are dependent on the variance (uncertainty) of the prior, the variance (uncertainty) of the data, and the amount of measured data (number of samples). If the variance of the prior is small compared to the uncertainty of the data, the prior will be weighed more heavily. However, as more data are collected, the data will be weighted more heavily and will eventually swamp out the prior in calculating the posterior distribution of model parameters. Fundamentally Bayesian analysis updates a prior belief with new data to get a posterior belief. The general approach to applying the Bayesian method to lifecycle prognostics consisted of identifying the prior, which is the RUL estimate and uncertainty from the previous prognostics type, and combining it with observational data related to the newer prognostics type. The resulting lifecycle prognostics algorithm uses all available information throughout the component lifecycle.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Joint reconstruction of x-ray fluorescence and transmission tomography

X-ray fluorescence tomography is based on the detection of fluorescence x-ray photons produced following x-ray absorption while a specimen is rotated; it provides information on the 3D distribution of selected elements within a sample. One limitation in the quality of sample recovery is the separation of elemental signals due to the finite energy resolution of the detector. Another limitation is the effect of self-absorption, which can lead to inaccurate results with dense samples. To recover a higher quality elemental map, we combine x-ray fluorescence detection with a second data modality: conventional x-ray transmission tomography using absorption. By using these combined signals in a nonlinear optimization-based approach, we demonstrate the benefit of our algorithm on real experimental data and obtain an improved quantitative reconstruction of the spatial distribution of dominant elements in the sample. Furthermore, compared with single-modality inversion based on x-ray fluorescence alone, this joint inversion approach reduces ill-posedness and should result in improved elemental quantification and better correction of self-absorption.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

HIERARCHICAL PROBABILISTIC INFERENCE OF COSMIC SHEAR

Point estimators for the shearing of galaxy images induced by gravitational lensing involve a complex inverse problem in the presence of noise, pixelization, and model uncertainties. We present a probabilistic forward modeling approach to gravitational lensing inference that has the potential to mitigate the biased inferences in most common point estimators and is practical for upcoming lensing surveys. The first part of our statistical framework requires specification of a likelihood function for the pixel data in an imaging survey given parameterized models for the galaxies in the images. We derive the lensing shear posterior by marginalizing over all intrinsic galaxy properties that contribute to the pixel data (i.e., not limited to galaxy ellipticities) and learn the distributions for the intrinsic galaxy properties via hierarchical inference with a suitably flexible conditional probabilitiy distribution specification. We use importance sampling to separate the modeling of small imaging areas from the global shear inference, thereby rendering our algorithm computationally tractable for large surveys. With simple numerical examples we demonstrate the improvements in accuracy from our importance sampling approach, as well as the significance of the conditional distribution specification for the intrinsic galaxy properties when the data are generated from an unknown number of distinct galaxy populations with different morphological characteristics.

79 ASTRONOMY AND ASTROPHYSICS↗

Robust Real-Time Modeling of Distribution Systems with Data-Driven Grid-Wise Observability (Final Technical Report)

The overall objective of this project is to leverage existing and emerging sensor measurements to develop data-driven observability enhancement algorithms as well as robust state estimation and parameter identification techniques to enable real-time grid-wise monitoring and modeling of loads and distributed energy resources (DERs). The project resulted in a holistic framework with the following key components: 1) data-driven and machine learning-based grid-edge visibility enhancement, 2) robust branch-current-based state estimation (BCSE), and 3) robust real-time steady-state and dynamic-state modeling of loads and DERs. The research outcomes have provided utility companies better network visibility, higher-fidelity load/DER models, and more accurate assessment of DERs’ impacts, thus, facilitating the integration of renewable energy sources. The synergistic collaborative project among Iowa State University (ISU), Argonne National Laboratory (ANL), Electric Power Research Center (EPRC), SIEMENS Industry, Alliant Energy, Cedar Falls Utilities (CFU), and Maquoketa Valley Electric Cooperative (MVEC) to leverage the team’s extensive expertise and experience in power distribution systems, state estimation, online modeling and identification, and DER integrations. The proposed frameworks have been verified with industry adopted software and attempted integrated with existing tool wherever possible

24 POWER TRANSMISSION AND DISTRIBUTION↗

Understanding the Hierarchy of Dense Subgraphs in Stationary and Temporally Varying Setting

Graphs are widely used to model relationships in a wide variety of domains such as sociology, bioinformatics, infrastructure, the WWW, to name a few. One of the key observations is that while real-world graphs are often globally sparse, they are locally dense. In other words, the average degree is often quite small (say at most 10 in a million vertex graph), but vertex neighborhoods are often dense. Finding dense subgraphs is a critical aspect of graph mining It has been used for finding communities and spam link farms in web graphs, graph visualization, real-time story identification, DNA motif detection in biological networks, finding correlated genes, epilepsy prediction, finding price value motifs in financial data, graph compression, distance query indexing, and increasing the throughput of social networking site servers. However, most standard formulations of this problem (like clique, quasi-clique, k-densest subgraph) are NP-hard. Furthermore, current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without providing any structural relations, whereas the goal is rarely to find the "true optimum," but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. In this project, we first aim to devise algorithms and provide 3 implementations with nice visualizations to find the hierarchy between dense subgraphs, and then understand the structure of the hierarchy to gain more insight on the hidden patterns in real-world networks. Another important aspects in graph analysis is the temporal nature of networks. Networks evolve over time and in many applications data arrives at a high velocity, and thus it is important to design algorithms that can process data efficiently. We report three main results towards identifying dense structures in large evolving graphs. First, we will show how the hierarchical connectedness structure can be maintained efficiently, where connectedness is defined by increasing levels of connectivity strength. Next, we present dense structure can be identified in bipartite graphs without building projection graphs. And finally, we present a new method for peeling algorithms This new approach avoids sequential nature of peeling algorithms and is amenable to parallelization, which is crucial for processing high velocity data.

97 MATHEMATICS AND COMPUTING↗

WE-F-16A-06: Using 3D Printers to Create Complex Phantoms for Dose Verification, Quality Assurance, and Treatment Planning System Commissioning in Radiotherapy

Purpose: To use 3D printers to design and construct complex geometrical phantoms for commissioning treatment planning systems, dose calculation algorithms, quality assurance (QA), dose delivery, and patient dose verifications. Methods: In radiotherapy, complex geometrical phantoms are often required for dose verification, dose delivery and calculation algorithm validation. Presently, fabrication of customized phantoms is limited due to time, expense and challenges in machining of complex shapes. In this work, we designed and utilized 3D printers to fabricate two phantoms for QA purposes. One phantom includes hills and valleys (HV) for verification of intensity modulated radiotherapy for photons, and protons (IMRT and IMPT). The other phantom includes cylindrical cavities (CC) of various sizes for dose verification of inhomogeneities. We evaluated the HV phantoms for an IMPT beam, and the CC phantom to study various inhomogeneity configurations using photon, electron, and proton beams. Gafcromic ™ films were used to quantify the dose distributions delivered to the phantoms. Results: The HV phantom has dimensions of 12 cm × 12 cm and consists of one row and one column of five peaks with heights ranging from 2 to 5 cm. The CC phantom has a size 10 cm × 14 cm and includes 6 cylindrical cavities with length of 7.2 cm and diameters ranging from 0.6 to 1.2 cm. The IMPT evaluation using the HV phantom shows good agreement as compared to the dose distribution calculated with treatment planning system. The CC phantom also shows reasonable agreements for using different algorithms for each beam modalities. Conclusion: 3D printers with submillimiter resolutions are capable of printing complex phantoms for dose verification and QA in radiotherapy. As printing costs decrease and the technology becomes widely available, phantom design and construction will be readily available to any clinic for testing geometries that were not previously feasible.

60 APPLIED LIFE SCIENCES↗

Multiperiod Distribution System Restoration With Routing Repair Crews, Mobile Electric Vehicles, and Soft-Open-Point Networked Microgrids

This paper proposes a distribution system restoration model which is in response to multiple outages caused by natural disasters. The proposed restoration model includes the coordination of routing repair crews (RRCs), mobile batterycarried vehicles (MBCVs), and networked microgrids (NMGs) formed by soft open points (SOPs). The travel and repair time constraints are modeled for each RRC; travel path and charging strategy are modeled for each MBCV; and the network reconfiguration is developed considering the optimal operation of SOP-based NMGs. Furthermore, the proposed model is presented as a mixedinteger linear program which is solved by an auxiliary induce function based algorithm to reduce the computational complexity. The modified IEEE 33-bus and 69-bus distribution systems are tested with multiple outages. The presented results demonstrate the effectiveness of the proposed model

24 POWER TRANSMISSION AND DISTRIBUTION↗

TH-A-19A-04: Latent Uncertainties and Performance of a GPU-Implemented Pre-Calculated Track Monte Carlo Method

Purpose: Assessing the performance and uncertainty of a pre-calculated Monte Carlo (PMC) algorithm for proton and electron transport running on graphics processing units (GPU). While PMC methods have been described in the past, an explicit quantification of the latent uncertainty arising from recycling a limited number of tracks in the pre-generated track bank is missing from the literature. With a proper uncertainty analysis, an optimal pre-generated track bank size can be selected for a desired dose calculation uncertainty. Methods: Particle tracks were pre-generated for electrons and protons using EGSnrc and GEANT4, respectively. The PMC algorithm for track transport was implemented on the CUDA programming framework. GPU-PMC dose distributions were compared to benchmark dose distributions simulated using general-purpose MC codes in the same conditions. A latent uncertainty analysis was performed by comparing GPUPMC dose values to a “ground truth” benchmark while varying the track bank size and primary particle histories. Results: GPU-PMC dose distributions and benchmark doses were within 1% of each other in voxels with dose greater than 50% of Dmax. In proton calculations, a submillimeter distance-to-agreement error was observed at the Bragg Peak. Latent uncertainty followed a Poisson distribution with the number of tracks per energy (TPE) and a track bank of 20,000 TPE produced a latent uncertainty of approximately 1%. Efficiency analysis showed a 937× and 508× gain over a single processor core running DOSXYZnrc for 16 MeV electrons in water and bone, respectively. Conclusion: The GPU-PMC method can calculate dose distributions for electrons and protons to a statistical uncertainty below 1%. The track bank size necessary to achieve an optimal efficiency can be tuned based on the desired uncertainty. Coupled with a model to calculate dose contributions from uncharged particles, GPU-PMC is a candidate for inverse planning of modulated electron radiotherapy and scanned proton beams. This work was supported in part by FRSQ-MSSS (Grant No. 22090), NSERC RG (Grant No. 432290) and CIHR MOP (Grant No. MOP-211360)

07 ISOTOPE AND RADIATION SOURCES↗

Measurement of flow properties coupled to experimental and numerical analyses of dense, granular flows for solar thermal energy storage

Granular flows of sintered bauxite proppants were researched along an inclined plane for solar thermal energy storage applications. Granular flow properties needed to drive numeric granular models were measured for improved numerical model predictions for Carbobead CP 50/140, 40/100, and 30/60 particles. Particle shape and size distributions were determined by coupling optical microscopy to an in-house image processing algorithm. The impulse excitation technique was used to measure elastic and shear moduli, and compute Poisson’s ratio. The coefficient of static sliding friction was measured using the slip-stick method, and the static rolling friction was determined from measured shear on particles positioned between two hot-pressed plates. The coefficient of restitution was measured by dropping particles on a surface and determining the kinetic energy before and after impact with the surface using high resolution particle tracking velocimetry. Particle size did not significantly impact the coefficients of restitution and static rolling friction, however, particle shape distribution resulted in a large variation in measurements. An inclined flow experiment was performed to characterize granular flows of Carbobead CP 30/60 particles using particle image velocimetry. Numerical models of the experiment using discrete element method were generated with the measured mechanical properties as inputs for comparison with experimental results. A constant directional torque rolling friction model best predicted bulk granular flow behavior. Furthermore, good agreement between the model and experiment was achieved at ambient, steady state conditions, with average velocity differences <10%.

14 SOLAR ENERGY↗

Quantum Key Distribution Applicability to Smart Grid Cybersecurity Systems

To meet the increasing demand for electricity and to have a more reliable and resilient electric grid against conventional and extreme events, grid modernization is more crucial now than ever before. This will require the development and deployment of devices that provide advanced communication capabilities. The overall efficiency, reliability, and resilience of the smart grid will be inextricably linked to the exchange of information between these devices. Unfortunately, the increased information flow will increase the potential attack surface and introduce new vulnerabilities. While a smarter grid will depend critically on information flow, these benefits will be accrued only if that information can be protected. Nowadays, information is secured in smart grids primarily through cryptography. However, with the increasing number of sophisticated attacks as well as the increasing computational power, the security of the “classical” cryptographic algorithms is threatened. Quantum information science offers solutions to this problem, specifically quantum key distribution (QKD), which provides a means for the generation and secure distribution of symmetric cryptographic keys. The security of QKD stems ultimately from the very nature of quantum physics. In this paper, we investigate the applicability of QKD to the various smart grid sectors and specific use cases. We have identified 18 smart grid use cases of interest for QKD suitability together with 7 QKD factors used for the assessment of the various use cases. For each use case, the impact to security of the loss of confidentiality, integrity, and/or availability is specified. In addition, the suitability of QKD is assessed for each use case with respect to multiple factors.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Verifying the Computational Integrity of Power Grid Controls with Zero-Knowledge Proof

The control of future power grids is migrating from a centralized to a distributed/decentralized scheme to enable a massive penetration of distributed energy resources with rising dependence on communication infrastructure. A common assumption made for most existing distributed/decentralized controllers is that local controllers would faithfully follow the designated controller dynamics based on the data received from communication channels. However, with increased probability of cyberattacks on Operational Technology infrastructure, such an assumption could be risky because proper execution of the controller dynamics is then built on trust in secure communication and computation. In this work, we leverage a cryptography technology known as zero-knowledge scalable transparent arguments of knowledge (zk-STARK) to verify the computational integrity of power grid control algorithms, with projected linear dynamics-based control schemes as the initial proof-of-concept test case. The method presented here converts the cybersecurity challenge of data integrity for grid control into a subset of computational integrity.

computational integrity↗

SU-E-T-107: Development of a GPU-Based Dose Delivery System for Adaptive Pencil Beam Scanning

Purpose: A description of a GPU-based dose delivery system (G-DDS) to integrate a fast forward planning implementing in real-time the prescribed sequence of pencil beams. The system, which is under development, is designed to evaluate the dose distribution deviations due to range variations and interplay effects affecting mobile tumors treatments. Methods: The Dose Delivery System (DDS) in use at the Italian Centro Nazionale di Adroterapia Oncologica (CNAO), is the starting point for the presented system. A fast and partial forward planning (FP) tool has been developed to evaluate in few seconds the delivered dose distributions using the DDS data (on-line measurements of spot properties, i.e. number of particles and positions). The computation is performed during the intervals between synchrotron spills and, made available at the end of each spill. In the interval between two spills, the G-DDS will evaluate the delivered dose distributions taking into account the real-time target positions measured by a tracking system. The sequence of prescribed pencil beams for the following spill will be adapted taking into account the variations with respect to the original plan due to the target motion. In order to speed up the computation required to modify pencil beams distribution (up to 400 times has been reached), the Graphics Processing Units (GPUs) and advanced Field Programmable Gate Arrays (FPGAs) are used. Results: An existing offline forward planning is going to be optimized for the CUDA architecture: the gain in time will be presented. The preliminary performances of the developed GPU-based FP algorithms will be shown. Conclusion: A prototype of a GPU-based dose delivery system is under development and will be presented. The system workflow will be illustrated together with the approach adopted to integrate the three main systems, i.e. CNAO dose delivery system, fast forward planning, and tumor tracking system.

60 APPLIED LIFE SCIENCES↗

SIMPLE FOREGROUND CLEANING ALGORITHM FOR DETECTING PRIMORDIAL B-MODE POLARIZATION OF THE COSMIC MICROWAVE BACKGROUND

We reconsider the pixel-based, 'template' polarized foreground removal method within the context of a next-generation, low-noise, low-resolution (0.{sup 0}5 FWHM) space-borne experiment measuring the cosmological B-mode polarization signal in the cosmic microwave background (CMB). This method was first applied to polarized data by the Wilkinson Microwave Anisotropy Probe (WMAP) team and further studied by Efstathiou et al. We need at least three frequency channels: one is used for extracting the CMB signal, whereas the other two are used to estimate the spatial distribution of the polarized dust and synchrotron emission. No extra data from non-CMB experiments or models are used. We extract the tensor-to-scalar ratio (r) from simulated sky maps outside the standard polarization mask (P06) of WMAP consisting of CMB, noise (2 {mu}K arcmin), and a foreground model, and find that, even for the simplest three-frequency configuration with 60, 100, and 240 GHz, the residual bias in r is as small as {Delta}r {approx} 0.002. This bias is dominated by the residual synchrotron emission due to spatial variations of the synchrotron spectral index. With an extended mask with f{sub sky} = 0.5, the bias is reduced further down to <0.001.

79 ASTRONOMY AND ASTROPHYSICS↗

A cloud computing approach to massively-parallel distributed stochastic optimization with application to geomechanical reservoir characterization

Many search strategies used to optimize parameters during hydrologic model calibration are inherently limited in that simulations must be performed sequentially in order for the algorithm to converge. As a result, the overall time required to reach a solution increases linearly with the number of steps necessary. In contrast, sampling strategies that attempt to approximate the posterior distribution of the parameters do not require the model simulations to be run in sequence and therefore invite the use of a massively parallel approach across heterogeneous computing environments. We apply a cloud computing methodology to this problem where a head node running on Amazon Web Services continuously produces candidate models that are distributed to arbitrary compute environments to run the simulation, in our case Clemson’s Palmetto cluster computer. Thus the time required to obtain a sufficient number of samples to produce an adequate approximation of the posterior distribution of the parameters is limited by the number of available compute sites. Monte Carlo sampling of the posterior space would be duplicative and inefficient, thus we combine Latin hypercube methods with genetic algorithms to ensure that no large regions of the parameter space are left unexplored, and that high probability regions are investigated thoroughly. We independently assess the fit to different types of data sets without the need to construct a single objective function. Sets of Pareto optimal models are particularly valuable when the quality and information content of data is poorly known or conceptual model errors exist in our simulation. We illustrate our approach for a problem where in situ strain data are used to calibrate the parameters of an oil reservoir in the Avant oil field in Oklahoma. We use well injection and shut-in to stress a deep (500m) confined formation, and observe the geomechanical response using borehole strainmeters installed in the shallow subsurface (30m). These data were then used to calibrate the poroelastic properties of the reservoir and caprock along with the geometry of an elliptic channel associated with the formation. Using our approach we are able to identify issues with model error as well as substantial tradeoffs that occur within the parameters.

inversion, stochastic, geomechanics, poroelastic, ↗