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

High-speed tunable generation of random number distributions using actuated perpendicular magnetic tunnel junctions

Perpendicular magnetic tunnel junctions (pMTJs) actuated by nanosecond pulses are emerging as promising devices for true random number generation (TRNG) due to their intrinsic stochastic behavior and high throughput. In this work, we demonstrate the tunability and quality of random number distributions generated by pMTJs operating at a frequency of 104 MHz. First, changing the pulse amplitude is used to systematically vary the probability bias. The variance of the resulting bitstreams closely matches the expected binomial distribution, demonstrating consistency with an underlying sequence of Bernoulli trials. Second, the quality of uniform distributions of 8-bit random numbers generated with a probability bias of 0.5 is considered. A reduced chi-square analysis of these data shows that only two XOR operations are sufficient to achieve this distribution with p-values greater than 0.05. Finally, we show that there is a correlation between long-term probability bias variations and pMTJ resistance. These findings suggest that variations in the characteristics of the pMTJ underlie the observed variation of probability bias. In conclusion, our results highlight the potential of stochastically actuated pMTJs for high-speed, tunable TRNG applications, showing the importance of the stability of pMTJ device characteristics in achieving reliable, long-term performance.

Magnetic tunnel junctions↗
DOE OSTI2025

Exact spectral gaps of random one-dimensional quantum circuits

The spectral gap of local random quantum circuits is a fundamental property that determines how close the moments of the circuit's unitaries match those of a Haar random distribution. When studying spectral gaps, it is common to bound these quantities using tools from statistical mechanics or via quantum information-based inequalities. Here, by focusing on the second moment of one-dimensional unitary circuits where nearest-neighboring gates act on sets of qudits (with open and closed boundary conditions), we show that one can exactly compute the associated spectral gaps. Indeed, having access to their functional form allows us to prove several important results, such as the fact that the spectral gap for closed boundary condition is exactly the square of the gap for open boundaries, as well as improve on previously known bounds for approximate design convergence. Finally, we verify our theoretical results by numerically computing the spectral gap for systems of up to 70 qubits, as well as comparing them to gaps of random orthogonal and symplectic circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Random magnetic field and the Dirac Fermi surface

In this paper, we study a single two-dimensional Dirac fermion at finite density, subject to a quenched random magnetic field. At low energies and sufficiently weak disorder, the theory maps onto an infinite collection of 1D chiral fermions (associated to each point on the Fermi surface) coupled by a random vector potential. This low-energy theory exhibits an exactly solvable random fixed line, along which we directly compute various disorder-averaged observables without the need for the usual replica, supersymmetry, or Keldysh techniques. We find the longitudinal dc conductivity in the collisionless $\hbar$ω/k B T→∞ limit to be nonuniversal and to vary continuously along the fixed line.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Comparison of the spatial statistics of random and defined-sequence photoresist films

The resolution-line edge roughness-sensitivity tradeoff has motivated the exploration of potential improvements using defined sequence polymers and polymer-bound photoacid generators and quenchers. We characterize the internal structures of positive tone photoresist polymer films formed from defined sequence polymers and compare them with random copolymers of the same composition. We model their imaging to connect initially to developable film structures. We use a polymer packing algorithm to simulate films of diverse compositions and locations of photoacid generators and quenchers, using the composition of an ESCAP photoresist. We use a simple extreme ultraviolet exposure-deprotection algorithm to model developable image formation within them. In all cases, the spatial distribution of chemical moieties in the film for defined sequence polymers is nearly indistinguishable from random copolymers. We evaluate several exposure-deprotection scenarios and find that a defined sequence copolymer has a distinctive developable image under certain circumstances. The use of defined sequence polymers within a photoresist layer does not automatically result in improved imaging; however, they do have some characteristics different from random polymers of the same composition. Further study of these characteristics may provide a route to improved control over the nanoscale imaging process.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations

Rank-revealing matrix decompositions provide an essential tool in spectral analysis of matrices, including the Singular Value Decomposition (SVD) and related low-rank approximation techniques. QR with Column Pivoting (QRCP) is usually suitable for these purposes, but it can be much slower than the unpivoted QR algorithm. For large matrices, the difference in performance is due to increased communication between the processor and slow memory, which QRCP needs in order to choose pivots during decomposition. Our main algorithm, Randomized QR with Column Pivoting (RQRCP), uses randomized projection to make pivot decisions from a much smaller sample matrix, which we can construct to reside in a faster level of memory than the original matrix. This technique may be understood as trading vastly reduced communication for a controlled increase in uncertainty during the decision process. Furthermore, for rank-revealing purposes, the selection mechanism in RQRCP produces results that are the same quality as the standard algorithm, but with performance near that of unpivoted QR (often an order of magnitude faster for large matrices). Additionally, we also propose two formulas that facilitate further performance improvements. The first efficiently updates sample matrices to avoid computing new randomized projections. The second avoids large trailing updates during the decomposition in truncated low-rank approximations. Our truncated version of RQRCP also provides a key initial step in our truncated SVD approximation, TUXV. These advances open up a new performance domain for large matrix factorizations that will support efficient problem-solving techniques for challenging applications in science, engineering, and data analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Techniques in Assessing Random Uncertainty of Wind Tunnel Replicate Test Data

