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 1,477 records · Page 82

Anomalous polarization effects during light scattering in random media

The dependence of the intensity of light backscattered from a layer of a randomly inhomogeneous medium on the polarization of incident light and the size of scatterers has been investigated. The results of numerical simulation have demonstrated that the direction of rotation of the plane of polarization is different in systems with small- and large-scale inhomogeneities. It is shown for the first time that the dependence of the sign of the residual circular polarization on the size of scatterers can be observed in systems described by the Henyey-Greenstein phase function used in simulating biological tissues. A similar anomalous polarization effect, which consists in changing the direction of rotation of the plane of polarization of backscattered light with an increase in the scattering angle, is revealed in studying the coherent backscattering component. These polarization effects are observed in light backscattering from optically active media.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Magnetic field correlations in random flow with strong steady shear

We analyze the magnetic kinematic dynamo in a conducting fluid where a stationary shear flow is accompanied by relatively weak random velocity fluctuations. The diffusionless and diffusion regimes are described. The growth rates of the magnetic field moments are related to the statistical characteristics of the flow describing divergence of the Lagrangian trajectories. The magnetic field correlation functions are examined, and their growth rates and scaling behavior are established. General assertions are illustrated by the explicit solution of a model where the velocity field is short-correlated in time.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Passive scalar transport in peripheral regions of random flows

We investigate statistical properties of the passive scalar mixing in random (turbulent) flows assuming its diffusion to be weak. Then at advanced stages of the passive scalar decay, its unmixed residue is primarily concentrated in a narrow diffusive layer near the wall and its transport to the bulk goes through the peripheral region (laminar sublayer of the flow). We conducted Lagrangian numerical simulations of the process for different space dimensions d and revealed structures responsible for the transport, which are passive scalar tongues pulled from the diffusive boundary layer to the bulk. We investigated statistical properties of the passive scalar and of the passive scalar integrated along the wall. Moments of both objects demonstrate scaling behavior outside the diffusive boundary layer. We propose an analytic scheme for the passive scalar statistics, explaining the features observed numerically.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Alignment of RNA molecules: Binding energy and statistical properties of random sequences

A new statistical approach to the problem of pairwise alignment of RNA sequences is proposed. The problem is analyzed for a pair of interacting polymers forming an RNA-like hierarchical cloverleaf structures. An alignment is characterized by the numbers of matches, mismatches, and gaps. A weight function is assigned to each alignment; this function is interpreted as a free energy taking into account both direct monomer-monomer interactions and a combinatorial contribution due to formation of various cloverleaf secondary structures. The binding free energy is determined for a pair of RNA molecules. Statistical properties are discussed, including fluctuations of the binding energy between a pair of RNA molecules and loop length distribution in a complex. Based on an analysis of the free energy per nucleotide pair complexes of random RNAs as a function of the number of nucleotide types c, a hypothesis is put forward about the exclusivity of the alphabet c = 4 used by nature.

60 APPLIED LIFE SCIENCES↗

Finite-temperature perturbation theory for the random directed polymer problem

We study the random directed polymer problem-the short-scale behavior of an elastic string (or polymer) in one transverse dimension subject to a disorder potential and finite temperature fluctuations. We are interested in the polymer short-scale wandering expressed through the displacement correlator Left-Pointing-Angle-Bracket [{delta}u(X)]{sup 2} Right-Pointing-Angle-Bracket , with {delta}u(X) being the difference in the displacements at two points separated by a distance X. While this object can be calculated at short scales using the perturbation theory in higher dimensions d > 2, this approach becomes ill-defined and the problem turns out to be nonperturbative in the lower dimensions and for an infinite-length polymer. In order to make progress, we redefine the task and analyze the wandering of a string of a finite length L. At zero temperature, we find that the displacement fluctuations Left-Pointing-Angle-Bracket [{delta}u(X)]{sup 2} Right-Pointing-Angle-Bracket {proportional_to} LX{sup 2} depend on L and scale with the square of the segment length X, which differs from a straightforward Larkin-type scaling. The result is best understood in terms of a typical squared angle Left-Pointing-Angle-Bracket {alpha}{sup 2} Right-Pointing-Angle-Bracket {proportional_to} L, where {alpha} = {partial_derivative}{sub x}u, from which the displacement scaling for the segment X follows naturally, Left-Pointing-Angle-Bracket [{delta}u(X)]{sup 2} Right-Pointing-Angle-Bracket {proportional_to} Left-Pointing-Angle-Bracket {alpha}{sup 2} Right-Pointing-Angle-Bracket X{sup 2}. At high temperatures, thermal fluctuations smear the disorder potential and the lowest-order results for disorder-induced fluctuations in both the displacement field and the angle vanish in the thermodynamic limit L {yields} {infinity}. The calculation up to the second order allows us to identify the regime of validity of the perturbative approach and provides a finite expression for the displacement correlator, albeit depending on the boundary conditions and the location relative to the boundaries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Theory of a random fiber laser

