Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic approaches”

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 415 records · Page 23

Streaming Generalized Canonical Polyadic Tensor Decompositions

In this paper, we develop a method which we call OnlineGCP for computing the Generalized Canonical Polyadic (GCP) tensor decomposition of streaming data. GCP differs from traditional canonical polyadic (CP) tensor decompositions as it allows for arbitrary objective functions which the CP model attempts to minimize. This approach can provide better fits and more interpretable models when the observed tensor data is strongly non-Gaussian. In the streaming case, tensor data is gradually observed over time and the algorithm must incrementally update a GCP factorization with limited access to prior data. In this work, we extend the GCP formalism to the streaming context by deriving a GCP optimization problem to be solved as new tensor data is observed, formulate a tunable history term to balance reconstruction of recently observed data with data observed in the past, develop a scalable solution strategy based on segregated solves using stochastic gradient descent methods, describe a software implementation that provides performance and portability to contemporary CPU and GPU architectures and integrates with Matlab for enhanced usability, and demonstrate the utility and performance of the approach and software on several synthetic and real tensor data sets.

97 MATHEMATICS AND COMPUTING↗

Decomposing causality into its synergistic, unique, and redundant components

Causality lies at the heart of scientific inquiry, serving as the fundamental basis for understanding interactions among variables in physical systems. Despite its central role, current methods for causal inference face significant challenges due to nonlinear dependencies, stochastic interactions, self-causation, collider effects, and influences from exogenous factors, among others. While existing methods can effectively address some of these challenges, no single approach has successfully integrated all these aspects. Here, we address these challenges with SURD: Synergistic-Unique-Redundant Decomposition of causality. SURD quantifies causality as the increments of redundant, unique, and synergistic information gained about future events from past observations. The formulation is non-intrusive and applicable to both computational and experimental investigations, even when samples are scarce. We benchmark SURD in scenarios that pose significant challenges for causal inference and demonstrate that it offers a more reliable quantification of causality compared to previous methods.

applied mathematics↗

Physics-Informed Sparse Gaussian Process for Probabilistic Stability Analysis of Large-Scale Power System with Dynamic PVs and Loads

This work proposes a physics-informed sparse Gaussian process (SGP) for probabilistic stability assessment of large-scale power systems in the presence of uncertain dynamic PVs and loads. The differential and algebraic equations considering uncertainties from dynamic PVs and loads are reformulated to a nonlinear mapping relationship that allows the application of SGP. Thanks to the nonparametric characteristic of Gaussian process, the proposed framework does not require distributions of uncertain inputs and this distinguishes it from existing approaches. As the original Gaussian process is not scalable to large-scale systems with high dimensional uncertain inputs, this paper develops the SGP with a stochastic variational inference technique. It leads to approximately two orders of complex reduction. A data pre-processing step is also introduced to tackle the coexistence of stable and unstable cases by sample clustering and constructing separate SGPs. The probabilistic transient stability index is analyzed to assess system stability under different uncertain dynamics loads and PVs. Comparisons are performed with the sampling-based, the polynomial chaos expansion-based, and traditional Gaussian process-based methods on the modified IEEE 118-bus and Texas 2000-bus systems under various scenarios, including different levels of uncertainties and the existence of nonlinear correlations among dynamic PVs. The impacts of data quality and quantity issues are also investigated. It is shown that the proposed SGP achieves significantly improved computational efficiency while maintaining high accuracy with a limited number of data.

24 POWER TRANSMISSION AND DISTRIBUTION↗

GPS Spoofing Mitigation and Timing Risk Analysis in Networked Phasor Measurement Units via Stochastic Reachability

