Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic approximation”

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 613 records · Page 34

Quantum optimal control of multiple weakly interacting molecular rotors in the time-dependent Hartree approximation

In this work we perform quantum optimal control simulations, based on the Time-Dependent Hartree (TDH) approximation, for systems of three to five dipole-dipole coupled OCS rotors. A control electric field is used to steer all of the individual rotors, arranged in chains and regular polygons in a plane, toward either identical or unique objectives. The goal is to explore the utility of the TDH approximation to model the field-induced dynamics of multiple interacting rotors in the weak dipole-dipole coupling regime. A stochastic hill climbing approach is employed to seek an optimal control field that achieves the desired objectives at a specified target time. We first show that multiple rotors in chain and polygon geometries can be identically oriented in the same direction; these cases do not significantly depend on the presence of the dipole-dipole interaction. Additionally, in particular geometrical arrangements, we demonstrate that individual rotors can be uniquely manipulated toward different objectives with the same field. Specifically, it is shown that for a three rotor chain, the two end rotors can be identically oriented in a specific direction while keeping the middle rotor in its ground state, and for an equilateral triangle, two rotors can be identically oriented in a specific direction while the third rotor is oriented in the opposite direction. These multirotor unique objective cases exploit the shape of the field in coordination with dipole-dipole coupling between the rotors. Comparisons to numerically exact calculations, utilizing the TDH-determined fields, are given for all optimal control studies involving systems of three rotors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Predictive Model for Starlink Maritime Performance Using Multi-Horizon RandomForest

Low Earth orbit (LEO) satellite systems have become a crucial enabler of broadband access for maritime industries, where traditional networks are unavailable. However, the high mobility of LEO constellations and constantly changing weather conditions result in unpredictable link fluctuations, limiting the ability of maritime platforms to plan bandwidth usage proactively. To the best of our knowledge, no prior work has developed a short-term predictive model for maritime LEO connectivity using real experimental field measurements. This paper proposes a data-driven forecasting model that predicts future downlink throughput using multi-horizon RandomForest regression. The model is trained using real experimental coastal measurement data incorporating recent throughput history, network-layer indicators, and environmental variables. The proposed approach reduces mean absolute error by approximately 31% compared to a persistence baseline for 15-minute horizons. It maintains a measurable improvement at 30 minutes, despite increased stochasticity. These findings confirm that proactive bandwidth awareness is feasible on maritime platforms and can effectively support operational decisions such as adaptive streaming, routing, and resource scheduling. The performance gap between forecasting horizons also highlights the need for expanded offshore datasets to improve prediction robustness under harsher maritime environments.

97 MATHEMATICS AND COMPUTING↗

X-ray Computed Tomography as a Metrology Technique for the Analysis of Additively Manufactured Material

X-ray computed tomography (X-ray CT) is an analytical technique used in materials science to non-destructively characterize features in a variety materials like polymer, metals, composites, and explosives. It also has the capability of imaging additively manufacture, machine and assembled parts. The non-destructive imaging allows for the analysis of features (voids and cracks), which give a fundamental understanding of the material characteristics. Additionally, X-ray CT can obtain accurate measurements of dimensional and topographic variations due to different stimuli and assess the accuracy of material production. This study focuses on parts manufactured via metal additive manufacturing (AM). Although AM produces parts faster and easier, the printing process can produce defects (pores and surface roughness) that undermine the part’s mechanical properties and performance. The analysis of 3D printed objects has an asset in that the material has an STL file from which the item was printed, which is not available in many manufactured materials (i.e., foams) due to stochastic structures. For this study, the print accuracy of four additively manufactured cylinders will be assessed via X-ray CTto approximate the surface roughness and visualize any major morphological changes to assess the dimensional accuracy of complex additively manufactured parts. It was concluded that using X-ray CT to measure surface roughness was affective because reasonable surface roughness values were measured. Additionally, itwas determined that small-scale features can be produced via additive manufacturing with strong dimensional accuracy so long as the features are highly complex with sharp grooves.

36 MATERIALS SCIENCE↗

A Simple Stochastic Model for Generating Broken Cloud Optical Depth and Top Height Fields

