Search NASA⌕ Search

SEARCH · Search NASA

Results for “Randomized 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

On unifying randomized methods for inverse problems

This work unifies the analysis of various randomized methods for solving linear and nonlinear inverse problems with Gaussian priors by framing the problem in a stochastic optimization setting. By doing so, we show that many randomized methods are variants of a sample average approximation (SAA). More importantly, we are able to prove a single theoretical result that guarantees the asymptotic convergence for a variety of randomized methods. Additionally, viewing randomized methods as an SAA enables us to prove, for the first time, a single non-asymptotic error result that holds for randomized methods under consideration. Another important consequence of our unified framework is that it allows us to discover new randomization methods. Here, we present various numerical results for linear, nonlinear, algebraic, and PDE-constrained inverse problems that verify the theoretical convergence results and provide a discussion on the apparently different convergence rates and the behavior for various randomized methods.

42 ENGINEERING↗
DOE OSTI2019

Randomized methods to characterize large-scale vortical flow networks

We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze their collective dynamics. These approaches have recently been generalized to analyze high-dimensional turbulent flows, for which network computations can become prohibitively expensive. In this work, we propose efficient methods to approximate network quantities, such as the leading eigendecomposition of the adjacency matrix, using randomized methods. Specifically, we use the Nyström method to approximate the leading eigenvalues and eigenvectors, achieving significant computational savings and reduced memory requirements. The effectiveness of the proposed technique is demonstrated on two high-dimensional flow fields: two-dimensional flow past an airfoil and two-dimensional turbulence. We find that quasi-uniform column sampling outperforms uniform column sampling, while both feature the same computational complexity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Negative fluxes and cell-miss errors in the random ray method

The random ray method is a recently developed stochastic method for solving neutral particle transport problems based on the method of characteristics. Perhaps surprisingly for a characteristics-based method using flat sources, we note that the random ray method can produce negative fluxes which may be numerically troublesome in several situations. These occur most severely in fixed source problems where the source is in a region with a small cross section. Additionally, we briefly discuss another source of bias which can occur in similar situations, namely a ray missing a mesh with a strong source and small cross section, resulting in the entirety of the source being unphysically deposited locally. This paper describes the mechanism by which negative fluxes may occur and several different methods to mitigate their effects. These fixes are tested on an eigenvalue problem, a ‘fusion-like’ shielding problem, and a shielding problem featuring an adjoint calculation. Even when extremely coarse random ray quadratures are used such that 20%–30% of cells are missed during a given iteration, use of the preferred fix technique ensures local flux tally errors remain trivial (below 1%). The preferred fix is now the default option in SCONE and OpenMC.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2017

The Random Ray Method for neutral particle transport

A new approach to solving partial differential equations (PDEs) based on the method of characteristics (MOC) is presented. The Random Ray Method (TRRM) uses a stochastic rather than deterministic discretization of characteristic tracks to integrate the phase space of a problem. TRRM is potentially applicable in a number of transport simulation fields where long characteristic methods are used, such as neutron transport and gamma ray transport in reactor physics as well as radiative transfer in astrophysics. In this study, TRRM is developed and then tested on a series of exemplar reactor physics benchmark problems. The results show extreme improvements in memory efficiency compared to deterministic MOC methods, while also reducing algorithmic complexity, allowing for a sparser computational grid to be used while maintaining accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

The Random Ray Method Versus Multigroup Monte Carlo: The Method of Characteristics in OpenMC and SCONE

The Random Ray Method (TRRM) is a recently developed approach to solving neutral particle transport problems based on the Method of Characteristics. While the method previously has been implemented only in closed-source or limited-functionality codes, this work describes its implementation in two open-source Monte Carlo codes: OpenMC and SCONE. The random ray implementations required small modifications to the existing Multigroup Monte Carlo (MGMC) solvers, offering a rare venue for redundant, fine-grained, "apples-to-apples" speed and accuracy comparisons between transport methods. To this end, TRRM and MGMC solvers are evaluated against each other using each code's native capabilities on reactor eigenvalue problems with different degrees of energy discretization. On the C5G7 benchmark (featuring only seven energy groups), TRRM achieves a maximum pin power error comparable to or lower than that of MGMC for a given run time. On a problem with 69 energy groups, MGMC is found to scale more efficiently, obtaining a lower pin power error for a given run time. However, the defining difference between the two transport methods is found to be their vastly different uncertainty distributions. Specifically, TRRM is found to maintain similar levels of accuracy and uncertainty throughout the simulation domain whereas MGMC can exhibit orders-of-magnitude greater errors in areas of the problem that feature low neutron flux. For instance, TRRM provided an up to 373 times speed advantage compared with MGMC for computing the flux in low-flux regions in the moderator surrounding the C5G7 core.

42 ENGINEERING↗
DOE OSTI2021

Climatology of Linear Mesoscale Convective System Morphology in the United States based on Random Forests Method