We develop the theory explaining the role of nonlinearity in generation of radiation in a fiber laser that is pumped by external light. The pumping energy is converted into the generating signal due to the Raman scattering supplying an effective gain for the signal. The signal is generated with frequencies near the one corresponding to the maximum value of the gain. Generation conditions and spectral properties of the generated signal are examined. We focus mainly on the case of a random laser where reflection of the signal occurs on impurities of the fiber. From the theoretical standpoint, kinetics of a wave system close to an integrable one are investigated. We demonstrate that in this case, the perturbation expansion in the kinetic equation has to use the closeness to the integrable case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Statistical properties of random environment of 1D quantum N-particles system in external field

The investigation of 1D quantum N-particle system (PS) with relaxation in the random environment under the influence of external field is conducted within the framework of the stochastic differential equation of the Langevin-Schroedinger (L-Sch) type. Using L-Sch equation, the 2D second-order nonstationary partial differential equation is found, which describes the quantum distribution in the environment, depending on the energy of nonperturbed 1D quantum N-PS and on the external field parameters. It is shown that the average value of the interaction potential between 1D disordered quantum N-PS and the external field, has the ultraviolet divergence. This problem is solved by the renormalization of the equation for the function of quantum distribution. It is shown that it has a sense of dimensional renormalization which is characteristic for the quantum field theory. Critical properties of the environment are investigated in detail. The possibility of the first-order phase transition in the environment distribution depending on amplitude of an external field is been shown.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Random matrix analysis of the monopole strength distribution in {sup 208}Pb

We study statistical properties of the 0{sup +} spectrum of {sup 208}Pb in the energy region E{sub x} ≤ 20 MeV. We use the Skyrme interaction SLy4 as our model Hamiltonian to create a single-particle spectrum and to analyze excited states. The finite-rank separable approximation for the particle–hole interaction enables us to perform the calculations in large configuration spaces. We show that while the position of the monopole resonance centroid is determined by one-phonon excitations of 0{sup +}, the phonon–phonon coupling is crucial for the description of the strength distribution of the 0{sup +} spectrum. In fact, this coupling has an impact on the spectral rigidity Δ{sub 3}(L) which is shifted towards the random matrix limit of the Gaussian orthogonal ensembles.

74 ATOMIC AND MOLECULAR PHYSICS↗

Randomized Sketching Algorithms for Low-Memory Dynamic Optimization

This paper develops a novel limited-memory method to solve dynamic optimization problems. The memory requirements for such problems often present a major obstacle, particularly for problems with PDE constraints such as optimal flow control, full waveform inversion, and optical tomography. In these problems, PDE constraints uniquely determine the state of a physical system for a given control; the goal is to find the value of the control that minimizes an objective. While the control is often low dimensional, the state is typically more expensive to store. This paper suggests using randomized matrix approximation to compress the state as it is generated and shows how to use the compressed state to reliably solve the original dynamic optimization problem. Concretely, the compressed state is used to compute approximate gradients and to apply the Hessian to vectors. The approximation error in these quantities is controlled by the target rank of the sketch. This approximate first- and second-order information can readily be used in any optimization algorithm. As an example, we develop a sketched trust-region method that adaptively chooses the target rank using a posteriori error information and provably converges to a stationary point of the original problem. Numerical experiments with the sketched trust-region method show promising performance on challenging problems such as the optimal control of an advection-reaction-diffusion equation and the optimal control of fluid flow past a cylinder.

97 MATHEMATICS AND COMPUTING↗

Butterfly Factorization Via Randomized Matrix-Vector Multiplications

This paper presents an adaptive randomized algorithm for computing the butterfly factorization of an m × n matrix with m ≈ n provided that both the matrix and its transpose can be rapidly applied to arbitrary vectors. The resulting factorization is composed of O(log n) sparse factors, each containing O(n) nonzero entries. The factorization can be attained using O(n 3/2 log n) computation and O(n log n) memory resources. Furthermore, the proposed algorithm can be implemented in parallel and can apply to matrices with strong or weak admissibility conditions arising from surface integral equation solvers as well as multi-frontal-based finite-difference, finite-element, or finite-volume solvers. A distributed-memory parallel implementation of the algorithm demonstrates excellent scaling behavior.

97 MATHEMATICS AND COMPUTING↗

Data-Driven Closures and Assimilation for Stiff Multiscale Random Dynamics

