Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic Sampling”

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 739 records · Page 41

Conditional Tree Reduction in the ADAPT Framework

Probabilistic Risk Assessment (PRA) uses fault tree/event tree analysis to evaluate the environmental impacts of nuclear power plants due to internal or external initiating events. In a fault tree, basic failure events are assembled using primarily And/Or logic to determine the combinations of failures that lead to failure of the system as a whole. An event tree is forward-facing, and begins with a single initiating event. From there the analysis considers what event may occur next, and branches out among the possible configurations of occurrence and non-occurrence of that event. This branching continues until end states are reached. End states may include a safe and stable configuration of the plant, or any number of differing failure states. Both fault and event trees require basic event probabilities as inputs to provide insight on the likelihood of different outcomes. PRA has been applied to nuclear power plants as an analysis tool since the 1975 Reactor Safety Study. In a traditional PRA, the order of events is prescribed by the analyst and each event is typically a binary aleatory uncertainty: occurrence or non-occurrence. Discrete dynamic event tree (DDET) analysis eliminates this subjectivity in ordering of events by using the output of a dynamic system model (simulator) to inform the branching. Branching conditions are triggered by the existence of a relevant plant state in the code, and therefore only occur as physically appropriate. The DDET approach also allows consideration of both epistemic and aleatory uncertainties on a phenomenologically and stochastically consistent platform. A DDET may be orders of magnitude larger than a traditional event tree for the same initiating event, as more of the uncertainty space is likely to be explored and the tree does not require manual assembly. Because of the size, manual inspection of the entire DDET is often infeasible. This problem may be approached from the front by reducing the number of sampled branching values or by online pruning of the tree, thus reducing the total number of branches. Utilizing post-processing techniques to draw actionable insights via clustering has also been proposed. One post-processing tool to reduce the DDET according to user-defined rules has been recently implemented in the Analysis of Dynamic Accident Progression Trees (ADAPT) DDET driver code. The tool creates a 'slice' of the DDET comprised of the set of branches that meet a set of user-input rules, for immediate visualization or for further calculations conditional on the rules being met. This extension is expected to ease analysis of the results of large and complex DDETs, leading to greater applicability of DDETs in PRA. It should be emphasized that this tool is a visualization aide and does not impact the theoretical basis of the DDET approach. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A stochastic biomass blending problem in decentralized supply chains

Blending biomass materials of different physical or chemical properties provides an opportunity to adjust the quality of the feedstock to meet the specifications of the conversion platform. We propose a model which identifies the right mix of biomass to optimize the performance of the thermochemical conversion process at the mini-mum cost. This is a chance-constraint programming (CCP) model which takes into account the stochastic nature of biomass quality. The proposed CCP model ensures that process requirements, which are impacted by physical and chemical properties of biomass, are met most of the time. We consider two problem settings, a centralized and a decentralized supply chain. We propose a mixed-integer linear program to model the blending problem in the centralized setting and a bilevel program to model the blending problem in the decentralized setting. We use the sample average approximation method to approximate the chance constraints, and propose solution algorithms to solve this approximation. We develop a case study for South Carolina using data provided by the Billion Ton Study. Based on our results, the blends identified consist mainly of pine and softwood residues. The blends identified and the suppliers selected by both models are different. The cost of the centralized supply chain is 2%–6% lower. The implications of these results are twofold. First, these results could lead to improved collaborations in the supply chain. Second, these results provide an estimate of the approximation error from assuming centralized decision making in the supply chain.

09 BIOMASS FUELS↗

Assessments of epistemic uncertainty using Gaussian stochastic weight averaging for fluid-flow regression

