Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “randomization”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
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↗
DOE OSTI2022

Neuromorphic scaling advantages for energy-efficient random walk computations

Neuromorphic computing, which aims to replicate the computational structure and architecture of the brain in synthetic hardware, has typically focused on artificial intelligence applications. What is less explored is whether such brain-inspired hardware can provide value beyond cognitive tasks. Here we show that the high degree of parallelism and configurability of spiking neuromorphic architectures makes them well suited to implement random walks via discrete-time Markov chains. Overall, these random walks are useful in Monte Carlo methods, which represent a fundamental computational tool for solving a wide range of numerical computing tasks. Using IBM’s TrueNorth and Intel’s Loihi neuromorphic computing platforms, we show that our neuromorphic computing algorithm for generating random walk approximations of diffusion offers advantages in energy-efficient computation compared with conventional approaches. We also show that our neuromorphic computing algorithm can be extended to more sophisticated jump-diffusion processes that are useful in a range of applications, including financial economics, particle physics and machine learning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Specific features of fluorescence transfer in multiply scattering randomly inhomogeneous layers under intense laser pumping

Based on the analysis of experimental data on the effect of the pulsed laser pump intensity on the spectral properties and the size of the fluorescent response zone in randomly inhomogeneous fluorescent layers, we found that the amplification of spontaneous and stimulated emission significantly affects the statistical properties of the propagation lengths of the fluorescent field partial components in the layers. The experiments are performed with layers of SiO{sub 2} and TiO{sub 2} nanoparticles saturated with rhodamine 6G, pumped by 532-nm laser radiation in the intensity range corresponding to the transient regime from excitation of spontaneous fluorescence to random lasing in the layer. The experimental data are compared with the results of statistical modelling of fluorescence transfer. It is shown that, even at a pump intensity below the random lasing threshold, the spontaneous emission amplification in a layer leads to a significant increase in the contributions to the fluorescence response from partial components with propagation lengths much larger than the layer thickness. This can be interpreted as a manifestation of the quasi-waveguide effect, in which the probability of propagation of diffuse fluorescence components along the layer over distances many times greater than its thickness and the size of the pumped region increases significantly with a decrease in the characteristic radiation amplification length in the layer. (paper)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Architectures and random properties of symplectic quantum circuits

Parametrized and random unitary (or orthogonal) n-qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention. However, this is not the case, as $\mathbb{SP}(d/2)$—the group of d × d unitary symplectic matrices—has thus far been overlooked. In this work, we aim at starting to fill this gap. We begin by presenting a universal set of generators $\mathcal{G}$ for the symplectic algebra $\mathfrak{sp}(d/2)$, consisting of one- and two-qubit Pauli operators acting on neighboring sites in a one-dimensional lattice. Here, we uncover two critical differences between such set, and equivalent ones for unitary and orthogonal circuits. Namely, we find that the operators in $\mathcal{G}$ cannot generate arbitrary local symplectic unitaries and that they are not translationally invariant. We then review the Schur–Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements at the output of Haar random symplectic circuits can converge to Gaussian processes. As a by-product, such analysis provides us with concentration bounds for Pauli measurements in circuits that form t-designs over $\mathbb{SP}(d/2)$. To finish, we present tensor-network tools to analyze shallow random symplectic circuits, and we use these to numerically show that computational-basis measurements anti-concentrate at logarithmic depth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Enhancing quantum clocks and sensors with randomization and decoherence

This letter shows how incoherent dynamics can lead to metrological advantages in quantum sensing. The results rely on the fact that incoherent dynamics lead to an additive contribution to the quantum Fisher information about time. Such an additive contribution can reduce the error of optimal estimation protocols, as implied by the quantum Cramér–Rao bound. I characterize regimes in which the estimation of a time interval or a frequency is enhanced by decoherence, thereby identifying cases in which incoherent dynamics serve as a metrological resource. The decoherence processes that yield enhanced precision of quantum sensors can be engineered by randomized Hamiltonian dynamics. I illustrate the results with protocols that display improved sensing of time intervals or global fields by qubit and photonic sensors. Enhanced precision of time intervals is achieved with Hamiltonians that include randomized global parameters. Enhanced precision in field estimation is obtained by randomized sensing times.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark

