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 559 records · Page 31

A stochastic downscaling approach for generating high-frequency solar irradiance scenarios

Solar power is increasingly cost viable with solar photovoltaic (PV) installations becoming commonplace. PV planning and operational studies, however, require high-frequency solar irradiance scenarios to understand potential electric grid impacts due to the variability and uncertainty of the underlying solar resource. Existing remote sensing solar data products are often available over large spatial domains, but are limited in temporal resolution. For example, the global horizontal irradiance (GHI) component contained within the National Solar Radiation Database (NSRDB) is available at time resolution of 30 min on an approximately four-kilometer grid. In contrast, substantial solar variability is present at finer time scales and this article describes an algorithm to stochastically generate one-minute GHI from widely available sub-hourly NSRDB. A generalized linear modeling (GLM) framework is proposed, which includes non-Gaussian mixtures, and extends the literature involving the synthesis of GHI data. The model is trained on a set of sample locations around Oregon, USA, and validated across the USA using both the Surface Radiation Budget Network (SURFRAD) dataset and Solar Radiation Monitoring Laboratory (SRML) network. Simulated ensembles show good coverage properties and temporal correlation structure. The resulting downscaled ensembles allow for understanding the unpredictable variability inherent in GHI at locations without direct measurements. Here, future work can leverage the algorithm as part of a stochastic optimization of electric grid operations with high-penetration PV systems.

14 SOLAR ENERGY↗

High-level coupled-cluster energetics by Monte Carlo sampling and moment expansions: Further details and comparisons

We recently proposed a novel approach to converging electronic energies equivalent to high-level coupled-cluster (CC) computations by combining the deterministic CC(P;Q) formalism with the stochastic configuration interaction (CI) and CC Quantum Monte Carlo (QMC) propagations. This article extends our initial study [J. E. Deustua, J. Shen, and P. Piecuch, Phys. Rev. Lett. 119, 223003 (2017)], which focused on recovering the energies obtained with the CC method with singles, doubles, and triples (CCSDT) using the information extracted from full CI QMC and CCSDT-MC, to the CIQMC approaches truncated at triples and quadruples. It also reports our first semi-stochastic CC(P;Q) calculations aimed at converging the energies that correspond to the CC method with singles, doubles, triples, and quadruples (CCSDTQ). The ability of the semi-stochastic CC(P;Q) formalism to recover the CCSDT and CCSDTQ energies, even when electronic quasi-degeneracies and triply and quadruply excited clusters become substantial, is illustrated by a few numerical examples, including the F–F bond breaking in F 2 , the automerization of cyclobutadiene, and the double dissociation of the water molecule.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multiple-time-stepping generalized hybrid Monte Carlo methods

Performance of the generalized shadow hybrid Monte Carlo (GSHMC) method [1], which proved to be superior in sampling efficiency over its predecessors [2–4], molecular dynamics and hybrid Monte Carlo, can be further improved by combining it with multi-time-stepping (MTS) and mollification of slow forces. We demonstrate that the comparatively simple modifications of the method not only lead to better performance of GSHMC itself but also allow for beating the best performed methods, which use the similar force splitting schemes. In addition we show that the same ideas can be successfully applied to the conventional generalized hybrid Monte Carlo method (GHMC). The resulting methods, MTS-GHMC and MTS-GSHMC, provide accurate reproduction of thermodynamic and dynamical properties, exact temperature control during simulation and computational robustness and efficiency. MTS-GHMC uses a generalized momentum update to achieve weak stochastic stabilization to the molecular dynamics (MD) integrator. MTS-GSHMC adds the use of a shadow (modified) Hamiltonian to filter the MD trajectories in the HMC scheme. We introduce a new shadow Hamiltonian formulation adapted to force-splitting methods. The use of such Hamiltonians improves the acceptance rate of trajectories and has a strong impact on the sampling efficiency of the method. Both methods were implemented in the open-source MD package ProtoMol and were tested on a water and a protein systems. Results were compared to those obtained using a Langevin Molly (LM) method [5] on the same systems. The test results demonstrate the superiority of the new methods over LM in terms of stability, accuracy and sampling efficiency. This suggests that putting the MTS approach in the framework of hybrid Monte Carlo and using the natural stochasticity offered by the generalized hybrid Monte Carlo lead to improving stability of MTS and allow for achieving larger step sizes in the simulation of complex systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A generalized parallel replica dynamics