Here, we use Gaussian stochastic weight averaging (SWAG) to assess the epistemic uncertainty associated with neural-network-based function approximation relevant to fluid flows. SWAG approximates a posterior Gaussian distribution of each weight, given training data, and a constant learning rate. Having access to this distribution, it is able to create multiple models with various combinations of sampled weights, which can be used to obtain ensemble predictions. The average of such an ensemble can be regarded as the 'mean estimation', whereas its standard deviation can be used to construct 'confidence intervals', which enable us to perform uncertainty quantification (UQ) with regard to the training process of neural networks. We utilize representative neural-network-based function approximation tasks for the following cases: (i) a two-dimensional circular-cylinder wake; (ii) the DayMET dataset (maximum daily temperature in North America); (iii) a three-dimensional square-cylinder wake; and (iv) urban flow, to assess the generalizability of the present idea for a wide range of complex datasets. SWAG-based UQ can be applied regardless of the network architecture, and therefore, we demonstrate the applicability of the method for two types of neural networks: (i) global field reconstruction from sparse sensors by combining convolutional neural network (CNN) and multi-layer perceptron (MLP); and (ii) far-field state estimation from sectional data with two-dimensional CNN. We find that SWAG can obtain physically-interpretable confidence-interval estimates from the perspective of epistemic uncertainty. This capability supports its use for a wide range of problems in science and engineering.

97 MATHEMATICS AND COMPUTING↗

A Generalized Adjoint Approach for Quantifying Reflector Assembly Discontinuity Factor Uncertainties

Sensitivity-based uncertainty analysis of assembly discontinuity factors (ADFs) can be readily performed using adjoint methods for infinite lattice models. However, there is currently no adjoint-based methodology to obtain uncertainties for ADFs along an interface between a fuel and reflector region. To accommodate leakage effects in a reflector region, a 1D approximation is usually made in order to obtain the homogeneous interface flux required to calculate the ADF. Within this 1D framework an adjoint-based method is proposed that is capable of efficiently calculating ADF uncertainties. In the proposed method the sandwich rule is utilized to relate the covariance of the input parameters of 1D diffusion theory in the reflector region to the covariance of the interface ADFs. The input parameters covariance matrix can be readily obtained using sampling-based codes such as XSUSA or adjoint-based codes such as TSUNAMI. The sensitivity matrix is constructed using a fixed-source adjoint approach for inputs characterizing the reflector region. An analytic approach is then used to determine the sensitivity of the ADFs to fuel parameters using the neutron balance equation. A stochastic approach is used to validate the proposed adjoint-based method.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Comparison of Attila Transport Code with MCNP in the Analysis of Small Modular Reactor Shielding

Of great importance in the design of a nuclear power plant is the evaluation of shielding from the ionizing radiation produced in the core of the nuclear reactor. This requires simulation software to predict the dose rates in the areas of interest. These problems are referred to as deep penetration problems, as they involve the reduction of a radiation field by two or three orders of magnitude or more. This makes accurate analyses difficult for Monte Carlo based solutions that rely on enough particles being sampled in an area of interest. Comparing the simulation of the same modeled system with more than one computer application, especially one that uses a different algorithmic approach, is a way to gain confidence in the results. In this research, two models were created, one in Monte Carlo N Particle (MCNP) which uses a stochastic algorithmic approach, and the other in Attila, which uses a deterministic algorithmic approach to test the validity of the model and to estimate the dose rates in the area of interest. Successful comparison of the two models is a way we can validate the model used for that estimation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

On Correlational Properties for Volcanic Earthquakes Associated with Asamayama (Japan), 1983-2005

To a first approximation, earthquakes directly associated with volcanic activity may be studied as point-stochastic processes. The earthquakes associated with B-type (movements located at 1 km or shallower) eruptive activity in the caldera of Asamayama differ in correlational properties from concurrent deep-seated seismic activity (A-type, located deeper than approximately 1 km). A-type activity occurs either in the form of independently distributed intervals between events or as dependently distributed intervals which are most appropriately analysed in contiguous sub-samples ('windows'). The cross correlations between the magnitudes of A-type earthquakes and depth of events for three periods from 1983 to 2005 may be of significance for interpreting aspects of the volcanic history of Asamayama. The lag-1 serial correlation coefficient for the A-type sequence from 1983 to 1990 is not significantly different from zero. In the case of the sets for 1991-2002 and 2003-2005, the coefficients are small but not zero. The difference is in part, at least, probably due to the well-known confounding effect of trending as opposed to true serial correlation between successive events. The serial correlation coefficient for the B-type crater sequence is not significant. The novel aspect of the present study concerns the relationship between depth of A-type earth movements and magnitude of associated shocks.