A simple and fast algorithm for generating two correlated stochastic twodimensional (2D) cloud fields is described. The algorithm is illustrated with two broken cumulus cloud fields: cloud optical depth and cloud top height retrieved from Moderate Resolution Imaging Spectrometer (MODIS). Only two 2D fields are required as an input. The algorithm output is statistical realizations of these two fields with approximately the same correlation and joint distribution functions as the original ones. The major assumption of the algorithm is statistical isotropy of the fields. In contrast to fractals and the Fourier filtering methods frequently used for stochastic cloud modeling, the proposed method is based on spectral models of homogeneous random fields. For keeping the same probability density function as the (first) original field, the method of inverse distribution function is used. When the spatial distribution of the first field has been generated, a realization of the correlated second field is simulated using a conditional distribution matrix. This paper is served as a theoretical justification to the publicly available software that has been recently released by the authors and can be freely downloaded from http://i3rc.gsfc.nasa.gov/Public codes clouds.htm. Though 2D rather than full 3D, stochastic realizations of two correlated cloud fields that mimic statistics of given fields have proved to be very useful to study 3D radiative transfer features of broken cumulus clouds for better understanding of shortwave radiation and interpretation of the remote sensing retrievals.

Prigarin, Sergei M.↗

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗

Stochastically Realized Observables for Excitonic Molecular Aggregates

In this work, we show that a stochastic approach enables calculations of the optical properties of large 2-dimensional and nanotubular excitonic molecular aggregates. Previous studies of such systems relied on numerically diagonalizing the dense and disordered Frenkel Hamiltonian, which scales approximately as $\mathcal{O}$($N$ 3 ) for $N$ dye molecules. Our approach scales much more efficiently as $\mathcal{O}$($N$ log($N$)), enabling quick study of systems with a million of coupled molecules on the micrometer size scale. We calculate several important experimental observables, including the optical absorption spectrum and density of states, and develop a stochastic formalism for the participation ratio. Quantitative agreement with traditional matrix diagonalization methods is demonstrated for both small- and intermediate-size systems. The stochastic methodology enables the study of the effects of spatial-correlation in site energies on the optical signatures of large 2D aggregates. Our results demonstrate that stochastic methods present a path forward for screening structural parameters and validating experiments and theoretical predictions in large excitonic aggregates.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

THE MATRYOSHKA RUN. II. TIME-DEPENDENT TURBULENCE STATISTICS, STOCHASTIC PARTICLE ACCELERATION, AND MICROPHYSICS IMPACT IN A MASSIVE GALAXY CLUSTER

We use the Matryoshka run to study the time-dependent statistics of structure-formation-driven turbulence in the intracluster medium of a 10{sup 15} M {sub ☉} galaxy cluster. We investigate the turbulent cascade in the inner megaparsec for both compressional and incompressible velocity components. The flow maintains approximate conditions of fully developed turbulence, with departures thereof settling in about an eddy-turnover time. Turbulent velocity dispersion remains above 700 km s{sup –1} even at low mass accretion rate, with the fraction of compressional energy between 10% and 40%. The normalization and the slope of the compressional turbulence are susceptible to large variations on short timescales, unlike the incompressible counterpart. A major merger occurs around redshift z ≅ 0 and is accompanied by a long period of enhanced turbulence, ascribed to temporal clustering of mass accretion related to spatial clustering of matter. We test models of stochastic acceleration by compressional modes for the origin of diffuse radio emission in galaxy clusters. The turbulence simulation model constrains an important unknown of this complex problem and brings forth its dependence on the elusive microphysics of the intracluster plasma. In particular, the specifics of the plasma collisionality and the dissipation physics of weak shocks affect the cascade of compressional modes with strong impact on the acceleration rates. In this context radio halos emerge as complex phenomena in which a hierarchy of processes acting on progressively smaller scales are at work. Stochastic acceleration by compressional modes implies statistical correlation of radio power and spectral index with merging cores distance, both testable in principle with radio surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

A Comparison of Monte Carlo Particle Transport Algorithms for an Interior Source Binary Stochastic Medium Benchmark Suite

