Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stochastic methods”

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,063 records · Page 59

Statistical scaling of geometric characteristics in stochastically generated pore microstructures

In this study, we analyze the statistical scaling of structural attributes of virtual porous microstructures that are stochastically generated by thresholding Gaussian random fields. Characterization of the extent at which randomly generated pore spaces can be considered as representative of a particular rock sample depends on the metrics employed to compare the virtual sample against its physical counterpart. Typically, comparisons against features and/patterns of geometric observables, e.g., porosity and specific surface area, flow-related macroscopic parameters, e.g., permeability, or autocorrelation functions are used to assess the representativeness of a virtual sample, and thereby the quality of the generation method. Here, we rely on manifestations of statistical scaling of geometric observables which were recently observed in real millimeter scale rock samples [13] as additional relevant metrics by which to characterize a virtual sample. We explore the statistical scaling of two geometric observables, namely porosity (Φ) and specific surface area (SSA), of porous microstructures generated using the method of Smolarkiewicz and Winter [42] and Hyman and Winter [22]. Our results suggest that the method can produce virtual pore space samples displaying the symptoms of statistical scaling observed in real rock samples. Order q sample structure functions (statistical moments of absolute increments) of Φ and SSA scale as a power of the separation distance (lag) over a range of lags, and extended self-similarity (linear relationship between log structure functions of successive orders) appears to be an intrinsic property of the generated media. The width of the range of lags where power-law scaling is observed and the Hurst coefficient associated with the variables we consider can be controlled by the generation parameters of the method.

54 ENVIRONMENTAL SCIENCES↗

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

Mengshoel, Ole J.↗

Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation

Here we propose a decomposition algorithm for multistage stochastic programming that resembles the progressive hedging method of Rockafellar and Wets but is provably capable of several forms of asynchronous operation. We derive the method from a class of projective operator splitting methods fairly recently proposed by Combettes and Eckstein, significantly expanding the known applications of those methods. Our derivation assures convergence for convex problems whose feasible set is compact, subject to some standard regularity conditions and a mild “fairness” condition on subproblem selection. The method’s convergence guarantees are deterministic and do not require randomization, in contrast to other proposed asynchronous variations of progressive hedging. Computational experiments described in an online appendix show the method to outperform progressive hedging on large-scale problems in a highly parallel computing environment.

97 MATHEMATICS AND COMPUTING↗

Dimensionality reduction using elastic measures

With the recent surge in big data analytics for hyperdimensional data, there is a renewed interest in dimensionality reduction techniques. In order for these methods to improve performance gains and understanding of the underlying data, a proper metric needs to be identified. This step is often overlooked, and metrics are typically chosen without consideration of the underlying geometry of the data. Here, in this paper, we present a method for incorporating elastic metrics into the t-distributed stochastic neighbour embedding (t-SNE) and Uniform Manifold Approximation and Projection (UMAP). We apply our method to functional data, which is uniquely characterized by rotations, parameterization and scale. If these properties are ignored, they can lead to incorrect analysis and poor classification performance. Through our method, we demonstrate improved performance on shape identification tasks for three benchmark data sets (MPEG-7, Car data set and Plane data set of Thankoor), where we achieve 0.77, 0.95 and 1.00 F1 score, respectively.

97 MATHEMATICS AND COMPUTING↗

Random element method for numerical modeling of diffusional processes

The random element method is a generalization of the random vortex method that was developed for the numerical modeling of momentum transport processes as expressed in terms of the Navier-Stokes equations. The method is based on the concept that random walk, as exemplified by Brownian motion, is the stochastic manifestation of diffusional processes. The algorithm based on this method is grid-free and does not require the diffusion equation to be discritized over a mesh, it is thus devoid of numerical diffusion associated with finite difference methods. Moreover, the algorithm is self-adaptive in space and explicit in time, resulting in an improved numerical resolution of gradients as well as a simple and efficient computational procedure. The method is applied here to an assortment of problems of diffusion of momentum and energy in one-dimension as well as heat conduction in two-dimensions in order to assess its validity and accuracy. The numerical solutions obtained are found to be in good agreement with exact solution except for a statistical error introduced by using a finite number of elements, the error can be reduced by increasing the number of elements or by using ensemble averaging over a number of solutions.