58 GEOSCIENCES↗

Selecting registration schemes in case of interstitial lung disease follow-up in CT

Purpose: Primary goal of this study is to select optimal registration schemes in the framework of interstitial lung disease (ILD) follow-up analysis in CT. Methods: A set of 128 multiresolution schemes composed of multiresolution nonrigid and combinations of rigid and nonrigid registration schemes are evaluated, utilizing ten artificially warped ILD follow-up volumes, originating from ten clinical volumetric CT scans of ILD affected patients, to select candidate optimal schemes. Specifically, all combinations of four transformation models (three rigid: rigid, similarity, affine and one nonrigid: third order B-spline), four cost functions (sum-of-square distances, normalized correlation coefficient, mutual information, and normalized mutual information), four gradient descent optimizers (standard, regular step, adaptive stochastic, and finite difference), and two types of pyramids (recursive and Gaussian-smoothing) were considered. The selection process involves two stages. The first stage involves identification of schemes with deformation field singularities, according to the determinant of the Jacobian matrix. In the second stage, evaluation methodology is based on distance between corresponding landmark points in both normal lung parenchyma (NLP) and ILD affected regions. Statistical analysis was performed in order to select near optimal registration schemes per evaluation metric. Performance of the candidate registration schemes was verified on a case sample of ten clinical follow-up CT scans to obtain the selected registration schemes. Results: By considering near optimal schemes common to all ranking lists, 16 out of 128 registration schemes were initially selected. These schemes obtained submillimeter registration accuracies in terms of average distance errors 0.18 ± 0.01 mm for NLP and 0.20 ± 0.01 mm for ILD, in case of artificially generated follow-up data. Registration accuracy in terms of average distance error in clinical follow-up data was in the range of 1.985–2.156 mm and 1.966–2.234 mm, for NLP and ILD affected regions, respectively, excluding schemes with statistically significant lower performance (Wilcoxon signed-ranks test, p < 0.05), resulting in 13 finally selected registration schemes. Conclusions: Selected registration schemes in case of ILD CT follow-up analysis indicate the significance of adaptive stochastic gradient descent optimizer, as well as the importance of combined rigid and nonrigid schemes providing high accuracy and time efficiency. The selected optimal deformable registration schemes are equivalent in terms of their accuracy and thus compatible in terms of their clinical outcome.

60 APPLIED LIFE SCIENCES↗

Genetic bottlenecks during systemic movement of Cucumber mosaic virus vary in different host plants

Genetic bottlenecks are stochastic events that narrow variation in a population. We compared bottlenecks during the systemic infection of Cucumber mosaic virus (CMV) in four host plants. We mechanically inoculated an artificial population of twelve CMV mutants to young leaves of tomato, pepper, Nicotiana benthamiana, and squash. The inoculated leaves and primary and secondary systemically infected leaves were sampled at 2, 10, and 15 days post-inoculation. All twelve mutants were detected in all of the inoculated leaves. The number of mutants recovered from the systemically infected leaves of all host species was reduced significantly, indicating bottlenecks in systemic movement. The recovery frequencies of a few of the mutants were significantly different in each host probably due to host-specific selective forces. These results have implications for the differences in virus population variation that is seen in different host plants.

60 APPLIED LIFE SCIENCES↗

Distributed Stochastic Optimization of a Neural Representation Network for Time-Space Tomography Reconstruction