Here, we introduce a data-driven and physics-informed framework for propagating uncertainty in stiff, multiscale random ordinary differential equations (RODEs) driven by correlated (colored) noise. Unlike systems subjected to Gaussian white noise, a deterministic equation for the joint probability density function (PDF) of RODE state variables does not exist in closed form. Moreover, such an equation would require as many phase-space variables as there are states in the RODE system. To alleviate this curse of dimensionality, we instead derive exact, albeit unclosed, reduced-order PDF (RoPDF) equations for low-dimensional observables/quantities of interest. The unclosed terms take the form of state-dependent conditional expectations, which are directly estimated from data at sparse observation times. However, for systems exhibiting stiff, multiscale dynamics, data sparsity introduces regression discrepancies that compound during RoPDF evolution. This is overcome by introducing a kinetic-like defect term to the RoPDF equation, which is learned by assimilating in sparse, low-fidelity RoPDF estimates. Two assimilation methods are considered, namely nudging and deep neural networks, which are successfully tested against Monte Carlo simulations.

97 MATHEMATICS AND COMPUTING↗

Deep Learning without Global Optimization by Random Fourier Neural Networks

Here we introduce a new training algorithm for deep neural networks that utilize random complex exponential activation functions. Our approach employs a Markov chain Monte Carlo sampling procedure to iteratively train network layers, avoiding global and gradient-based optimization while maintaining error control. It consistently attains the theoretical approximation rate for residual networks with complex exponential activation functions, determined by network complexity. Additionally, it enables efficient learning of multiscale and high-frequency features, producing interpretable parameter distributions. Despite using sinusoidal basis functions, we do not observe Gibbs phenomena in approximating discontinuous target functions.

97 MATHEMATICS AND COMPUTING↗

Hierarchical Gaussian Random Field Sampling for Multilevel Markov Chain Monte Carlo: Coupling Stochastic Partial Differential Equation and the Karhunen–Loève Decomposition

This work introduces structure preserving hierarchical decompositions for sampling Gaussian random fields (GRFs) within the context of multilevel Bayesian inference in high-dimensional space. Existing scalable hierarchical sampling methods, such as those based on stochastic partial differential equations (SPDEs), often reduce the dimensionality of the sample space at the cost of accuracy of inference. Other approaches, such that those based on Karhunen-Loève (KL) expansions, offer sample space dimensionality reduction but sacrifice GRF representation accuracy and ergodicity of the Markov chain Monte Carlo (MCMC) sampler and are computationally expensive for high-dimensional problems. The proposed method integrates the dimensionality reduction capabilities of KL expansions with the scalability of SPDE-based sampling, thereby providing a robust, unified framework for high-dimensional uncertainty quantification (UQ) that is scalable and accurate, preserves ergodicity, and offers dimensionality reduction of the sample space. The hierarchy in our multilevel algorithm is derived from the geometric multigrid hierarchy. By constructing a hierarchical decomposition that maintains the covariance structure across the levels in the hierarchy, the approach enables efficient coarse-to-fine sampling while ensuring that all samples are drawn from the desired distribution. The effectiveness of the proposed method is demonstrated on a benchmark subsurface flow problem, demonstrating its effectiveness in improving computational efficiency and statistical accuracy. Furthermore, our proposed technique is more efficient and accurate and displays better convergence properties than existing methods for high-dimensional Bayesian inference problems.

Gaussian random fields↗

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, relies on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Accelerating Random Forest Classification on GPU and FPGA

Random Forests (RFs) are a commonly used machine learning method for classification and regression tasks spanning a variety of application domains, including bioinformatics, business analytics, and software optimization. While prior work has focused primarily on improving performance of the training of RFs, many applications, such as malware identification, cancer prediction, and banking fraud detection, require fast RF classification. In this work, we accelerate RF classification on GPU and FPGA. In order to provide efficient support for large datasets, we propose a hierarchical memory layout suitable to the GPU/FPGA memory hierarchy. We design three RF classification code variants based on that layout, and we investigate GPU- and FPGA-specific considerations for these kernels. Our experimental evaluation, performed on an Nvidia Xp GPU and on a Xilinx Alveo U250 FPGA accelerator card using publicly available datasets on the scale of millions of samples and tens of features, covers various aspects. First, we evaluate the performance benefits of our hierarchical data structure over the standard compressed sparse row (CSR) format. Second, we compare our GPU implementation with cuML, a machine learning library targeting Nvidia GPUs. Third, we explore the performance/accuracy tradeoff resulting from the use of different tree depths in the RF. Finally, we perform a comparative performance analysis of our GPU and FPGA implementations. Our evaluation shows that for high accuracy targets, our GPU implementation yields 5-9x speedup over CSR, and up to a 2x speedup over cuML.

FPGA, Xilinx FPGA, GPU, Random Forest classificati↗

Solovay-Kitaev Algorithm and Randomized Compilation Data Availability

This zipped folder contains simulation notebooks, simulated data, and experimental data from the QSCOUT trapped-ion device that were used in the publication "Solovay-Kitaev Algorithm and Randomized Compilation" (https://doi.org/10.1103/ll6m-dbl7). The raw data is in the form of measurement outcomes of simple tomographic quantum circuits that were executed on the QSCOUT device and simulated using JAQALPAQ. These data are used to create plots within the jupyter notebooks that were included in the publication.

Quantum benchmarking↗