The preferred method to determine the random uncertainty of variables of interest during wind tunnel tests is by direct analysis of replicate data. However, current information is limited to analysis of a single replicate set condition that does not consider data covariance. This paper provides additional information on considerations for quantifying random uncertainty including the evaluation and correction of replicate data covariance, the selection of replicate set conditions for the test, and the interpolation of random uncertainty at other than replicate set conditions. The analysis and techniques are supported by data from a conventional aircraft configuration test at the Oran Nicks Low-Speed Wind Tunnel and an ASME nozzle flow characterization at the Propulsion Systems Laboratory.

Uncertainty↗
DOE OSTI2021

Estimating carrying capacity for juvenile salmon using quantile random forest models

Abstract Establishing robust methods and metrics to evaluate habitat quality is critical for the recovery of endangered Pacific salmonids ( Oncorhynchus spp.). A variety of modeling approaches are used for status and trend monitoring of anadromous species throughout the Pacific Northwest, USA, but current methods may fail to capture the complex relationship between fish and habitat and are often limited in predictive power beyond specific watersheds. Further, the focus on species distribution and abundance is not easily manipulated to predict carrying capacity and traditional stock‐recruitment analyses are reliant on long‐term data which are not always available. In this study, we developed a quantile random forest model to provide estimates of habitat carrying capacity for Chinook salmon ( O. tshawytscha ) parr during the summer months, at both the site and watershed scale. Quantile random forest models allow for the consideration of noisy data, correlated variables, and non‐linear relationships: common features in fish–habitat datasets. We leveraged Columbia Habitat Monitoring Program data to select habitat co‐variates and predict capacity at those sites. We also identified a set of globally available attributes to extrapolate capacity estimate predictions throughout wadeable streams within the Columbia River basin. Total capacity estimates for watersheds closely matched estimates from alternative fish productivity models. Carrying capacity estimates based on quantile random forest models, like those presented here, provide managers a framework to guide the identification, prioritization, and development of habitat rehabilitation actions to recover salmon populations.

See, Kevin E.↗
DOE OSTI2021

A non‐intrusive domain‐decomposition model reduction method for linear steady‐state partial differential equations with random coefficients

Abstract Domain decomposition methods have been proved to be an effective strategy to reduce the dimension of parametric partial differential equations (PDEs). However, existing domain decomposition methods for parametric PDEs are usually intrusive, which means domain decomposition based solvers need to be implemented from scratch for each target parametric PDE. To address this issue, we develop a new non‐intrusive domain‐decomposition model reduction method for linear steady‐state PDEs with random‐field coefficients. As a variant of our previous work by Mu and Zhang, the new method only needs access to the final linear system, that is, the global stiffness matrix and the right hand side, of a deterministic PDE solver, in order to build a domain‐decomposition‐based reduced model without intrusive implementation from scratch. The key idea is to remove the interface condition between sub‐domains and rely on the correlation between columns of the linear system to couple the sub‐domains. The non‐intrusive feature enables the applicability of the proposed method to a broader class of uncertainty quantification problems, where many legacy codes/solvers can be fully reused by our method. Two numerical examples including diffusion equations with random diffusivity and convection‐dominated transport with random velocity, are provided to demonstrate the effectiveness and efficiency of our method.

Zhang, Guannan↗
DOE OSTI2024

Approximate CFTs and random tensor models

Abstract A key issue in both the field of quantum chaos and quantum gravity is an effective description of chaotic conformal field theories (CFTs), that is CFTs that have a quantum ergodic limit. We develop a framework incorporating the constraints of conformal symmetry and locality, allowing the definition of ensembles of ‘CFT data’. These ensembles take on the same role as the ensembles of random Hamiltonians in more conventional quantum ergodic phases of many-body quantum systems. To describe individual members of the ensembles, we introduce the notion of approximate CFT, defined as a collection of ‘CFT data’ satisfying the usual CFT constraints approximately, i.e. up to small deviations. We show that they generically exist by providing concrete examples. Ensembles of approximate CFTs are very natural in holography, as every member of the ensemble is indistinguishable from a true CFT for low-energy probes that only have access to information from semi-classical gravity. To specify these ensembles, we impose successively higher moments of the CFT constraints. Lastly, we propose a theory of pure gravity in AdS 3 as a random matrix/tensor model implementing approximate CFT constraints. This tensor model is the maximum ignorance ensemble compatible with conformal symmetry, crossing invariance, and a primary gap to the black-hole threshold. The resulting theory is a random matrix/tensor model governed by the Virasoro 6j-symbol.