4D time-space reconstruction of dynamic events or deforming objects using X-ray computed tomography (CT) is an important inverse problem in non-destructive evaluation. Conventional back-projection based reconstruction methods assume that the object remains static for the duration of several tens or hundreds of X-ray projection measurement images (reconstruction of consecutive limited-angle CT scans). However, this is an unrealistic assumption for many in-situ experiments that causes spurious artifacts and inaccurate morphological reconstructions of the object. To solve this problem, we propose to perform a 4D time-space reconstruction using a distributed implicit neural representation (DINR) network that is trained using a novel distributed stochastic training algorithm. Our DINR network learns to reconstruct the object at its output by iterative optimization of its network parameters such that the measured projection images best match the output of the CT forward measurement model. Here, we use a forward measurement model that is a function of the DINR outputs at a sparsely sampled set of continuous valued 4D object coordinates. Unlike previous neural representation architectures that forward and back propagate through dense voxel grids that sample the object's entire time-space coordinates, we only propagate through the DINR at a small subset of object coordinates in each iteration resulting in an order-of-magnitude reduction in memory and compute for training. DINR leverages distributed computation across several compute nodes and GPUs to produce high-fidelity 4D time-space reconstructions. We use both simulated parallel-beam and experimental cone-beam X-ray CT datasets to demonstrate the superior performance of our approach.

36 MATERIALS SCIENCE↗

Probabilistic Look-ahead Contingency Analysis Integration with Commercial Tool and Practical Data

This paper presents an initial effort of integrating a smart sampling-based probabilistic look-ahead contingency analysis algorithm with General Electric (GE) Grid Solutions’ commercial energy management system (EMS) tool as a proof-of-concept for a seamless research tool integration using real world large-scale grid data. With the increasing impact of random forces such as variable generation and load, their stochastic behaviors cannot be ignored. However, the current practices are still dominated by deterministic tools. They are becoming increasingly inadequate for the future grid. The developed look-ahead contingency analysis algorithm incorporates forecast errors of variable energy and load to address the challenges brought by the increasing uncertainty of power system. The algorithm can reveal the potential violations caused by the variance of variable energy and load that are not normally detected by traditional deterministic approaches. To test its performance under practical environments ( real data with real commercial tool), significant efforts have been made to prepare test cases, modify GE EMS tool, and adapt an extreme value distribution algorithm to analyze the GE EMS’s violation-only outputs. The test results clearly demonstrate the effectiveness of the developed algorithm as new transformer violations that were not previously detected have been identified. This performance provides better situational awareness to engineers for their decision-making process under uncertainty. Moreover, with the discussion of computational performance and future work, this paper has shown a clear path for integrating the probabilistic algorithm with commercial tools to make us better equipped for the changing power system.

Modeling and simulation of power systems, constrai↗

Fluctuation statistics in the scrape-off layer of Alcator C-Mod

We study long time series of the ion saturation current and floating potential, sampled by Langmuir probes dwelled in the outboard mid-plane scrape-off layer and embedded in the lower divertor baffle of Alcator C-Mod. A series of ohmically heated L-mode plasma discharges is investigated with line-averaged plasma density ranging from ${{\bar{n}}_{\text{e}}}/{{n}_{\text{G}}}=0.15$ to 0.42, where $n_ G$ is the Greenwald density. All ion saturation current time series that are sampled in the far scrape-off layer are characterized by large-amplitude burst events. Coefficients of skewness and excess kurtosis of the time series obey a quadratic relationship and their histograms coincide partially upon proper normalization. Histograms of the ion saturation current time series are found to agree well with a prediction of a stochastic model for the particle density fluctuations in scrape-off layer plasmas. The distribution of the waiting times between successive large-amplitude burst events and of the burst amplitudes are approximately described by exponential distributions. The average waiting time and burst amplitude are found to vary weakly with the line-averaged plasma density. Conditional averaging reveals that the radial blob velocity, estimated from floating potential measurements, increases with the normalized burst amplitude in the outboard mid-plane scrape-off layer. For low density discharges, the conditionally averaged waveform of the floating potential associated with large amplitude bursts at the divertor probes has a dipolar shape. In detached divertor conditions the average waveform is random, indicating electrical disconnection of blobs from the sheaths at the divertor targets.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Probing the PeV region in the astrophysical neutrino spectrum using 𝜈 𝜇 from the Southern sky