This study uses machine learning methods, specifically the random forest (RF), on a radar-based mesoscale convective system (MCS) tracking dataset to classify the five types of linear MCS morphology in the contiguous United States during the period 2004-2016. The algorithm is trained using radar- and satellite-derived spatial and morphological parameters, and reanalysis environmental information from 5-26yr manually identified nonlinear and five linear MCS modes. The algorithm is then used to automate the classification of linear MCSs over 8 years with high accuracy, providing a systematic, long-term climatology of linear MCSs. Results reveal that nearly 40% of MCSs are classified as linear MCSs, in which half of the linear events belong to the type of system having a leading convective line. The occurrence of linear MCSs shows large annual and seasonal variations. On average, 113 linear MCSs occur annually during the warm season (through March to October), with most of these events clustered from May through August in the central eastern Great Plains. MCS characteristics, including duration, propagation speed, orientation, and system cloud size, have large variability among the different linear modes. The systems having a trailing convective line and the systems having a back-building area of convection typically move more slowly and have higher precipitation rate, and thus have higher potential in producing extreme rainfall and flash flooding. Analysis of the environmental conditions associated with linear MCSs show that the storm-relative flow is of most importance in determining the organization mode of linear MCSs.

Cui, Wenjun↗
DOE OSTI2022

A mathematical assessment of the isolation random forest method for anomaly detection in big data

We present the mathematical analysis of the Isolation Random Forest Method (IRF Method) for anomaly detection, proposed by Liu F.T., Ting K.M. and Zhou Z. H. in their seminal work as a heuristic method for anomaly detection in Big Data. We prove that the IRF space can be endowed with a probability induced by the Isolation Tree algorithm (iTree). In this setting, the convergence of the IRF method is proved, using the Law of Large Numbers. Here, a couple of counterexamples are presented to show that the method is inconclusive and no certificate of quality can be given, when using it as a means to detect anomalies. Hence, an alternative version of the method is proposed whose mathematical foundation is fully justified. Furthermore, a criterion for choosing the number of sampled trees needed to guarantee confidence intervals of the numerical results is presented. Finally, numerical experiments are presented to compare the performance of the classic method with the proposed one.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

An efficient random-sampling method for calculating double occupancy of Gutzwiller wave function in single-band 1D and 2D lattices

In this paper, we report a random sampling method for computing the expectation value of physical quantities based on the Gutzwiler variational wave function. As the first application, we calculated the double occupancy, which is a critical quantity for under- standing the correlation effects in many-body systems, for single-band 1D and 2D lattices. We demonstrated that the random sampling scheme is more efficient than an existing Metropolis Monte-Carlo algorithm. For the 1D Hubbard model with only nearest-neighbor hopping, our results are almost identical to the exact analytic solution. We have also studied systems to which analytic solutions are not available, including the 1D lattices with next-nearest-neighbor hopping and 2D lattices. In addition, constraints on real-space con gurations can be easily implemented in the current scheme to further improve the Gutzwiller wave function. As an example, we calculated the double occupancy for 1D Hubbard model by applying the constraint that all double-occupied sites are paired with an empty site. With enhanced correlation between double-occupied and empty sites, the constraint results in much improved ground-state energy for 1D Hubbard model with strong on-site repulsion.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2021

A random-sampling method as an efficient alternative to variational Monte Carlo for solving Gutzwiller wavefunctions

Abstract We present a random-sampling (RS) method for evaluating expectation values of physical quantities using the variational approach. We demonstrate that the RS method is computationally more efficient than the variational Monte Carlo method using the Gutzwiller wavefunctions applied on single-band Hubbard models as an example. Non-local constraints can also been easily implemented in the current scheme that capture the essential physics in the limit of strong on-site repulsion. In addition, we extend the RS method to study the antiferromagnetic states with multiple variational parameters for 1D and 2D Hubbard models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Automated ICRF heating surrogate modeling via machine learning

This work introduces automated machine learning workflows that address critical bottlenecks in surrogate model development for Ion Cyclotron Range of Frequencies (ICRF) heating applications. The automated framework includes data analysis tools that transform raw datasets into actionable insights in seconds, replacing weeks of manual exploratory effort and ensuring consistent, reproducible dataset characterization. By integrating advanced hyperparameter optimization (HPO) methods including Bayesian optimization via BoTorch and Tree-structured Parzen Estimators (TPE), the framework significantly reduces model development time from weeks to hours, decreasing computational cost and required expertise, while enabling high-accuracy surrogate models. Compared to traditional hyperparameter scanning (HPS) techniques such as methodical, randomized, and grid searches, HPO methods achieve superior convergence and predictive performance, even when compared to already well-tuned reference models. On NSTX High Harmonic Fast Wave (HHFW) heating datasets, both Random Forest Regressor (RFR) and neural network surrogates demonstrate improved accuracy, achieving R 2 values beyond 0.97 and 0.98, respectively. The results show that while HPO gains are modest for robust architectures like RFR, they become essential for more sensitive models such as neural networks, highlighting the trade-offs across optimization strategies. Through automated workflows that eliminate manual hyperparameter tuning and require minimal ML expertise, this work enables widespread adoption of high-fidelity surrogate models across the fusion community for real-time plasma control, uncertainty quantification, rapid experimental scenario development, and integrated system optimization.