Physics↗
DOE OSTI2026

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers

We present Q-SASS, a quasi-Newton method for unconstrained stochastic optimization that does not rely on common random numbers. Most existing quasi-Newton approaches leverage common random numbers to construct second-order updates. However, motivated by challenges in variational quantum algorithms—where such coordination is not possible—we consider the setting in which function values and gradients are accessible only through noisy probabilistic zeroth- and first-order oracles, and no common random numbers can be exploited. We derive high-probability tail bounds on the iteration complexity of our algorithm for nonconvex, convex, and strongly convex (more generally, those satisfying the PL condition) objective functions. Finally, we demonstrate the empirical benefits of our quasi-Newton updating scheme on both synthetic and quantum chemistry problems.

Complexity bound↗
DOE OSTI2021

Dynamics of disordered mechanical systems with large connectivity, free probability theory, and quasi-Hermitian random matrices

Disordered mechanical systems with high connectivity represent a limit opposite to the more familiar case of disordered crystals. Individual ions in a crystal are subjected essentially to nearest-neighbor interactions. In contrast, the systems studied in this paper have all their degrees of freedom coupled to each other. Thus, the problem of linearized small oscillations of such systems involves two full positive-definite and non-commuting matrices, as opposed to the sparse matrices associated with disordered crystals. Consequently, the familiar methods for determining the averaged vibrational spectra of disordered crystals, introduced many years ago by Dyson and Schmidt, are inapplicable for highly connected disordered systems. In this paper we apply random matrix theory (RMT) to calculate the averaged vibrational spectra of such systems, in the limit of infinitely large system size. At the heart of our analysis lies a calculation of the average spectrum of the product of two positive definite random matrices by means of free probability theory techniques. We also show that this problem is intimately related with quasi-hermitian random matrix theory (QHRMT), which means that the ‘hamiltonian’ matrix is hermitian with respect to a non-trivial metric. This extends ordinary hermitian matrices, for which the metric is simply the unit matrix. The analytical results we obtain for the spectrum agree well with our numerical results. The latter also exhibit oscillations at the high-frequency band edge, which fit well the Airy kernel pattern. We also compute inverse participation ratios of the corresponding amplitude eigenvectors and demonstrate that they are all extended, in contrast with conventional disordered crystals. Finally, we compute the thermodynamic properties of the system from its spectrum of vibrations. In addition to matrix model analysis, we also study the vibrational spectra of various multi-segmented disordered pendula, as concrete realizations of highly connected mechanical systems. A universal feature of the density of vibration modes, common to both pendula and the matrix model, is that it tends to a non-zero constant at vanishing frequency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Using porous random fields to predict the elastic modulus of unoxidized and oxidized superfine graphite

Nuclear graphite is a candidate material for Generation IV nuclear power plants. Porous materials such as graphite can contain complex networks of pores that influence the material's mechanical and irradiation response. A methodology known as the random finite element method (RFEM) was adapted to create synthetic microstructures and predict the influence of porosity on the elastic properties of graphite during oxidation. RFEM combines random field theory and the finite element method in a Monte Carlo framework to estimate the mechanical response of a given grade of graphite. In this research, the random fields were verified through experimental characterization to predict the elastic response of three nuclear graphite grades, ETU-10, IG-110, and 2114. Finite element models (FEM) were generated using segmentations of x-ray computed tomography (XCT) data known as image-based models (IBMs) to validate and compare with the RFEM results and better understand the effects of uniform oxidation in these graphite grades. The RFEM predictions appear to correlate well with the experimental values of the measured Young’s modulus of the three graphite grades and display the same trends as IBMs.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2023

The hidden structure of hydrodynamic transport in random fracture networks

We study the large-scale dynamics and prediction of hydrodynamic transport in random fracture networks. The flow and transport behaviour is characterized by first passage times and displacement statistics, which show heavy tails and anomalous dispersion with a strong dependence on the injection condition. The origin of these behaviours is investigated in terms of Lagrangian velocities sampled equidistantly along particle trajectories, unlike classical sampling strategies at a constant rate. The velocity series are analysed by their copula density, the joint distribution of the velocity unit scores, which reveals a simple, albeit hidden, correlation structure that can be described by a Gaussian copula. Based on this insight, we derive a Langevin equation for the evolution of equidistant particle speeds. In this framework, particle motion is quantified by a stochastic time-domain random walk, the joint density of particle position, and speed satisfies a Klein–Kramers equation. The upscaled theory quantifies particle motion in terms of the characteristic fracture length scale and the distribution of Eulerian flow velocities. That is, it is predictive in the sense that it does not require the a priori knowledge of transport attributes. The upscaled model captures non-Fickian transport features, and their dependence on the injection conditions in terms of the velocity point statistics and average fracture length. It shows that the first passage times and displacement moments are dominated by extremes occurring at the first step. The presented approach integrates the interaction of flow and structure into a predictive model for large-scale transport in random fracture networks.