IceCube has observed a diffuse astrophysical neutrino flux over the energy region from a few TeV to a few PeV. At PeV energies, the spectral shape is not yet well measured due to the low statistics of the data. This analysis probes the gap between 1 and 10 PeV by using high-energy downgoing muon neutrinos. Here, to reject the large atmospheric muon background, two complementary techniques are combined. The first technique selects events with high stochasticity to reject atmospheric muon bundles whose stochastic energy losses are smoothed due to high muon multiplicity. The second technique vetoes atmospheric muons with the IceTop surface array. Using 9 yrs of data, we found two neutrino candidate events in the signal region, consistent with expectation from background, each with relatively high signal probabilities. A joint maximum likelihood estimation is performed using this sample and an independent 9.5-yr sample of tracks to measure the neutrino spectrum. A likelihood ratio test is done to compare the single power-law (SPL) vs SPL+cutoff hypothesis; the SPL+cutoff model is not significantly better than the SPL. High-energy astrophysical objects from four source catalogs are also checked around the direction of the two events. No significant coincidence was found.

Abbasi, R. [Loyola University Chicago] (ORCID:0000↗

Moving the needle: Employing deep reinforcement learning to push the boundaries of coarse-grained vaccine models

Highly mutable infectious disease pathogens (hm-IDPs) such as HIV and influenza evolve faster than the human immune system can contain them, allowing them to circumvent traditional vaccination approaches and causing over one million deaths annually. Agent-based models can be used to simulate the complex interactions that occur between immune cells and hm-IDP-like proteins (antigens) during affinity maturation—the process by which antibodies evolve. Compared to existing experimental approaches, agent-based models offer a safe, low-cost, and rapid route to study the immune response to vaccines spanning a wide range of design variables. However, the highly stochastic nature of affinity maturation and vast sequence space of hm-IDPs render brute force searches intractable for exploring all pertinent vaccine design variables and the subset of immunization protocols encompassed therein. To address this challenge, we employed deep reinforcement learning to drive a recently developed agent-based model of affinity maturation to focus sampling on immunization protocols with greater potential to improve the chosen metrics of protection, namely the broadly neutralizing antibody (bnAb) titers or fraction of bnAbs produced. Using this approach, we were able to coarse-grain a wide range of vaccine design variables and explore the relevant design space. Our work offers new testable insights into how vaccines should be formulated to maximize protective immune responses to hm-IDPs and how they can be minimally tailored to account for major sources of heterogeneity in human immune responses and various socioeconomic factors. Our results indicate that the first 3 to 5 immunizations, depending on the metric of protection, should be specially tailored to achieve a robust protective immune response, but that beyond this point further immunizations require only subtle changes in formulation to sustain a durable bnAb response.

60 APPLIED LIFE SCIENCES↗

Fluctuation statistics in the scrape-off layer of Alcator C-Mod

We study long time series of the ion saturation current and oating potential, sampled by Langmuir probes dwelled in the outboard mid-plane scrape-off layer and embedded in the lower divertor baffle of Alcator C-Mod. A series of ohmically heated L-mode plasma discharges is investigated with line-averaged plasma density ranging from ne/nG = 0.15 to 0.42, where nG is the Greenwald density. All ion saturation current time series that are sampled in the far scrape-off layer are characterized by large-amplitude burst events. Coefficients of skewness and excess kurtosis of the time series obey a quadratic relationship and their histograms coincide partially upon proper normalization. Histograms of the ion saturation current time series are found to agree well with a prediction of a stochastic model for the particle density fluctuations in scrape-off layer plasmas. The distribution of the waiting times between successive large-amplitude burst events and of the burst amplitudes are approximately described by exponential distributions. The average waiting time and burst amplitude are found to vary weakly with the line-averaged plasma density. Conditional averaging reveals that the radial blob velocity, estimated from floating potential measurements, increases with the normalized burst amplitude in the outboard mid- plane scrape-off layer. For low density discharges, the conditionally averaged waveform of the floating potential associated with large amplitude bursts at the divertor probes has a dipolar shape. In detached divertor conditions the average waveform is random, indicating electrical disconnection of blobs from the sheaths at the divertor targets.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Simulation and Optimization of Large Scale Subsurface Environmental Impacts; Investigations, Remedial Design and Long Term Monitoring

The global impact to human health and the environment from large scale chemical / radionuclide releases is well documented. Examples are the wide spread release of radionuclides from the Chernobyl nuclear reactors, the mobilization of arsenic in Bangladesh, the formation of Environmental Protection Agencies in the United States, Canada and Europe, and the like. The fiscal costs of addressing and remediating these issues on a global scale are astronomical, but then so are the fiscal and human health costs of ignoring them. An integrated methodology for optimizing the response(s) to these issues is needed. This work addresses development of optimal policy design for large scale, complex, environmental issues. It discusses the development, capabilities, and application of a hybrid system of algorithms that optimizes the environmental response. It is important to note that 'optimization' does not singularly refer to cost minimization, but to the effective and efficient balance of cost, performance, risk, management, and societal priorities along with uncertainty analysis. This tool integrates all of these elements into a single decision framework. It provides a consistent approach to designing optimal solutions that are tractable, traceable, and defensible. The system is modular and scalable. It can be applied either as individual components or in total. By developing the approach in a complex systems framework, a solution methodology represents a significant improvement over the non-optimal 'trial and error' approach to environmental response(s). Subsurface environmental processes are represented by linear and non-linear, elliptic and parabolic equations. The state equations solved using numerical methods include multi-phase flow (water, soil gas, NAPL), and multicomponent transport (radionuclides, heavy metals, volatile organics, explosives, etc.). Genetic programming is used to generate the simulators either when simulation models do not exist, or to extend the accuracy of them. The uncertainty and sparse nature of information in earth science simulations necessitate stochastic representations. For discussion purposes, the solution to these site-wide challenges is divided into three sub-components; plume finding, long term monitoring, and site-wide remediation. Plume finding is the optimal estimation of the plume fringe(s) at a specified time. It is optimized by fusing geo-stochastic flow and transport simulations with the information content of data using a Kalman filter. The result is an optimal monitoring sensor network; the decision variable is location(s) of sensor in three dimensions. Long term monitoring extends this approach concept, and integrates the spatial-time correlations to optimize the decision variables of where to sample and when to sample over the project life cycle. Optimization of location and timing of samples to meet the desired accuracy of temporal plume movement is accomplished using enumeration or genetic algorithms. The remediation optimization solves the multi-component, multiphase system of equations and incorporates constraints on life-cycle costs, maximum annual costs, maximum allowable annual discharge (for assessing the monitored natural attenuation solution) and constraints on where remedial system component(s) can be located, including management overrides to force certain solutions to be chosen are incorporated for solution design. It uses a suite of optimization techniques, including the outer approximation method, Lipchitz global optimization, genetic algorithms, and the like. The automated optimal remedial design algorithm requires a stable simulator be available for the simulated process. This is commonly the case for all above specifications sans true three-dimensional multiphase flow. Much work is currently being conducted in the industry to develop stable 3D, three-phase simulators. If needed, an interim heuristic algorithm is available to get close to optimal for these conditions. This system process provides the full capability to optimize multi-source, multiphase, and multicomponent sites. The results of applying just components of these algorithms have produced predicted savings of as much as $90,000,000(US), when compared to alternative solutions. Investment in a pilot program to test the model saved 100% of the $20,000,000 predicted for the smaller test implementation. This was done without loss of effectiveness, and received an award from the Vice President - and now Nobel peace prize winner - Al Gore of the United States. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A New Stochastic Modeling of 3-D Mud Drapes Inside Point Bar Sands in Meandering River Deposits

The environment of major sediments of eastern China oilfields is a meandering river where mud drapes inside point bar sand occur and are recognized as important factors for underground fluid flow and distribution of the remaining oil. The present detailed architectural analysis, and the related mud drapes' modeling inside a point bar, is practical work to enhance oil recovery. This paper illustrates a new stochastic modeling of mud drapes inside point bars. The method is a hierarchical strategy and composed of three nested steps. Firstly, the model of meandering channel bodies is established using the Fluvsim method. Each channel centerline obtained from the Fluvsim is preserved for the next simulation. Secondly, the curvature ratios of each meandering river at various positions are calculated to determine the occurrence of each point bar. The abandoned channel is used to characterize the geometry of each defined point bar. Finally, mud drapes inside each point bar are predicted through random sampling of various parameters, such as number, horizontal intervals, dip angle, and extended distance of mud drapes. A dataset, collected from a reservoir in the Shengli oilfield of China, was used to illustrate the mud drapes' building procedure proposed in this paper. The results show that the inner architectural elements of the meandering river are depicted fairly well in the model. More importantly, the high prediction precision from the cross validation of five drilled wells shows the practical value and significance of the proposed method.

42 ENGINEERING↗

Monte Carlo Second- and Third-Order Many-Body Green’s Function Methods with Frequency-Dependent, Nondiagonal Self-Energy

We fully develop the Monte Carlo many-body Green’s function (MC-GF) method with the following enhancements: (1) The truncation order of the perturbation expansion of the Dyson self-energy is raised from the second order (MC-GF2) to the third order (MC-GF3) with the aid of a computerized procedure to enumerate and transform all 84 third-order Goldstone diagrams into Monte Carlo integrable expressions and then into central processing unit (CPU)/graphical processing unit (GPU)-parallel computer codes. (2) An efficient algorithm is proposed that computes all off-diagonal and diagonal elements of the MC-GF2 and MC-GF3 self-energy matrices by common subexpression elimination. (3) The frequency-independent approximation is lifted by introducing a method that computes frequency derivatives of the MC-GF2 and MC-GF3 self-energies up to any arbitrarily high order at nearly no additional computational cost. (4) The imaginary-time integration in the Laplace-transformed expressions of the self-energy is carried out stochastically (instead of using a quadrature in the previous implementations), resulting in a 50- to 200-fold speedup. (5) The efficiency of the redundant-walker convergence acceleration scheme is analyzed numerically, and the guidelines are established to select an optimal number of walkers for maximal efficiency. When such an optimal number is used, the cost per sample is constant of molecular size on either many CPUs or many GPUs. (6) The computational cost to obtain a binding energy within a given statistical uncertainty is observed to increase as (tentatively) O(n 4 ) and O(n 5 ) of molecular size (n is the number of electrons) with and without the diagonal approximation, respectively, as opposed to O(n 5 ) and O(n 6 ) of the corresponding deterministic algorithms. With this method applied to the electron binding energies of C 60 , we show that the third-order corrections to the self-energies are much greater in electron binding energies than in ground-state energies. As a result, they display a sign of oscillatory convergence toward experimental results, not necessarily improving the agreement with increasing perturbation order, justifying MC-GF3 and motivating even higher-order methods.

Algorithms↗

A test of gravity with Pulsar Timing Arrays

Abstract A successful measurement of the Stochastic Gravitational Wave Background (SGWB) in Pulsar Timing Arrays (PTAs) would open up a new window through which to test the predictions of General Relativity (GR). We consider how these measurements might reveal deviations from GR by studying the overlap reduction function — the quantity that in GR is approximated by the Hellings-Downs curve — in some sample modifications of gravity, focusing on the generic prediction of a modified dispersion relation for gravitational waves. We find a distinct signature of such modifications to GR — a shift in the minimum angle of the angular distribution — and demonstrate that this shift is quantitatively sensitive to any change in the phase velocity. In a given modification of gravity, this result can be used, in some regions of parameter space, to distinguish the effect of a modified dispersion relation from that due to the presence of extra polarization modes.

Astronomy & Astrophysics↗