Sanchez-Villar, Alvaro [Princeton Plasma Physics L↗
DOE OSTI2017

An improved random walk algorithm for the implicit Monte Carlo method

In this work, we introduce a modified Implicit Monte Carlo (IMC) Random Walk (RW) algorithm, which increases simulation efficiency for multigroup radiative transfer problems with strongly frequency-dependent opacities. To date, the RW method has only been implemented in “fully-gray” form; that is, the multigroup IMC opacities are group-collapsed over the full frequency domain of the problem to obtain a gray diffusion problem for RW. This formulation works well for problems with large spatial cells and/or opacities that are weakly dependent on frequency; however, the efficiency of the RW method degrades when the spatial cells are thin or the opacities are a strong function of frequency. To address this inefficiency, we introduce a RW frequency group cutoff in each spatial cell, which divides the frequency domain into optically thick and optically thin components. In the modified algorithm, opacities for the RW diffusion problem are obtained by group-collapsing IMC opacities below the frequency group cutoff. Particles with frequencies above the cutoff are transported via standard IMC, while particles below the cutoff are eligible for RW. This greatly increases the total number of RW steps taken per IMC time-step, which in turn improves the efficiency of the simulation. We refer to this new method as Partially-Gray Random Walk (PGRW). We present numerical results for several multigroup radiative transfer problems, which show that the PGRW method is significantly more efficient than standard RW for several problems of interest. In general, PGRW decreases runtimes by a factor of ∼2–4 compared to standard RW, and a factor of ∼3–6 compared to standard IMC. While PGRW is slower than frequency-dependent Discrete Diffusion Monte Carlo (DDMC), it is also easier to adapt to unstructured meshes and can be used in spatial cells where DDMC is not applicable. This suggests that it may be optimal to employ both DDMC and PGRW in a single simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Comparison of linear regression, k-nearest neighbour and random forest methods in airborne laser-scanning-based prediction of growing stock

Abstract In this study, for five sites around the world, we look at the effects of different model types and variable selection approaches on forest yield modelling performances in an area-based approach (ABA). We compared ordinary least squares regression (OLS), k-nearest neighbours (kNN) and random forest (RF). Our objective was to test if there are systematic differences in accuracy between OLS, kNN and RF in ABA predictions of growing stock volume. The analyses are based on a 5-fold cross-validation at five study sites: an eucalyptus plantation, a temperate forest and three different boreal forests. Two completely independent validation datasets were also available for two of the boreal sites. For the kNN, we evaluated multiple measures of distance including Euclidean, Mahalanobis, most similar neighbour (MSN) and an RF-based distance metric. The variable selection approaches we examined included a heuristic approach (for OLS, kNN and RF), exhaustive search among all combinations (OLS only) and all variables together (RF only). Performances varied by model type and variable selection approaches among sites. OLS and RF had similar accuracies and were more efficient than any of the kNN variants. Variable selection did not affect RF performance. Heuristic and exhaustive variable selection performed similarly for OLS. kNN fared the poorest amongst model types, and kNN with RF distance was prone to overfitting when compared with a validation dataset. Additional caution is therefore required when building kNN models for volume prediction though ABA, being preferable instead to opt for models based on OLS with some variable selection, or RF with all variables together.

Cosenza, Diogo N.↗
DOE OSTI2011

Cadmium-catalyzed surface growth of single-walled carbon nanotubes with high efficiency

Graphical abstract: The Cd nanocatalysts, prepared using a diblock copolymer templating method, were uniformly spaced over a large deposition area with an average diameter of 1.9 nm and narrow size distribution. By using the normal-heating method, high density SWNTs can be generated. Research highlights: {yields} We demonstrate that cadmium (Cd) can catalyze the growth of SWNTs with high efficiency. {yields} The PVP capped-Cd nanocatalysts were uniformly spaced over a large deposition area with an average diameter of 1.9 nm. {yields} By using the normal-heating and fast-heating method, random and horizontally aligned arrays of SWNTs can be generated. {yields} The high percentage of SWNTs with Ag deposition from Cd indicates that the SWNTs have better conductivity and structural uniformity. -- Abstract: We demonstrate that cadmium (Cd) can catalyze the growth of single-walled carbon nanotubes (SWNTs) with high efficiency. The Cd nanocatalysts, prepared using a diblock copolymer templating method, were uniformly spaced over a large deposition area with an average diameter of 1.9 nm and narrow size distribution. By using the normal-heating and fast-heating method, random and horizontally aligned arrays of SWNTs can be generated. The density of the SWNTs can be altered by the chemical vapor deposition conditions. The morphology and microstructure of the SWNTs characterized by scanning electron microscopy, Raman spectroscopy, atomic force microscopy, and high-resolution transmission electron microscopy revealed that the grown nanotubes do not have carbonaceous particles and have good crystallinity. In addition, after careful check with superlong nanotubes 735 out of 790 nanotubes were found to be deposited with Ag (93%) and only 7% SWNTs without Ag deposition. While for superlong SWNT arrays from Fe, 32% long SWNTs without Ag deposition was found, the high percentage of SWNTs with Ag deposition from Cd indicates that the SWNTs have better conductivity and better structural uniformity with less defects.

36 MATERIALS SCIENCE↗