Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems

Algorithms from Randomized Numerical Linear Algebra (RandNLA) are known to be effective in handling high-dimensional computational problems, providing high-quality empirical performance as well as strong probabilistic guarantees. However, their practical application is complicated by the fact that the user needs to set various algorithm-specific tuning parameters which are different from those used in traditional NLA. This paper demonstrates how a surrogate-based autotuning approach can be used to address fundamental problems of parameter selection in RandNLA algorithms. In particular, we provide a detailed investigation of surrogate-based autotuning for sketch-and-precondition (SAP)-based randomized least squares methods, which have been one of the great success stories in modern RandNLA. Empirical results show that our surrogate-based autotuning approach can achieve near-optimal performance with much less tuning cost than a random search (up to about 7.6x fewer trials of different parameter configurations). Moreover, while our experiments focus on least squares, our results demonstrate a general-purpose autotuning pipeline applicable to any kind of RandNLA algorithm.

Cho, Younghyun↗
DOE OSTI2025

Efficient Training of Deep Neural Operator Networks via Randomized Sampling

Neural operators (NOs) employ deep neural networks to learn the mappings between infinitedimensional function spaces. Deep operator network (DeepONet), a popular NO architecture, has demonstrated success in the real-time prediction of complex dynamics across various scientific and engineering applications. In this work, we introduce a random sampling technique to be adopted during the training of DeepONet, aimed at improving the generalization ability of the model, while significantly reducing the computational time. The proposed approach targets the trunk network of the DeepONet model that outputs the basis functions corresponding to the spatiotemporal locations of the bounded domain on which the physical system is defined. While constructing the loss function, DeepONet training traditionally considers a uniform grid of spatiotemporal points at which all the output functions are evaluated for each iteration. This approach leads to a larger batch size, resulting in poor generalization and increased memory demands, due to the limitations of the stochastic gradient descent (SGD) optimizer. The proposed random sampling over the inputs of the trunk net mitigates these challenges, improving generalization and reducing the memory requirements during training, resulting in significant computational gains. We validate our hypothesis through three benchmark examples, demonstrating substantial reductions in training time while achieving comparable or lower overall test errors relative to the traditional training approach. Our results indicate that incorporating randomization in the trunk network inputs during training enhances the efficiency and robustness of DeepONet, offering a promising avenue for improving the framework’s performance in modeling complex physical systems.