Metastability is a common obstacle to performing long molecular dynamics simulations. Many numerical methods have been proposed to overcome it. One method is parallel replica dynamics, which relies on the rapid convergence of the underlying stochastic process to a quasi-stationary distribution. Two requirements for applying parallel replica dynamics are knowledge of the time scale on which the process converges to the quasi-stationary distribution and a mechanism for generating samples from this distribution. By combining a Fleming–Viot particle system with convergence diagnostics to simultaneously identify when the process converges while also generating samples, we can address both points. This variation on the algorithm is illustrated with various numerical examples, including those with entropic barriers and the 2D Lennard-Jones cluster of seven atoms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Network Completion Problem: Inferring Missing Nodes and Edges in Networks

Network structures, such as social networks, web graphs and networks from systems biology, play important roles in many areas of science and our everyday lives. In order to study the networks one needs to first collect reliable large scale network data. While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomplete with nodes and edges missing. Commonly, only a part of the network can be observed and we would like to infer the unobserved part of the network. We address this issue by studying the Network Completion Problem: Given a network with missing nodes and edges, can we complete the missing part? We cast the problem in the Expectation Maximization (EM) framework where we use the observed part of the network to fit a model of network structure, and then we estimate the missing part of the network using the model, re-estimate the parameters and so on. We combine the EM with the Kronecker graphs model and design a scalable Metropolized Gibbs sampling approach that allows for the estimation of the model parameters as well as the inference about missing nodes and edges of the network. Experiments on synthetic and several real-world networks show that our approach can effectively recover the network even when about half of the nodes in the network are missing. Our algorithm outperforms not only classical link-prediction approaches but also the state of the art Stochastic block modeling approach. Furthermore, our algorithm easily scales to networks with tens of thousands of nodes.

97 MATHEMATICS AND COMPUTING↗

A multi-objective optimization approach to optimal sensor location problem in $\mathrm{IGCC}$ power plants

Integrated Gasification Combined Cycle (IGCC) power plants provide a cleaner and more efficient way to obtain energy from coal. In order to operate an IGCC power plant in a safe and stable manner, several input and output process parameters need to be monitored. However, due to economic and operational constraints, it is infeasible to place sensors at every input and output process parameter location. Hence, it becomes important to select the most effective sensor locations which lead to maximum information gain about the plant conditions. Practical issues present in an IGCC power plant, such as harsh physical conditions and variability in process parameters, make the optimal sensor location problem an especially complicated one. Further, sensors can have multiple objectives and they can produce uncertainties due to measurement errors. Here this work considers hybrid hardware and virtual sensing for advanced power systems with multiple objectives. In order to solve this real world large scale problem, we use a novel algorithm called Better Optimization of Nonlinear Uncertain Systems (BONUS). BONUS works in probability distribution space and avoids sampling for each optimization and derivative calculations iterations. A new algorithm for multi-objective optimization is also developed specifically for problem. The result of this nonlinear stochastic multi-objective problem is the non-dominated, or Pareto set, which provides trade-offs between various objectives like observability, cost, and thermal efficiency. This is the first attempt at solving the problem of optimal sensor deployment in advanced power plants, with consideration of hybrid hardware and virtual sensing and incorporation of uncertainty with multiple objectives.

01 COAL, LIGNITE, AND PEAT↗

Improved Fast Randomized Iteration Approach to Full Configuration Interaction

In this work, we present three modifications to our recently introduced fast randomized iteration method for full configuration interaction (FCI-FRI) and investigate their effects on the method’s performance for Ne, H 2 O, and N 2 . The initiator approximation, originally developed for full configuration interaction quantum Monte Carlo, significantly reduces statistical error in FCI-FRI when few samples are used in compression operations, enabling its application to larger chemical systems. The semistochastic extension, which involves exactly preserving a fixed subset of elements in each compression, improves statistical efficiency in some cases but reduces it in others. We also developed a new approach to sampling excitations that yields consistent improvements in statistical efficiency and reductions in computational cost. We discuss possible strategies based on our findings for improving the performance of stochastic quantum chemistry methods more generally.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Groundwater–surface water mixing shifts ecological assembly processes and stimulates organic carbon turnover