To address phasor measurement unit (PMU) vulnerability to spoofing, we propose the use of a set-valued state estimation technique known as stochastic reachability (SR)-based distributed Kalman filter (DKF) that computes secure global positioning system (GPS) timing across a network of receivers. Utilizing SR, we estimate not only GPS time but also its stochastic reachable set, which is parameterized by probabilistic zonotope (p-Zonotope). While requiring known measurement error bounds in only non-spoofed conditions, we designed a two-tiered approach. We first performed measurement-level spoofing mitigation via deviation of a measurement innovation from its expected p-Zonotope. We then performed state-level timing risk analysis via a determination of the intersection probability of the estimated p-Zonotope with an unsafe set that violates IEEE C37.118.1a-2014 standards. Finally, we validated our SR-DKF algorithm by subjecting it to a simulated receiver network to coordinate signal-level spoofing. We demonstrate improved timing accuracy and successful spoofing mitigation via the use of our SR-DKF algorithm. We also validated the robustness of the estimated timing risk as the number of receivers were varied.

47 OTHER INSTRUMENTATION↗

Acoustic Tomography of the Atmosphere: A Large-Eddy Simulation Sensitivity Study

Accurate measurement of atmospheric turbulent fluctuations is critical for understanding environmental dynamics and improving models in applications such as wind energy. Advanced remote sensing technologies are essential for capturing instantaneous velocity and temperature fluctuations. Acoustic tomography (AT) offers a promising approach that utilizes sound travel times between an array of transducers to reconstruct turbulence fields. This study presents a systematic evaluation of the time-dependent stochastic inversion (TDSI) algorithm for AT using synthetic travel-time measurements derived from large-eddy simulation (LES) fields under both neutral and convective atmospheric boundary-layer conditions. Unlike prior work that relied on field observations or idealized fields, the LES framework provides a ground-truth atmospheric state, enabling quantitative assessment of TDSI retrieval reliability, sensitivity to travel-time measurement noise, and dependence on covariance model parameters and temporal data integration. A detailed sensitivity analysis was conducted to determine the best-fit model parameters, identify the tolerance thresholds for parameter mismatch, and establish a maximum spatial resolution. The TDSI algorithm successfully reconstructed large-scale velocity and temperature fluctuations with root mean square errors ( RMSE s) below 0.35 m/s and 0.12 K, respectively. Spectral analysis established a maximum spatial resolution of approximately 1.4 m, and reconstructions remained robust for travel-time measurement uncertainties up to 0.002 s. These findings provide critical insights into the operational limits of TDSI and inform future applications of AT for atmospheric turbulence characterization and system design.

17 WIND ENERGY↗

A Stochastic Multi-Criteria Decision-Making Algorithm for Dynamic Load Prioritization in Grid-Interactive Efficient Buildings

Increasing deployment of advanced sensing, controls, and communication infrastructure enables buildings to provide services to the power grid, leading to the concept of grid-interactive efficient buildings. Since occupant activities and preferences primarily drive the availability and operational flexibility of building devices, there is a critical need to develop occupant-centric approaches that prioritize devices for providing grid services, while maintaining the desired end-use quality of service. In this paper, we present a decision-making framework that facilitates a building owner/operator to effectively prioritize loads for curtailment service under uncertainties, while minimizing any adverse impact on the occupants. The proposed framework uses a stochastic (Markov) model to represent the probabilistic behavior of device usage from power consumption data, and a load prioritization algorithm that dynamically ranks building loads using a stochastic multi-criteria decision-making algorithm. The proposed load prioritization framework is illustrated via numerical simulations in a residential building use-case, including plug-loads, air-conditioners, and plug-in electric vehicle chargers, in the context of load curtailment as a grid service. Suitable metrics are proposed to evaluate the closed-loop performance of the proposed prioritization algorithm under various scenarios and design choices. Scalability of the proposed algorithm is established via computational analysis, while time-series plots are used for intuitive explanation of the ranking choices.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

Production of neutron-rich heavy nuclei in deep-inelastic 208 Pb + 208 Pb collisions within the stochastic mean-field theory