Karumuri, Sharmila [Department of Civil & Systems ↗
DOE OSTI2025

COBRA:COMPUTED-TOMOGRAPHY BASED RANDOM-FIELD APPROXIMATION

SF-25-115 COBRA (COmputed-tomography Based Random-field Approximation) is a Python application for generating statistically equivalent random fields from CT-scan imagery. It leverages Karhunen–Loève expansions to model microstructural variability, enabling users to: Preprocess CT scans (filtering and Gaussian transformation); Fit covariance kernels fromempirical data; Solve eigenproblems to obtain KL modes; Sample random fields onsistent with fitted statistics; Postprocess samples back into the physical domain.

Hu, Tianchen↗
DOE OSTI2024

Traceable Device-Independent Randomness as a Service

We implement a traceable protocol for device-independent random number generation. Our demonstration involves transparently integrating a device-independent RNG into a public randomness beacon, and feeding 7434 random number pulses into the beacon over 39 days.

Kavuri, Gautam A.↗
DOE OSTI2024

Optical filters made from random metasurfaces using Bayesian optimization

Abstract We theoretically investigate the ability to design optical filters from a single material and a single layer of randomly dispersed resonant dielectric particles, defining a random metasurface. Using a Bayesian and generalized Mie inverse-design approach, we design particle radii distributions that give rise to longpass, shortpass, bandpass, and bandstop spectral bands in the infrared. The optical response is shown to be directly related to electric and magnetic multipole scattering of the constituent particles and their near field coupling. We discuss the effect of the particle size distribution and particle–particle coupling interactions on filter design in random systems lacking long-range order.

Materials Science↗
DOE OSTI2020

Random Variation of ACRR Core Report

The research presented in this paper is to be a contribution to a larger research project. The project was designed to test the safety standards of Sandia National Laboratories' ACRR. The MCNP model of the ACRR core is being used to simulate the environment. To test the safety standards, the dimensions and density of the fuel in the core were varied randomly. Each rod had its own dimension and density assigned to it randomly. Ten different cases of the ACRR core were randomly created. The different cases were studied using 640-group neutron fluxes. The fluxes were compared to see how the variations affected the system.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Bringing randomized algorithms to mainstream numerical linear algebra

Numerical linear algebra (NLA) underpins huge swaths of computational science and engineering. For scientists and engineers to make the most of the DOE’s computing resources, it is essential that they have access to high-performance implementations of algorithms with best-in-class scalability and reliability. Despite this, prevailing NLA libraries have little to no support for breakthrough algorithms from the field of randomized numerical linear algebra (RandNLA) that have been developed over the past twenty years. The goal of this LDRD was to break a log-jam that had prevented broad adoption of RandNLA. Our work had two thrusts. The first was to develop RandBLAS: a trustworthy and high-performance C++ library for randomized dimension reduction (an operation widely known as sketching). The second was the development of a novel randomized algorithm for computing a challenging type of matrix decomposition known as Householder QR with column pivoting (Householder QRCP). In this one-year late-start LDRD we successfully delivered RandBLAS 1.0 and new CPU and GPU codes for Householder QRCP. RandBLAS has extensive documentation at https://randblas.readthedocs.io/en/stable/. Papers on RandBLAS and and our high-performance QRCP codes are forthcoming.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Randomized Algorithms for Linear Solvers

Recently, randomized algorithms in numerical linear algebra, specifically those centered around random sketching, have gained traction in primarily theoretical research due to their potential to significantly reduce problem dimensionality at the cost of an O(1) multiplicative distortion factor. It has been assumed that this sketching can be done efficiently, but thorough investigation into how precisely to do it has been neglected. Moreover, the theory-based community has argued for sketching’s ability to reduce computational cost via complexity analysis, but has not researched how it affects the stability of the algorithms. At Sandia, efficient linear solvers that scale well on modern HPC architectures while maintaining stability are imperative for practical applications. In this LDRD, we developed a random sketching strategy that is substantially faster than existing ones, and demonstrate its superior performance in practice on a NVIDIA H100 GPU. Moreover, we show how this can be used to significantly outperform existing linear least squares solvers while improving the solver’s stability as well. Additionally, we demonstrate how this sketching strategy can be used to make a fast, stable QR factorization that can subsequently be used in s-step and block Krylov solvers. Finally, we incorporate a sketching-based block orthogonalization scheme into s-step GMRES, which is stable and faster than existing approaches on the Perlmutter supercomputer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Circulating levels of micronutrients and risk of osteomyelitis: a Mendelian randomization study

Background Few observational studies have investigated the effect of micronutrients on osteomyelitis, and these findings are limited by confounding and conflicting results. Therefore, we conducted Mendelian randomization (MR) analyses to evaluate the association between blood levels of eight micronutrients (copper, selenium, zinc, vitamin B12, vitamin C, and vitamin D, vitamin B6, vitamin E) and the risk of osteomyelitis. Methods We performed the two-sample and multivariable Mendelian randomization (MVMR) to investigate causation, where instrument variables for the predictor (micronutrients) were derived from the summary data of micronutrients from independent cohorts of European ancestry. The outcome instrumental variables were used from the summary data of European-ancestry individuals ( n = 486,484). The threshold of statistical significance was set at p < 0.00625. Results We found a significant causal association that elevated zinc heightens the risk of developing osteomyelitis in European ancestry individuals OR = 1.23 [95% confidence interval (CI) [1.07, 1.43]; p = 4.26E-03]. Similarly, vitamin B6 showed a similar significant causal effect on osteomyelitis as a risk factor OR = 2.78 (95% CI [1.34, 5.76]; p = 6.04E-03; in the secondary analysis). Post-hoc analysis suggested this result (vitamin B6). However, the multivariable Mendelian randomization (MVMR) provides evidence against the causal association between zinc and osteomyelitis OR = 0.98(95% CI [−0.11, 0.07]; p = 7.20E-1). After searching in PhenoScanner, no SNP with confounding factors was found in the analysis of vitamin B6. There was no evidence of a reverse causal impact of osteomyelitis on zinc and vitamin B6. Conclusion This study supported a strong causal association between vitamin B6 and osteomyelitis while reporting a dubious causal association between zinc and osteomyelitis.

Zhang, Xu↗
DOE OSTI2023

Emulating aerosol optics with randomly generated neural networks

Abstract. Atmospheric aerosols have a substantial impact on climate and remain one of the largest sources of uncertainty in climate prediction. Accurate representation of their direct radiative effects is a crucial component of modern climate models. However, direct computation of the radiative properties of aerosol populations is far too computationally expensive to perform in a climate model, so optical properties are typically approximated using a parameterization. This work develops artificial neural networks (ANNs) capable of replacing the current aerosol optics parameterization used in the Energy Exascale Earth System Model (E3SM). A large training dataset is generated by using Mie code to directly compute the optical properties of a range of atmospheric aerosol populations given a large variety of particle sizes, wavelengths, and refractive indices. Optimal neural architectures for shortwave and longwave bands are identified by evaluating ANNs with randomly generated wirings. Randomly generated deep ANNs are able to outperform conventional multilayer-perceptron-style architectures with comparable parameter counts. Finally, the ANN-based parameterization produces significantly more accurate bulk aerosol optical properties than the current parameterization when compared with direct Mie calculations using mean absolute error. The success of this approach makes possible the future inclusion of much more sophisticated representations of aerosol optics in climate models that cannot be captured by extension of the existing parameterization scheme and also demonstrates the potential of random-wiring-based neural architecture search in future applications in the Earth sciences.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1971

Parameter identification using a creeping-random-search algorithm

A creeping-random-search algorithm is applied to different types of problems in the field of parameter identification. The studies are intended to demonstrate that a random-search algorithm can be applied successfully to these various problems, which often cannot be handled by conventional deterministic methods, and, also, to introduce methods that speed convergence to an extremal of the problem under investigation. Six two-parameter identification problems with analytic solutions are solved, and two application problems are discussed in some detail. Results of the study show that a modified version of the basic creeping-random-search algorithm chosen does speed convergence in comparison with the unmodified version. The results also show that the algorithm can successfully solve problems that contain limits on state or control variables, inequality constraints (both independent and dependent, and linear and nonlinear), or stochastic models.

Parrish, R. V.↗
NASA NTRS1972

Random walk study of electron motion in helium in crossed electromagnetic fields

Random walk theory, previously adapted to electron motion in the presence of an electric field, is extended to include a transverse magnetic field. In principle, the random walk approach avoids mathematical complexity and concomitant simplifying assumptions and permits determination of energy distributions and transport coefficients within the accuracy of available collisional cross section data. Application is made to a weakly ionized helium gas. Time of relaxation of electron energy distribution, determined by the random walk, is described by simple expressions based on energy exchange between the electron and an effective electric field. The restrictive effect of the magnetic field on electron motion, which increases the required number of collisions per walk to reach a terminal steady state condition, as well as the effect of the magnetic field on electron transport coefficients and mean energy can be quite adequately described by expressions involving only the Hall parameter.

Englert, G. W.↗
NASA NTRS1972

Simulation of random envelope processes.

Efficient and practical methods of simulating stationary and nonstationary random envelope processes are presented. The stationary envelope processes are simulated by using the fast Fourier transform while the nonstationary envelope processes are simulated as the square root of the sum of a series of cosine functions and a series of sine functions with random phase angles. Typical applications of the envelope simulation are the simulations of peaks and troughs which play an important role in the analyses of the first excursion probability, fatigue and crack propagation. In particular, applications to the crack propagation under random loadings are demonstrated in detail.

Yang, J.-N.↗
NASA NTRS1972

On the first-excursion probability in stationary narrow-band random vibration. II.

The first-excursion probability of a stationary narrow-band Gaussian process with mean zero has been studied. Within the framework of point process approach, series approximations derived from the theory of random points and approximations based on the maximum entropy principle have been developed. With the aid of numerical examples, merits of the approximations proposed previously as well as of those developed in this paper have been compared. The results indicate that the maximum entropy principle has not produced satisfactory approximations but the approximation based on nonapproaching random points is found to be the best among all the approximations proposed herein. A conclusion drawn from the present and the previous studies is that the point process approach produces a number of useful approximations for the first-excursion probability, particularly those based on the concepts of the Markov process, the clump-size, and the nonapproaching random points.

Yang, J.-N.↗
NASA NTRS1973

Effects of vibration and shock on the performance of gas-bearing space-power Brayton cycle turbomachinery. 2: Sinusoidal and random vibration

The vibration response of a gas-bearing rotor-support system was analyzed experimentally documented for sinusoidal and random vibration environments. The NASA Brayton Rotating Unit (BRU), 36,000 rpm; 10 KWe turbogenerator; was subjected in the laboratory to sinusoidal and random vibrations to evaluate the capability of the BRU to (1) survive the vibration levels expected to be encountered during periods of nonoperation and (2) operate satisfactorily (that is, without detrimental bearing surface contacts) at the vibration levels expected during normal BRU operation. Response power spectral density was calculated for specified input random excitation, with particular emphasis upon the dynamic motions of the thrust bearing runner and stator. A three-mass model with nonlinear representation of the engine isolator mounts was used to calculate axial rotor-bearing shock response.

Tessarzik, J. M.↗
NASA NTRS1973

On Digital Simulation of Multicorrelated Random Processes and Its Applications

Two methods are described to simulate, on a digital computer, a set of correlated, stationary, and Gaussian time series with zero mean from the given matrix of power spectral densities and cross spectral densities. The first method is based upon trigonometric series with random amplitudes and deterministic phase angles. The random amplitudes are generated by using a standard random number generator subroutine. An example is given which corresponds to three components of wind velocities at two different spatial locations for a total of six correlated time series. In the second method, the whole process is carried out using the Fast Fourier Transform approach. This method gives more accurate results and works about twenty times faster for a set of six correlated time series.

Sinha, A. K.↗
NASA NTRS1972

Probability of stress-corrosion fracture under random loading.

A method is developed for predicting the probability of stress-corrosion fracture of structures under random loadings. The formulation is based on the cumulative damage hypothesis and the experimentally determined stress-corrosion characteristics. Under both stationary and nonstationary random loadings, the mean value and the variance of the cumulative damage are obtained. The probability of stress-corrosion fracture is then evaluated using the principle of maximum entropy. It is shown that, under stationary random loadings, the standard deviation of the cumulative damage increases in proportion to the square root of time, while the coefficient of variation (dispersion) decreases in inversed proportion to the square root of time. Numerical examples are worked out to illustrate the general results.

Yang, J.-N.↗
NASA NTRS1973

The random coding bound is tight for the average code.

The random coding bound of information theory provides a well-known upper bound to the probability of decoding error for the best code of a given rate and block length. The bound is constructed by upperbounding the average error probability over an ensemble of codes. The bound is known to give the correct exponential dependence of error probability on block length for transmission rates above the critical rate, but it gives an incorrect exponential dependence at rates below a second lower critical rate. Here we derive an asymptotic expression for the average error probability over the ensemble of codes used in the random coding bound. The result shows that the weakness of the random coding bound at rates below the second critical rate is due not to upperbounding the ensemble average, but rather to the fact that the best codes are much better than the average at low rates.

Gallager, R. G.↗