42 ENGINEERING↗
DOE OSTI2021

Dimensional Interpolation for Random Walk

In this work, we employ a simple and accurate dimensional interpolation formula for the shapes of random walks at D = 3 and D = 2 based on the analytically known solutions at both limits D = ∞ and D = 1. The results obtained for the radius of gyration of an arbitrary shaped object have about 2% error compared with accurate numerical results at D = 3 and D = 2. We also calculated the asphericity for a three-dimensional random walk using the dimensional interpolation formula. The results agree very well with the numerically simulated results. The method is general and can be used to estimate other properties of random walks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Formation of Disordered Cocontinuous Phases by Randomly Linked Star Copolymers

Cocontinuous polymeric nanostructures have garnered significant interest due to their ability to combine different properties of two separate polymer domains. Randomly linked copolymer networks have proven to be especially robust for formation of disordered cocontinuous phases across wide composition ranges (≈30 wt % or more). While theoretical treatments of microphase-separated networks have focused primarily on the role of random elastic forces imposed on the self-assembled nanostructures by virtue of the network architecture, experimental studies seeking to disentangle these contributions from other potential effects, such as dispersity in preferred interfacial curvatures, have been scarce. To provide insight into this matter, we here study the self-assembly of randomly linked star copolymers (RSCs), constructed by linking premade polymer arms of polystyrene (PS) and poly(d,l-lactide) (PLA) using 3, 4, and 6-functional connectors. This architecture yields similar distributions of preferred curvature as networks made using corresponding difunctional strands, but lacks the elastic forces imposed by a network architecture. Gravimetry and small-angle X-ray scattering, coupled with scanning electron microscopy, were performed to identify the percolation of PS/PLA RSCs. Remarkably, the 4-arm RSC system exhibited a disordered cocontinuous window of ≈25 wt %, indicating that dispersity in preferred curvature can in some cases be sufficient to robustly drive formation of this morphology. However, the other RSC architectures showed smaller cocontinuous ranges, which we interpret in terms of the influence of homopolymer stars in the 3-arm case and the narrower distribution of preferred interfacial curvatures in the 6-arm case. Finally, thin layers of interconnected porous PS were achieved by solution-processing, suggesting that RSCs have the potential to serve as a robust and easily processable cocontinuous polymeric nanomaterials in both bulk and membrane geometries.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Stochastic Inversion of Gaussian Random Media Using Transverse Coherence Functions for Reflected Waves: Theory and Method

The transverse coherence functions (TCFs) of phase and amplitude fluctuations of a seismic wave are powerful to estimate the spatial distribution, length scales, and strength of random heterogeneities. However, TCFs have been formulated for transmitted waves only, not for reflected waves. In this paper, we derive reflection TCFs for Gaussian random media. Furthermore, we propose to invert for Gaussian random media using the reflection TCFs based on the grid search. We validate the new reflection TCF formulas using 2D finite-difference numerical experiments. The numerical example also illustrates the feasibility and efficiency of the inversion. The stochastic inversion using reflected waves can be used in both exploration and global seismology.

58 GEOSCIENCES↗
DOE OSTI2024

True random number generation using the spin crossover in LaCoO 3

While digital computers rely on software-generated pseudo-random number generators, hardware-based true random number generators (TRNGs), which employ the natural physics of the underlying hardware, provide true stochasticity, and power and area efficiency. Research into TRNGs has extensively relied on the unpredictability in phase transitions, but such phase transitions are difficult to control given their often abrupt and narrow parameter ranges (e.g., occurring in a small temperature window). Here we demonstrate a TRNG based on self-oscillations in LaCoO 3 that is electrically biased within its spin crossover regime. The LaCoO 3 TRNG passes all standard tests of true stochasticity and uses only half the number of components compared to prior TRNGs. Assisted by phase field modeling, we show how spin crossovers are fundamentally better in producing true stochasticity compared to traditional phase transitions. As a validation, by probabilistically solving the NP-hard max-cut problem in a memristor crossbar array using our TRNG as a source of the required stochasticity, we demonstrate solution quality exceeding that using software-generated randomness.

97 MATHEMATICS AND COMPUTING↗