In deep-inelastic collisions of heavy nuclei, reaction products with a wide range of mass and charge are produced. Such collisions been considered as a possible way to produce superheavy nuclei, as an alternative to fusion reactions. To provide reliable theoretical predictions, it is desired to develop microscopic approaches that correctly and accurately describe nucleon transfer processes in dissipative collisions of heavy nuclei. The purpose of the present work is (1) to investigate the mechanism of nucleon transfers in dissipative collisions of two heavy nuclei, and (2) to explore possible pathways to produce neutron-rich heavy nuclei, through detailed theoretical analyses of fluctuations and correlations in nucleon transfers in 208 Pb + 208 Pb reactions. Three-dimensional time-dependent Hartree-Fock (TDHF) calculations are performed for the collisions of 208 Pb + 208 Pb at 𝐸 c.m. = 832, 936, and 1040 MeV, using the Skyrme SLy4d energy density functional. To calculate fluctuations and correlations in nucleon transfers, we employ the stochastic mean-field (SMF) theory, and the results are compared with another theoretical framework currently available, the time-dependent random phase approximation (TDRPA). Primary and secondary production cross sections are calculated with the SMF theory combined with a statistical model, GEMINI ++ . Using information of nucleon flow across a neck of colliding nuclei in TDHF calculations, we solve quantal diffusion equations for fluctuations and correlations in nucleon transfers based on the SMF theory. From the SMF calculations, we obtain the time evolution of diffusion coefficients as well as fluctuations and correlations in nucleon transfers for a range of initial orbital angular momenta. We compare the results of the SMF calculations with those of TDRPA, showing that TDRPA tends to predict substantially larger fluctuations and correlations in strongly damped collisions of heavy nuclei, which exhibit complex initial angular momentum dependence, while the SMF results provide almost constant (stable) values. Using the obtained fluctuations and correlations, we calculate primary and secondary production cross sections for the 208 Pb + 208 Pb collisions. From the results, we find that both lighter and heavier reaction products as compared to 208 Pb are produced for a wide region in the 𝑁−𝑍 plane as primary products, thanks to the quantal diffusion mechanism in the dissipative collisions. However, we show that cross sections for production of heavy nuclei with 𝑍 ≳ 90 or 𝑁 ≳ 135 are washed out due to secondary particle evaporation and/or fission processes. On the other hand, we find that there remain sizable cross sections for production of neutron-rich nuclei along 𝑁 = 126 with 𝑍< 82, even after secondary disintegration processes. We demonstrate that the secondary production cross sections depend weakly on incident energies, but lower (higher) energy is slightly preferred for production of nuclei with smaller (larger) atomic numbers as compared to 𝑍 = 82. Here, based on the microscopic SMF calculations, it has been shown that deep-inelastic collisions of heavy nuclei, such as 208 Pb + 208 Pb examined in this study, can be a promising means to produce neutron-rich heavy nuclei along 𝑁=126. Discrepancies between the SMF and TDRPA approaches are left unsolved for future investigations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

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↗

Stochastic parametric skeletal dosimetry model for humans: Pediatric and adult computational skeleton phantoms for internal bone marrow dosimetry

Currently, computational phantoms that simulate skeletal tissues are used in active red bone marrow (AM) internal dosimetry. Up-to-date reference computational phantoms recommended by the ICRP are based on the analysis of CT-images of cadavers. Such phantoms have significant disadvantages. One disadvantage is that the assessment of uncertainty due to the population variability of skeleton dimensions and microstructure results from the limited availability of autopsy material. Another disadvantage is the simplified modelling of cortical layer and bone microarchitecture. A method of stochastic parametric skeletal dosimetry modelling of the bone structures – SPSD modelling – has been developed as an alternative to the ICRP reference phantoms. In the framework of this approach, skeletal phantom parameters are evaluated based on extensively reviewed results of published measurements of real bones. The SPSD approach allows for the assessment of both population-average values and their variability. SPSD-phantoms of the skeleton are modelled in voxel representation. They consist of smaller phantoms of the bone sites – segments – described by simple geometric shapes with uniform microarchitecture parameters. Such segmentation makes it possible to account for non-homogeneous skeletal microarchitecture and to model the bone structure with the required voxel resolution to elaborate suitable skeletal phantoms. The current study presents the parameters of the SPSD skeletal phantoms for the following age-groups: newborn, 1-year-old, 5-year-old, 10-year-old, 15-year-old (male and female), and adult (male and female). This skeletal phantom can be used for dosimetry as an alternative to available reference phantoms for bone-seeking radionuclides. The above-mentioned age- and sex-specific skeletal phantoms are comprised of 289 unique segments. The characteristics of the SPSD phantoms do not contradict published data and are in good agreement with the measurement results of real bones.