Environmental transition zones are associated with geochemical gradients that overcome energy limitations to microbial metabolism, resulting in biogeochemical hot spots and moments. Riverine systems where groundwater mixes with surface water (the hyporheic zone) are spatially complex and temporally dynamic, making development of predictive models challenging. Spatial and temporal variations in hyporheic zone microbial communities are a key, but understudied, component of riverine biogeochemical function. To investigate the coupling among groundwater-surface water mixing, microbial communities, and biogeochemistry we applied ecological theory, aqueous biogeochemistry, DNA sequencing, and ultra-high resolution organic carbon profiling to field samples collected across times and locations representing a broad range of mixing conditions. Mixing of groundwater and surface water resulted in a shift from transport-driven stochastic dynamics to a deterministic microbial structure associated with elevated biogeochemical rates. While the dynamics of the hyporheic make predictive modeling a challenge, we provide new knowledge that can improve the tractability of such models.

54 ENVIRONMENTAL SCIENCES↗

Evidence for Merger-driven Growth in Luminous, High- z , Obscured AGNs in the CANDELS/COSMOS Field

While major mergers have long been proposed as a driver of both active galactic nucleus (AGN) activity and the ${M}_{\mathrm{BH}}\mbox{--}{\sigma }_{\mathrm{bulge}}$ relation, studies of moderate to high-redshift Seyfert-luminosity AGN hosts have found little evidence for enhanced rates of interactions. However, both theory and observation suggest that while these AGNs may be fueled by stochastic accretion and secular processes, high-luminosity, high-redshift, and heavily obscured AGNs are the AGNs most likely to be merger-driven. To better sample this population of AGNs, we turn to infrared selection in the CANDELS/COSMOS field. Compared to their lower-luminosity and less obscured X-ray-only counterparts, IR-only AGNs (luminous, heavily obscured AGNs) are more likely to be classified as either irregular (${50}_{-12}^{+12} \% $ versus ${9}_{-2}^{+5} \% $) or asymmetric (${69}_{-13}^{+9} \% $ versus ${17}_{-4}^{+6} \% $) and are less likely to have a spheroidal component (${31}_{-9}^{+13} \% $ versus ${77}_{-6}^{+4} \% $). Furthermore, IR-only AGNs are also significantly more likely than X-ray-only AGNs (${75}_{-13}^{+8} \% $ versus ${31}_{-6}^{+6} \% $) to be classified either as interacting or merging in a way that significantly disturbs the host galaxy or as disturbed, though not clearly interacting or merging, which potentially represents the late stages of a major merger. Finally, this suggests that while major mergers may not contribute significantly to the fueling of Seyfert-luminosity AGNs, interactions appear to play a more dominant role in the triggering and fueling of high-luminosity heavily obscured AGNs.

79 ASTRONOMY AND ASTROPHYSICS↗

Automated Weight-Window Generation for Threat Detection Applications Using ADVANTG

Deterministic transport codes have been used for some time to generate weight-window parameters that can improve the efficiency of Monte Carlo simulations. As the use of this hybrid computational technique is becoming more widespread, the scope of applications in which it is being applied is expanding. An active source of new applications is the field of homeland security--particularly the detection of nuclear material threats. For these problems, automated hybrid methods offer an efficient alternative to trial-and-error variance reduction techniques (e.g., geometry splitting or the stochastic weight window generator). The ADVANTG code has been developed to automate the generation of weight-window parameters for MCNP using the Consistent Adjoint Driven Importance Sampling method and employs the TORT or Denovo 3-D discrete ordinates codes to generate importance maps. In this paper, we describe the application of ADVANTG to a set of threat-detection simulations. We present numerical results for an 'active-interrogation' problem in which a standard cargo container is irradiated by a deuterium-tritium fusion neutron generator. We also present results for two passive detection problems in which a cargo container holding a shielded neutron or gamma source is placed near a portal monitor. For the passive detection problems, ADVANTG obtains an O(10{sup 4}) speedup and, for a detailed gamma spectrum tally, an average O(10{sup 2}) speedup relative to implicit-capture-only simulations, including the deterministic calculation time. For the active-interrogation problem, an O(10{sup 4}) speedup is obtained when compared to a simulation with angular source biasing and crude geometry splitting.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Linked coupled cluster Monte Carlo