Ghoniem, A. F.↗

Spontaneous Clearance of Viral Infections by Mesoscopic Fluctuations

Spontaneous disease extinction can occur due to a rare stochastic fluctuation. We explore this process, both numerically and theoretically, in two minimal models of stochastic viral infection dynamics. We propose a method that reduces the complexity in models of viral infections so that the remaining dynamics can be studied by previously developed techniques for analyzing epidemiological models. Using this technique, we obtain an expression for the infection clearance time as a function of kinetic parameters. We apply our theoretical results to study stochastic infection clearance for specific stages of HIV and HCV dynamics. Our results show that the typical time for stochastic clearance of a viral infection increases exponentially with the size of the population, but infection still can be cleared spontaneously within a reasonable time interval in a certain population of cells. We also show that the clearance time is exponentially sensitive to the viral decay rate and viral infectivity but only linearly dependent on the lifetime of an infected cell. This suggests that if standard drug therapy fails to clear an infection then intensifying therapy by adding a drug that reduces the rate of cell infection rather than immune modulators that hasten infected cell death may be more useful in ultimately clearing remaining pockets of infection.

59 BASIC BIOLOGICAL SCIENCES↗

Experiments with recursive estimation in astronomical image processing

Recursive estimation concepts were applied to image enhancement problems since the 70's. However, very few applications in the particular area of astronomical image processing are known. These concepts were derived, for 2-dimensional images, from the well-known theory of Kalman filtering in one dimension. The historic reasons for application of these techniques to digital images are related to the images' scanned nature, in which the temporal output of a scanner device can be processed on-line by techniques borrowed directly from 1-dimensional recursive signal analysis. However, recursive estimation has particular properties that make it attractive even in modern days, when big computer memories make the full scanned image available to the processor at any given time. One particularly important aspect is the ability of recursive techniques to deal with non-stationary phenomena, that is, phenomena which have their statistical properties variable in time (or position in a 2-D image). Many image processing methods make underlying stationary assumptions either for the stochastic field being imaged, for the imaging system properties, or both. They will underperform, or even fail, when applied to images that deviate significantly from stationarity. Recursive methods, on the contrary, make it feasible to perform adaptive processing, that is, to process the image by a processor with properties tuned to the image's local statistical properties. Recursive estimation can be used to build estimates of images degraded by such phenomena as noise and blur. We show examples of recursive adaptive processing of astronomical images, using several local statistical properties to drive the adaptive processor, as average signal intensity, signal-to-noise and autocorrelation function. Software was developed under IRAF, and as such will be made available to interested users.

Busko, I.↗

Impacts of stochastic coalescence variability on warm rain initiation using Lagrangian microphysics in box and large-eddy simulations

Various coalescence methods for Lagrangian microphysics schemes are tested in box and large-eddy simulation (LES) models, including the stochastic all-or-nothing super-droplet method (SDM) and a version of SDM (dSDM) that applies a fractional approach similar to the average impact method. In LES, variabilities driven by microphysics and by flow realizations are separated using the “piggybacking” technique. Rain initiation averaged over many realizations of the box model is delayed and rain variability increases as the number of super-drops per collision volume ( N SD ) is decreased using SDM. In contrast, rain initiation time using SDM in LES is insensitive to N SD for 32 ≤ N SD ≤ 512. This is explained through the interaction between LES grid boxes, each acting as a separate collision volume. Variability across the ensemble of LES collision volumes using SDM results in rain quickly initiating in some of the LES grid cells at low N SD and leading to a similar overall timing of rain initiation from the cloud compared to simulations with high N SD . There is a ~20% decrease in the total rain mass and mean rain flux as N SD is increased from 32 to 256, with little additional change as N SD is increased from 256 to 512. The fractional coalescence approach in dSDM leads to reduced microphysical variability and a 15-18 min delay in rain initiation compared to SDM. Finally, an additional LES ensemble with microphysical variability feeding back to the dynamics shows that flow variability dominates the impact of microphysical variability on rain properties. Thus, flow variability must be constrained to isolate impacts of microphysical variability.