Science & Technology - Other Topics↗

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 global maximum likelihood estimator from local minima. Simultaneously, a recent trend in theoretical computer science and numerical linear algebra leverages randomization to solve very large, hard problems. The typical approach is to use randomization for a fast approximation and determinism for refinement to yield effective algorithms with theoretical guarantees. Two popular algorithms for Poisson CPD reflect that emergent dichotomy: CP Alternating Poisson Regression is a deterministic algorithm and Generalized Canonical Polyadic decomposition makes use of stochastic algorithms in several variants. This work extends recent work to develop two new methods that leverage randomized and deterministic algorithms for improved accuracy and performance.

97 MATHEMATICS AND COMPUTING↗

Forces from Stochastic Density Functional Theory under Nonorthogonal Atom-Centered Basis Sets

We develop a formalism for calculating forces on the nuclei within the linear-scaling stochastic density functional theory (sDFT) in a nonorthogonal atom-centered basis set representation (Fabian et al. Wiley Interdiscip. Rev.: Comput. Mol. Sci. 2019, 9, e1412, 10.1002/wcms.1412) and apply it to the Tryptophan Zipper 2 (Trp-zip2) peptide solvated in water. We use an embedded-fragment approach to reduce the statistical errors (fluctuation and systematic bias), where the entire peptide is the main fragment and the remaining 425 water molecules are grouped into small fragments. We analyze the magnitude of the statistical errors in the forces and find that the systematic bias is of the order of 0.065 eV/Å (~1.2 × 10 -3 E h / a 0 ) when 120 stochastic orbitals are used, independently of system size. This magnitude of bias is sufficiently small to ensure that the bond lengths estimated by stochastic DFT (within a Langevin molecular dynamics simulation) will deviate by less than 1% from those predicted by a deterministic calculation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Stochastic tensor contraction for quantum chemistry

Many computational methods in ab initio quantum chemistry are formulated in terms of high-order tensor contractions, whose cost determines the size of system that can be studied. We introduce stochastic tensor contraction to perform such operations with greatly reduced cost, and present its application to the gold-standard quantum chemistry method, coupled cluster theory with up to perturbative triples. For total energy errors more stringent than chemical accuracy, we reduce the computational scaling to that of mean-field theory, while starting to approach the mean-field absolute cost, thereby challenging the existing cost-to-accuracy landscape. Benchmarks against state-of-the-art local correlation approximations further show that we achieve an order-of-magnitude improvement in both total computation time and error, with significantly reduced sensitivity to system dimensionality and electron delocalization. We conclude that stochastic tensor contraction is a powerful computational primitive to accelerate a wide range of quantum chemistry.

Chemical Physics (physics.chem-ph)↗

A deterministic verification strategy for electrostatic particle-in-cell algorithms in arbitrary spatial dimensions using the method of manufactured solutions