We consider a new formulation of the stochastic coupled cluster method in terms of the similarity transformed Hamiltonian. We show that improvement in the granularity with which the wavefunction is represented results in a reduction in the critical population required to correctly sample the wavefunction for a range of systems and excitation levels and hence leads to a substantial reduction in the computational cost. This development has the potential to substantially extend the range of the method, enabling it to be used to treat larger systems with excitation levels not easily accessible with conventional deterministic methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

STAR CLUSTER PROPERTIES IN TWO LEGUS GALAXIES COMPUTED WITH STOCHASTIC STELLAR POPULATION SYNTHESIS MODELS

We investigate a novel Bayesian analysis method, based on the Stochastically Lighting Up Galaxies (slug) code, to derive the masses, ages, and extinctions of star clusters from integrated light photometry. Unlike many analysis methods, slug correctly accounts for incomplete initial mass function (IMF) sampling, and returns full posterior probability distributions rather than simply probability maxima. We apply our technique to 621 visually confirmed clusters in two nearby galaxies, NGC 628 and NGC 7793, that are part of the Legacy Extragalactic UV Survey (LEGUS). LEGUS provides Hubble Space Telescope photometry in the NUV, U, B, V, and I bands. We analyze the sensitivity of the derived cluster properties to choices of prior probability distribution, evolutionary tracks, IMF, metallicity, treatment of nebular emission, and extinction curve. We find that slug's results for individual clusters are insensitive to most of these choices, but that the posterior probability distributions we derive are often quite broad, and sometimes multi-peaked and quite sensitive to the choice of priors. In contrast, the properties of the cluster population as a whole are relatively robust against all of these choices. We also compare our results from slug to those derived with a conventional non-stochastic fitting code, Yggdrasil. We show that slug's stochastic models are generally a better fit to the observations than the deterministic ones used by Yggdrasil. However, the overall properties of the cluster populations recovered by both codes are qualitatively similar.

79 ASTRONOMY AND ASTROPHYSICS↗

Data-driven Minimum Entropy Control for Stochastic Nonlinear Systems using the Cumulant-Generating Function

Here, we present a novel minimum entropy control algorithm for a class of stochastic nonlinear systems subjected to non-Gaussian noises. The entropy control can be considered as an optimization problem for the system randomness attenuation, but the mean value has to be considered separately. To overcome this disadvantage, a new representation of the system stochastic properties was given using the cumulant-generating function based on the moment-generating function, in which the mean value and the entropy was reflected by the shape of the cumulant-generating function. Based on the samples of the system output and control input, a time-variant linear model was identified, and the minimum entropy optimization was transformed to system stabilization. Then, an optimal control strategy was developed to achieve the randomness attenuation, and the boundedness of the controlled system output was analyzed. The effectiveness of the presented control algorithm was demonstrated by a numerical example. In this paper, a data-driven minimum entropy design is presented without pre-knowledge of the system model; entropy optimization is achieved by the system stabilization approach in which the stochastic distribution control and minimum entropy are unified using the same identified structure; and a potential framework is obtained since all the existing system stabilization methods can be adopted to achieve the minimum entropy objective.

42 ENGINEERING↗

Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates

In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the physical discretization error and the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity of the sparse grid. Utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchical surplus based strategies. Throughout this paper we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exact and inexact subsampled Newton methods for optimization

Abstract The paper studies the solution of stochastic optimization problems in which approximations to the gradient and Hessian are obtained through subsampling. We first consider Newton-like methods that employ these approximations and discuss how to coordinate the accuracy in the gradient and Hessian to yield a superlinear rate of convergence in expectation. The second part of the paper analyzes an inexact Newton method that solves linear systems approximately using the conjugate gradient (CG) method, and that samples the Hessian and not the gradient (the gradient is assumed to be exact). We provide a complexity analysis for this method based on the properties of the CG iteration and the quality of the Hessian approximation, and compare it with a method that employs a stochastic gradient iteration instead of the CG method. We report preliminary numerical results that illustrate the performance of inexact subsampled Newton methods on machine learning applications based on logistic regression.