Particle transport through binary stochastic mixtures has received considerable research attention in the last two decades. Zimmerman and Adams proposed a Monte Carlo algorithm (Algorithm A) that solves the Levermore-Pomraning equations and another Monte Carlo algorithm (Algorithm B) that should be more accurate as a result of improved local material realization modeling. Zimmerman and Adams numerically confirmed these aspects of the Monte Carlo algorithms by comparing the reflection and transmission values computed using these algorithms to a standard suite of planar geometry binary stochastic mixture benchmark transport solutions. The benchmark transport problems are driven by an isotropic angular flux incident on one boundary of a binary Markovian statistical planar geometry medium. In a recent paper, we extended the benchmark comparisons of these Monte Carlo algorithms to include the scalar flux distributions produced. This comparison is important, because as demonstrated, an approximate model that gives accurate reflection and transmission probabilities can produce unphysical scalar flux distributions. Brantley and Palmer recently investigated the accuracy of the Levermore-Pomraning model using a new interior source binary stochastic medium benchmark problem suite. In this paper, we further investigate the accuracy of the Monte Carlo algorithms proposed by Zimmerman and Adams by comparing to the benchmark results from the interior source binary stochastic medium benchmark suite, including scalar flux distributions. Because the interior source scalar flux distributions are of an inherently different character than the distributions obtained for the incident angular flux benchmark problems, the present benchmark comparison extends the domain of problems for which the accuracy of these Monte Carlo algorithms has been investigated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical Schemes for Rough Parabolic Equations

This paper is devoted to the study of numerical approximation schemes for a class of parabolic equations on (0,1) perturbed by a non-linear rough signal. It is the continuation of Deya (Electron. J. Probab. 16:1489-1518, 2011) and Deya et al. (Probab. Theory Relat. Fields, to appear), where the existence and uniqueness of a solution has been established. The approach combines rough paths methods with standard considerations on discretizing stochastic PDEs. The results apply to a geometric 2-rough path, which covers the case of the multidimensional fractional Brownian motion with Hurst index H>1/3.

97 MATHEMATICS AND COMPUTING↗

Kernel learning backward SDE filter for data assimilation

In this paper, we develop a kernel learning backward SDE filter method to estimate the state of a stochastic dynamical system based on its partial noisy observations. A system of forward backward stochastic differential equations is used to propagate the state of the target dynamical model, and Bayesian inference is applied to incorporate the observational information. Further, to characterize the dynamical model in the entire state space, we introduce a kernel learning method to learn a continuous global approximation for the conditional probability density function of the target state by using discrete approximated density values as training data. Numerical experiments demonstrate that the kernel learning backward SDE is highly effective.

97 MATHEMATICS AND COMPUTING↗

A Comparison of Closures for Stochastic Advection-Dispersion

Perturbation-based moment equations for advection-dispersion equations with random advection have been shown to produce physically unrealistic multimodality. Despite similarities, macrodispersion theory applied to advection-dispersion equations produces moments that do not exhibit such multimodal behavior. This is because macrodispersion approximations, whether explicitly or implicitly, involve renormalized perturbations that remove secularity by including select higher-order terms. We consider basic differences between the two approaches using a low-order macrodispersion approximation to clarify why one produces physically meaningful behavior while the other does not. We demonstrate that using a conventional asymptotic expansion (in the order of velocity fluctuations) leads to equations that cannot produce physically meaningful (macro)dispersion, whether applied to moment equations or macrodispersion theory, proving that the resulting moment equations are in fact hyperbolic in one spatial dimension. We identify higher-order terms that must be added to the conventional expansion to recover second- and fourth-order macrodispersivity approximations. Finally, we propose a closed-form approximation to two-point covariance as a measure of uncertainty, in a manner consistent with the derivation of macrodispersivity. We demonstrate that this and all the macrodispersion-based approximations to moments are more accurate than the alternatives for an example of transport in stratified random media.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Real-time Ridesharing for Transportation Hubs with Demand and Supply Uncertainty