As simulations of kinetic plasmas continue to increase in scope and complexity, a rigorous and straightforward method for verifying particle-in-cell (PIC) implementations is necessary to ensure their correctness. Here, in this paper, we present a deterministic method for the rigorous verification of multidimensional, multispecies, electrostatic particle-in-cell codes based on the method of manufactured solutions. Specifically, we prove that rigorous verification is possible through the exclusive examination of errors of grid quantities (i.e., moments and/or fields), allowing for a very light-weight and non-intrusive implementation in existing PIC codes. This is a marked improvement over earlier PIC verification approaches (only demonstrated with one species in 1D-1V), which rely on the comparison of cumulative distribution functions, and are invasive on the code base, introduce additional stochastic noise, are significantly more computationally expensive, and lack rigorous convergence properties. Interestingly, we show that different grid quantities feature different rates of convergence with the number of particles and mesh size, impacting the verification process. These theoretical results are confirmed numerically with a multi-species 2D-2V particle-in-cell code, including the ability of the method to detect order reduction due to an incorrect implementation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Concurrent multi-peak Bragg coherent x-ray diffraction imaging of 3D nanocrystal lattice displacement via global optimization

Abstract In this paper we demonstrated a method to reconstruct vector-valued lattice distortion fields within nanoscale crystals by optimization of a forward model of multi-reflection Bragg coherent diffraction imaging (MR-BCDI) data. The method flexibly accounts for geometric factors that arise when making BCDI measurements, is amenable to efficient inversion with modern optimization toolkits, and allows for globally constraining a single image reconstruction to multiple Bragg peak measurements. This is enabled by a forward model that emulates the multiple Bragg peaks of a MR-BCDI experiment from a single estimate of the 3D crystal sample. We present this forward model, we implement it within the stochastic gradient descent optimization framework, and we demonstrate it with simulated and experimental data of nanocrystals with inhomogeneous internal lattice displacement. We find that utilizing a global optimization approach to MR-BCDI affords a reliable path to convergence of data which is otherwise challenging to reconstruct.

36 MATERIALS SCIENCE↗

Regulating loops in de Sitter spacetime

Perturbative quantum field theory (QFT) calculations in de Sitter space are riddled with contributions that diverge over time. These contributions often arise from loop integrals, which are notoriously hard to compute in de Sitter. We discuss an approach to evaluate loop integrals that contribute to equal-time correlators of a scalar field theory in a fixed de Sitter background. Our method is based on the Mellin-Barnes representation of correlation functions, which allows us to regulate loop divergences by adjusting the masses of the fields, or by gently deforming the underlying de Sitter spacetime. The resulting expressions have a similar structure as a standard answer from dimensional regularization in flat space QFT. These features of the regulator are illustrated with two examples, worked out in detail. Along the way, we illuminate the physical origin of these divergences and their interpretation with the machinery of the dynamical renormalization group. Our approach regulates the IR divergences of massless and massive particles in the same way. For massless scalars, the loop corrections can be incorporated as systematic improvements to the stochastic inflation framework, allowing for a more precise description of the IR dynamics of such fields in de Sitter. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

Dynamic molecular architecture of the synaptonemal complex

During meiosis, pairing between homologous chromosomes is stabilized by the assembly of the synaptonemal complex (SC). The SC ensures the formation of crossovers between homologous chromosomes and regulates their distribution. However, how the SC regulates crossover formation remains elusive. We isolated an unusual mutation in Caenorhabditis elegans that disrupts crossover interference but not SC assembly. This mutation alters the unique C terminal domain of an essential SC protein, SYP-4, a likely ortholog of the vertebrate SC protein SIX6OS1. We use three-dimensional stochastic optical reconstruction microscopy (3D-STORM) to interrogate the molecular architecture of the SC from wild-type and mutant C. elegans animals. Using a probabilistic mapping approach to analyze super-resolution image data, we detect changes in the organization of the synaptonemal complex in wild-type animals that coincide with crossover designation. We also found that our syp-4 mutant perturbs SC architecture. Our findings add to growing evidence that the SC is an active material whose molecular organization contributes to chromosome-wide crossover regulation.

59 BASIC BIOLOGICAL SCIENCES↗