Mathematics↗

Quantifying the heterogeneity of shale through statistical combination of imaging across scales

Shale is a highly heterogeneous material across multiple scales. A typical shale consists of nanometer-scale pores and minerals mixed with macro-scale fractures and particles of varying size. High-resolution imaging is crucial for characterizing the composition and microstructure of this rock. Yet, it is generally not feasible to image a large sample of shale at a high resolution over a large field of view (FOV), thus limiting a full characterization of the microstructure of this material. We present a stochastic framework based on multiple-point statistics that uses high-resolution training images to enhance low-resolution images obtained over a large FOV. Here, we demonstrate the approach using X-ray micro-tomography images of organic-rich Woodford shale obtained at two different resolutions and FOV. Results show that the proposed technique can generate realistic high-resolution images of the microstructure of shale over a large FOV.

58 GEOSCIENCES↗

A new method to measure galaxy bias by combining the density and weak lensing fields

We present a new method to measure redshift-dependent galaxy bias by combining information from the galaxy density field and the weak lensing field. This method is based on the work of Amara et al., who use the galaxy density field to construct a bias-weighted convergence field κg. The main difference between Amara et al.'s work and our new implementation is that here we present another way to measure galaxy bias, using tomography instead of bias parametrizations. The correlation between κg and the true lensing field κ allows us to measure galaxy bias using different zero-lag correlations, such as <κgκ>/<κκ> or <κgκg>/<κgκ>. Our method measures the linear bias factor on linear scales, under the assumption of no stochasticity between galaxies and matter. We use the Marenostrum Institut de Ciències de l'Espai (MICE) simulation to measure the linear galaxy bias for a flux-limited sample (i < 22.5) in tomographic redshift bins using this method. This article is the first that studies the accuracy and systematic uncertainties associated with the implementation of the method and the regime in which it is consistent with the linear galaxy bias defined by projected two-point correlation functions (2PCF). We find that our method is consistent with a linear bias at the per cent level for scales larger than 30 arcmin, while non-linearities appear at smaller scales. This measurement is a good complement to other measurements of bias, since it does not depend strongly on σ8 as do the 2PCF measurements. We will apply this method to the Dark Energy Survey Science Verification data in a follow-up article.

79 ASTRONOMY AND ASTROPHYSICS↗

Atmospheric PSF Interpolation for Weak Lensing in Short Exposure Imaging Data

A main science goal for the Large Synoptic Survey Telescope (LSST) is to measure the cosmic shear signal from weak lensing to extreme accuracy. One difficulty, however, is that with the short exposure time ({approx_equal}15 seconds) proposed, the spatial variation of the Point Spread Function (PSF) shapes may be dominated by the atmosphere, in addition to optics errors. While optics errors mainly cause the PSF to vary on angular scales similar or larger than a single CCD sensor, the atmosphere generates stochastic structures on a wide range of angular scales. It thus becomes a challenge to infer the multi-scale, complex atmospheric PSF patterns by interpolating the sparsely sampled stars in the field. In this paper we present a new method, psfent, for interpolating the PSF shape parameters, based on reconstructing underlying shape parameter maps with a multi-scale maximum entropy algorithm. We demonstrate, using images from the LSST Photon Simulator, the performance of our approach relative to a 5th-order polynomial fit (representing the current standard) and a simple boxcar smoothing technique. Quantitatively, psfent predicts more accurate PSF models in all scenarios and the residual PSF errors are spatially less correlated. This improvement in PSF interpolation leads to a factor of 3.5 lower systematic errors in the shear power spectrum on scales smaller than {approx} 13, compared to polynomial fitting. We estimate that with psfent and for stellar densities greater than {approx_equal}1/arcmin{sup 2}, the spurious shear correlation from PSF interpolation, after combining a complete 10-year dataset from LSST, is lower than the corresponding statistical uncertainties on the cosmic shear power spectrum, even under a conservative scenario.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