Transportation hubs in major cities generate a significant amount of trips by taxis and for-hail vehicles (FHV), with many of the trips sharing similar destinations. This suggests promising opportunities to leverage the collective travel needs with dedicated ridesharing solutions to reduce the externalities of excessive traffic at transportation hubs. In this study, we develop a novel dynamic ridesharing approach to serve trips from the transportation hub by considering (1) demand (new passengers) and supply (newly available vehicles) in the near future and (2) the uncertainty of future predictions. Our approach consists of two stages. In the first stage, we develop a data structure called hub mobility tree to generate potential combinations of shareable trips as candidate schedules efficiently. Then the generated schedules are used in the second stage to formulate the stochastic hub-based ridesharing problem (SHRP), which is a stochastic integer programming problem with the objective to maximize the total expected ridesharing profit over time. Due to the prohibitive number of shareable trips, we then approximately solve SHRP by the sample average approximate method (SAA), and a dual Lagrangian technique is implemented to further improve the scalability of the solution approach. We demonstrate the performances of the proposed method by simulating the ridesharing service at JFK airport using NYC taxi and FHV data. The results indicate that the proposed method outperforms the myopic ridesharing (maximize profit for a single time step) and the rolling horizon method with point estimation of future demand and supply.

dynamic ridesharing↗

Lower hybrid wavepacket stochasticity revisited

Analysis is presented in support of the explanation in Ref. [1] for the observation of relativistic electrons during Lower Hybrid (LH) operation in EC pre-heated plasma at the WEGA stellarator [1,2]. LH power from the WEGA TE11 circular waveguide, 9 cm diameter, un-phased, 2.45 GHz antenna, is radiated into a B≅0.5 T, М„n{sub e}≅5×10{sup 17} 1/m{sup 3} plasma at T{sub e}≅10 eV bulk temperature with an EC generated 50 keV component [1]. The fast electrons cycle around flux or drift surfaces with few collisions, sufficient for randomizing phases but insufficient for slowing fast electrons down, and thus repeatedly interact with the rf field close to the antenna mouth, gaining energy in the process. Our antenna calculations reveal a standing electric field pattern at the antenna mouth, with which we formulate the electron dynamics via a relativistic Hamiltonian. A simple approximation of the equations of motion leads to a relativistic generalization of the area-preserving Fermi-Ulam (F-U) map [3], allowing phase-space global stochasticity analysis. At typical WEGA plasma and antenna conditions, the F-U map predicts an LH driven current of about 230 A, at about 225 W of dissipated power, in good agreement with the measurements and analysis reported in [1].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mathematical foundation of quantum annealing

Quantum annealing is a generic name of quantum algorithms that use quantum-mechanical fluctuations to search for the solution of an optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum computation. The present paper reviews the mathematical and theoretical foundations of quantum annealing. In particular, theorems are presented for convergence conditions of quantum annealing to the target optimal state after an infinite-time evolution following the Schroedinger or stochastic (Monte Carlo) dynamics. It is proved that the same asymptotic behavior of the control parameter guarantees convergence for both the Schroedinger dynamics and the stochastic dynamics in spite of the essential difference of these two types of dynamics. Also described are the prescriptions to reduce errors in the final approximate solution obtained after a long but finite dynamical evolution of quantum annealing. It is shown there that we can reduce errors significantly by an ingenious choice of annealing schedule (time dependence of the control parameter) without compromising computational complexity qualitatively. A review is given on the derivation of the convergence condition for classical simulated annealing from the view point of quantum adiabaticity using a classical-quantum mapping.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Machine-learning error models for approximate solutions to parameterized systems of nonlinear equations