The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. We propose an input model called the Random Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Efficiency and Forward Voltage of Blue and Green Lateral LEDs with V-shaped Defects and Random Alloy Fluctuation in Quantum Wells

For nitride-based blue and green light-emitting diodes (LEDs), the forward voltage V for is larger than expected, especially for green LEDs. This is mainly due to the large barriers to vertical carrier transport caused by the total polarization discontinuity at multiple quantum well and quantum barrier interfaces. The natural random alloy fluctuation in quantum wells has proven to be an important factor reducing V for . However, this does not suffice in the case of green LEDs because of their larger polarization-induced barrier. V-shaped defects (V-defects) have been proposed as another key factor in reducing V for to allow lateral injection into multiple quantum wells, thus bypassing the multiple energy barriers incurred by vertical transport. In this paper, to model carrier transport in the whole LED, we consider both random-alloy and V-defect effects. A fully two-dimensional drift-diffusion charge-control solver is used to model both effects. The results indicate that the turn-on voltages for blue and green LEDs are both affected by random alloy fluctuations and the V-defect density. For green LEDs, V for decreases more due to V-defects, where the smaller polarization barrier at the V-defect sidewall is the major path for lateral carrier injection. Then, we discuss how the V-defect density and size affects the results.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Beyond universal behavior in the one-dimensional chain with random nearest-neighbor hopping

Here, we study the one-dimensional nearest-neighbor tight-binding model of electrons with independently distributed random hopping and no on-site potential (i.e., off-diagonal disorder with particle-hole symmetry, leading to sublattice symmetry, for each realization). For nonsingular distributions of the hopping, it is known that the model exhibits a universal, singular behavior of the density of states $ρ(E) ~ 1/|E\: \text{ln}^3 |E||$ and of the localization length $ξ(E) ~ |\text{ln}|E||$, near the band center $\textit{E}$ = 0 . (This singular behavior is also applicable to random $\textit{XY}$ and Heisenberg spin chains; it was first obtained by Dyson for a specific random harmonic oscillator chain.) Simultaneously, the state at$\textit{E}$ = 0 shows a universal, subexponential decay at large distances $\sim \text{exp}[–\sqrt{r/r_0}]$. In this study, we consider singular, but normalizable, distributions of hopping, whose behavior at small $\textit{t}$ is of the form $\sim 1/[t \text{ln}^{λ+1}(1/t)]$, characterized by a single, continuously tunable parameter λ > 0. We find, using a combination of analytic and numerical methods, that while the universal result applies for λ > 2, it no longer holds in the interval 0 < λ < 2. In particular, we find that the form of the density of states singularity is enhanced (relative to the Dyson result) in a continuous manner depending on the nonuniversal parameter λ; simultaneously, the localization length shows a less divergent form at low energies and ceases to diverge below λ = 1. For λ < 2, the fall-off of the $\textit{E}$ = 0 state at large distances also deviates from the universal result and is of the form $\sim\text{exp}[–(r/r_0)^{1/λ}]$ , which decays faster than an exponential for λ < 1.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Mean-field entanglement transitions in random tree tensor networks

Entanglement phase transitions in quantum chaotic systems subject to projective measurements and in random tensor networks have emerged as a new class of critical points separating phases with different entanglement scaling. We propose a mean-field theory of such transitions by studying the entanglement properties of random tree tensor networks. As a function of bond dimension, we find a phase transition separating area-law from logarithmic scaling of the entanglement entropy. Using a mapping onto a replica statistical mechanics model defined on a Cayley tree and the cavity method, we analyze the scaling properties of such transitions. Our approach provides a tractable, mean-field-like example of an entanglement transition. Furthermore, we verify our predictions numerically by computing directly the entanglement of random tree tensor network states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