54 ENVIRONMENTAL SCIENCES↗

Simulating the Effect of Fracture Connectivity on Repository Performance with GDSA Framework - 18589

This work examines the possible migration of radionuclides from a deep geologic nuclear waste repository sited in fractured crystalline host rock. The key safety concern is the potential effect on waste isolation of the inter-connectivity of the fracture network, which is primarily established by the temporal evolution of the temperature and stress fields at the time of original rock intrusion and cooling. Two end members are considered in these simulations, one with a high degree of connectivity to the biosphere, such that advective transport through the fracture and fault network controls radionuclide migration, and the other with a low degree of connectivity, such that slow diffusive transport through the crystalline rock matrix is the controlling process for radionuclide migration to the biosphere. Both end members have several areally extensive, high-transmissivity deformation zones, whose distance to the repository is an important factor for waste isolation capability. Uncertainties in fracture properties (transmissivity, orientation, radius) and fracture distribution also give rise to uncertainty in waste isolation capability (i.e., the overall connectivity of the repository with the surface biosphere). These types of natural system uncertainties are generally present in any geologic site-characterization program and thus represent an important factor in assessing repository performance in hard rock environments. The waste considered in these simulations are spent fuel rod assemblies from the U.S. commercial nuclear reactor fleet. Thermal output of the waste must be considered in the simulations and can influence the rate and timing of waste package failure, waste form degradation, and fluid flux due to thermal expansion around the repository horizon. To achieve a high-fidelity representation of radionuclide transport in fractures and rock matrix, combined with thermal energy transport and fluid flow in fractures and matrix, the mathematical model is solved numerically in a parallel high-performance computing (HPC) environment on a finite volume unstructured grid consisting of approximately 5 million cells, using Geologic Disposal Safety Assessment (GDSA) Framework (https://pa.sandia.gov), an open-source performance assessment tool for deep underground disposal of nuclear waste. GDSA Framework uses PFLOTRAN to solve the balance equations on a three-dimensional grid with heterogeneous properties, using multiple processors in a parallel configuration based on domain decomposition. The fracture networks in these simulations are originally generated as discrete fracture networks (DFNs), which are sets of two-dimensional planes distributed in a three-dimensional domain. The method used in GDSA Framework maps the stochastically generated DFN to an equivalent continuous porous medium (ECPM) domain that allows for the simulation of coupled heat flow, fluid flow, and radionuclide transport, including heat conduction through the matrix of the fractured rock, which is a process not easily modeled in a DFN representation. Computational efficiency is also greatly enhanced using the ECPM method, allowing for a realistic representation and analysis of uncertainties in a multi-realization performance assessment of a deep geologic repository. The effect of fracture connectivity on the waste isolation safety function, as brought to light by these GDSA Framework simulations, points to the importance of including a realistic representation of uncertainties in fracture properties and distribution (effectively, uncertainty in spatial heterogeneity) in repository safety assessment simulations. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Rotational symmetry relation for efficient response function generation in the coarse mesh transport method COMET

The coarse mesh transport code COMET is a continuous energy hybrid stochastic-deterministic neutronics solver with high fidelity and formidable computation speed in solving reactor core problems. Its method is based on the incident flux expansion theory. In this work, we take advantage of the local geometric symmetry in many reactor cores lattices (e.g., fuel lattices and reflector blocks) to develop relations among the flux response expansion coefficients for symmetric surfaces to further improve the computational efficiency of the COMET response function generation tool (method). This is done by a rigorous derivation of the transformation matrices for the angular and spatial expansion moments resulting from a rotation of a coarse mesh by an arbitrary angle. The relations for the response coefficients for the symmetric surfaces can be then written as the Kronecker product of those transformation matrices. The method is implemented into COMET and tested on two advanced high temperature reactor (AHTR) full-length single assembly benchmark problems. The COMET results using the response function library based on the symmetry relations were compared to those using the library directly generated by continuous energy Monte Carlo for all surfaces. It was found that the eigenvalues and stripe-wise fission densities using the two libraries are in statistical agreement as expected. This indicates that the new method maintains the high fidelity of the original COMET method while improving the computational efficiency in the response function generation by 270% to 400%, depending on the local geometric symmetry. This method also reduces the size of the response function library by the same magnitude (270% to 400%). (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Stochastic many-body perturbation theory for anharmonic molecular vibrations

A new quantum Monte Carlo (QMC) method for anharmonic vibrational zero-point energies and transition frequencies is developed, which combines the diagrammatic vibrational many-body perturbation theory based on the Dyson equation with Monte Carlo integration. The infinite sums of the diagrammatic and thus size-consistent first- and second-order anharmonic corrections to the energy and self-energy are expressed as sums of a few m- or 2m-dimensional integrals of wave functions and a potential energy surface (PES) (m is the vibrational degrees of freedom). Each of these integrals is computed as the integrand (including the value of the PES) divided by the value of a judiciously chosen weight function evaluated on demand at geometries distributed randomly but according to the weight function via the Metropolis algorithm. In this way, the method completely avoids cumbersome evaluation and storage of high-order force constants necessary in the original formulation of the vibrational perturbation theory; it furthermore allows even higher-order force constants essentially up to an infinite order to be taken into account in a scalable, memory-efficient algorithm. The diagrammatic contributions to the frequency-dependent self-energies that are stochastically evaluated at discrete frequencies can be reliably interpolated, allowing the self-consistent solutions to the Dyson equation to be obtained. This method, therefore, can compute directly and stochastically the transition frequencies of fundamentals and overtones as well as their relative intensities as pole strengths, without fixed-node errors that plague some QMC. It is shown that, for an identical PES, the new method reproduces the correct deterministic values of the energies and frequencies within a few cm{sup −1} and pole strengths within a few thousandths. With the values of a PES evaluated on the fly at random geometries, the new method captures a noticeably greater proportion of anharmonic effects.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Convergence of Hyperbolic Neural Networks Under Riemannian Stochastic Gradient Descent

Abstract We prove, under mild conditions, the convergence of a Riemannian gradient descent method for a hyperbolic neural network regression model, both in batch gradient descent and stochastic gradient descent. We also discuss a Riemannian version of the Adam algorithm. We show numerical simulations of these algorithms on various benchmarks.

Whiting, Wes (ORCID:0000000247505060)↗

Inference of Rock Flow and Mechanical Properties from Injection-Induced Microseismic Events During Geologic CO 2 Storage

Monitoring microseismic activities during CO 2 injection into geologic formations is important for ensuring the safety of the storage operations. The resulting data provide insight into the response of the storage formation to CO 2 injection and can be used to infer the underlying rock flow and mechanical properties. In this paper, assimilation of microseismic data is performed for dynamic characterization of the storage formation by using a stochastic simulation model to forecast the microseismic response of a geologic formation during CO 2 injection. Two modeling approaches are adopted to predict the space-time distribution of the injection-induced microseismicity. The first model is based on pore pressure relaxation assumption, while the second model uses coupled flow and geomechanics simulation to establish the complex physical relation between the storage formation properties and the corresponding microseismic responses during CO 2 injection. The stochastic predictive models in each case are used in ensemble data assimilation frameworks to estimate rock properties from the observed microseismic data. Two data assimilation methods are considered: (i) a new ensemble-based stochastic point process filter (EnPPF) that can directly integrate discrete microseismic events, and (ii) a variant of ensemble smoother, known as the ensemble smoother with multiple data assimilation (ES-MDA), which requires continuous representation of microseismic events for assimilation. The two methods are successfully applied to a geologically realistic model of the Farnsworth Field in Texas, with complex geologic flow units and interacting fault systems.

42 ENGINEERING↗

DG-IMEX Stochastic Galerkin Schemes for Linear Transport Equation with Random Inputs and Diffusive Scalings

In this paper, we consider the linear transport equation under diffusive scaling and with random inputs. The method is based on the generalized polynomial chaos approach in the stochastic Galerkin framework. Several theoretical aspects will be addressed. Additionally, a uniform numerical stability with respect to the Knudsen number ϵ, and a uniform in ϵ error estimate is given. For temporal and spatial discretizations, we apply the implicit–explicit scheme under the micro–macro decomposition framework and the discontinuous Galerkin method, as proposed in Jang et al. (SIAM J Numer Anal 52:2048–2072, 2014) for deterministic problem. Lastly, we provide a rigorous proof of the stochastic asymptotic-preserving (sAP) property. Extensive numerical experiments that validate the accuracy and sAP of the method are conducted.

97 MATHEMATICS AND COMPUTING↗

Numerical analysis of randomly forced glycolitic oscillations

Randomly forced glycolytic oscillations in Higgins model are studied both numerically and analytically. Numerical analysis is based on the direct simulation of the solutions of stochastic system. Non-uniformity of the stochastic bundle along the deterministic cycle is shown. For the analytical investigation of the randomly forced Higgins model, the stochastic sensitivity function technique and confidence domains method are applied. Results of the influence of additive noise on the cycle of this model are given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reconstruction of Galaxy Star Formation Histories through SED Fitting:The Dense Basis Approach

We introduce the dense basis method for Spectral Energy Distribution (SED) fitting. It accurately recovers traditional SED parameters, including M {sub *}, SFR, and dust attenuation, and reveals previously inaccessible information about the number and duration of star formation episodes and the timing of stellar mass assembly, as well as uncertainties in these quantities. This is done using basis star formation histories (SFHs) chosen by comparing the goodness-of-fit of mock galaxy SEDs to the goodness-of-reconstruction of their SFHs. We train and validate the method using a sample of realistic SFHs at z = 1 drawn from stochastic realizations, semi-analytic models, and a cosmological hydrodynamical galaxy formation simulation. The method is then applied to a sample of 1100 CANDELS GOODS-S galaxies at 1 10{sup 9.5} M{sub ⊙}. About 40% of the CANDELS galaxies have SFHs whose maximum occurs at or near the epoch of observation. The dense basis method is scalable and offers a general approach to a broad class of data-science problems.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

Correlation function distributions for O ( N ) lattice field theories in the disordered phase

Numerical computations in strongly interacting quantum field theories are often performed using Monte Carlo sampling methods. A key task in these calculations is to estimate the value of a given physical quantity from the distribution of stochastic samples that are generated using the Monte Carlo method. Typically, the sample mean and sample variance are used to define the expectation values and uncertainties of computed quantities. However, the Monte Carlo sample distribution contains more information than these basic properties, and it is useful to investigate it more generally. In this work, the exact form of the probability distributions of two-point correlation functions at zero momentum in O ( N ) lattice field theories in the disordered phase and in infinite volume are determined. These distributions allow for a robust investigation of the efficacy of the Monte Carlo sampling procedure and are shown also to allow for improved estimators of the target physical quantity to be constructed. The theoretical expectations are shown to agree with numerical calculations in the O ( 2 ) model. Published by the American Physical Society 2024

Astronomy & Astrophysics↗