Here, this work proposes a machine-learning framework for constructing statistical models of errors incurred by approximate solutions to parameterized systems of nonlinear equations. These approximate solutions may arise from early termination of an iterative method, a lower-fidelity model, or a projection-based reduced-order model, for example. The proposed statistical model comprises the sum of a deterministic regression-function model and a stochastic noise model. The method constructs the regression-function model by applying regression techniques from machine learning (e.g., support vector regression, artificial neural networks) to map features (i.e., error indicators such as sampled elements of the residual) to a prediction of the approximate-solution error. The method constructs the noise model as a mean-zero Gaussian random variable whose variance is computed as the sample variance of the approximate-solution error on a test set; this variance can be interpreted as the epistemic uncertainty introduced by the approximate solution. This work considers a wide range of feature-engineering methods, data-set-construction techniques, and regression techniques that aim to ensure that (1) the features are cheaply computable, (2) the noise model exhibits low variance (i.e., low epistemic uncertainty introduced), and (3) the regression model generalizes to independent test data. Finally, numerical experiments performed on several computational-mechanics problems and types of approximate solutions demonstrate the ability of the method to generate statistical models of the error that satisfy these criteria and significantly outperform more commonly adopted approaches for error modeling.

97 MATHEMATICS AND COMPUTING↗

Generative diffusion model surrogates for mechanistic agent-based biological models

Mechanistic, multicellular, agent-based models are commonly used to investigate tissue, organ, and organism-scale biology at single-cell resolution. The Cellular-Potts Model (CPM) is a powerful and popular framework for developing and interrogating these models. CPMs become computationally expensive at large space- and time- scales making application and investigation of developed models difficult. Surrogate models may allow for the accelerated evaluation of CPMs of complex biological systems. However, the stochastic nature of these models means each set of parameters may give rise to different model configurations, complicating surrogate model development. In this work, we leverage denoising diffusion probabilistic models (DDPMs) to train a generative AI surrogate of a CPM used to investigate in vitro vasculogenesis. We describe the use of an image classifier to learn the characteristics that define unique areas of a 2-dimensional parameter space. We then apply this classifier to aid in surrogate model selection and verification. Our CPM model surrogate generates model configurations 20,000 timesteps ahead of a reference configuration and demonstrates approximately a 22x reduction in computational time as compared to native code execution. Our work represents a step towards the implementation of DDPMs to develop digital twins of stochastic biological systems.

97 MATHEMATICS AND COMPUTING↗

Divergence of Solutions to Perturbation-Based Advection-Dispersion Moment Equations

Moment equation methods are popular and powerful tools for modeling transport processes in randomly heterogeneous porous media, but the application of these methods to advection-dispersion equations often leads to erroneous oscillations. Perturbative methods, required to close systems of moment equations, become inaccurate for large perturbations; however, little quantitative theory exists for determining when this occurs for advection-dispersion equations. We consider three different methods (asymptotic approximation, Eulerian truncation, and iterative solution) for closing and solving advection-dispersion moment equations describing transport in stratified porous media with random permeability. We obtain approximate analytical expressions for time above which the asymptotic approximation to the mean diverges, in particular quantifying the impact that dispersion has on delaying---but not eliminating---divergence. We demonstrate that Eulerian truncation and iterative solution methods do not eliminate divergent behavior either. Our divergence criteria provide \emph{a priori} estimates that signal a warning to the practitioner of stochastic advection-dispersion equations to carefully consider whether to apply perturbative approaches.

58 GEOSCIENCES↗

Noise in biological circuits

Noise biology focuses on the sources, processing, and biological consequences of the inherent stochastic fluctuations in molecular transitions or interactions that control cellular behavior. These fluctuations are especially pronounced in small systems where the magnitudes of the fluctuations approach or exceed the mean value of the molecular population. Noise biology is an essential component of nanomedicine where the communication of information is across a boundary that separates small synthetic and biological systems that are bound by their size to reside in environments of large fluctuations. Here we review the fundamentals of the computational, analytical, and experimental approaches to noise biology. We review results that show that the competition between the benefits of low noise and those of low population has resulted in the evolution of genetic system architectures that produce an uneven distribution of stochasticity across the molecular components of cells and, in some cases, use noise to drive biological function. We review the exact and approximate approaches to gene circuit noise analysis and simulation, and reviewmany of the key experimental results obtained using flow cytometry and time-lapse fluorescent microscopy. In addition, we consider the probative value of noise with a discussion of using measured noise properties to elucidate the structure and function of the underlying gene circuit. Lastly, we conclude with a discussion of the frontiers of and significant future challenges for noise biology.

59 BASIC BIOLOGICAL SCIENCES↗