SEARCH · Engineering Papers

Results for “random walk”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

DOE OSTI2023

COWALKER:EFFECTIVE TRANSPORT PROPERTIES OF COMPOSITE MATERIALS

SF-23-026 This software computes effective transport properties of composite materials involving fibers and nanoparticles using a random-walk algorithm that efficiently scales to an arbitrary number of processes and cores. Effective transport properties (thermal, electrical) are key to bridge the microstructure of complex materials with its macroscopic behavior. Traditional approaches either use effective medium approximations (closed mathematical expressions that are approximation for certain conditions) or continuum simulation models such as finite element or finite volume, which require the generation of a mesh for each configuration explored. cowalker leverages the equivalence between laplacian or heat equation-based models and random walks to compute the asymptotic transport properties from an ensemble of first sojourn times of a random walker moving through the composite material. This allows us to directly define a composite material as a collection of particles and use algorithms developed for molecular dynamics to quickly compute the intersection of the walker with the different interfaces in the material. cowalker is developed in C++, and it relies on the GNU Scientific Library for random generation. cowalker is currently delivered as source code, so the GSL library is not included in cowalker's distribution. A more userfriendly version, cowalker.jl is currently in development and will be released as part of cowalker.

YANGUAS-GIL, ANGEL↗

NASA NTRS1995

Putting quasilinear theory to the test: A comparison of analytical theory with results from a trajectory code

Parallel and perpendicular diffusion coefficients were computed numerically by following particle orbits in a simulated magnetic field. The simulated field was chosen to have delta B/B(sub o) small, so as to provide a test of quasilinear theory in a regime where the theory should be most accurate. The simulation space is large enough to contain many magnetic field correlation lengths, so that effects of field line random walk can be studied. After presenting results for parallel diffusion, we will focus on two controversial issues relating to perpendicular diffusion: (1) Do quasilinear descriptions of perpendicular diffusion retain any validity for particles whose Larmor radius is smaller than a correlation length? (2) Does field line random walk lead to particle diffusion in the usual sense, or does it produce 'compound' diffusion for which particles spread out proportionally to t(exp 1/4) instead of t(exp 1/2)?

Bieber, J. W.↗

NASA NTRS2000

Comparison of On-Orbit Performance of Rate Sensing Gyroscopes

This work presents results from the study of a large volume of spacecraft flight data pertaining to gyroscope performance. We have examined long and short term trends of gyroscope biase of first, an exact solution for the time-dependence of the attitude part of the state error covariance, averaged over the three spacecraft axes, is given. This solution is more complete than the usual cubic polynomial for the variance in that it includes coupling among the three gyroscope axes and includes an important term arising from the initial correlations. Second, several continuous 24-hour spans of gyroscope data are examined to verify the short-term statistical model. This analysis demonstrates that in-flight data can be used to determine the strength of the white noise driving the random walk of the gyroscope bias. This may be useful for postlaunch improvement to the noise model and for diagnosing the health of the gyroscope. Third, the long-term trends in gyroscope biases show a nearly linear systematic variation over time scales of years. This has been found on three different missions. While the random walk model is adequate as a basis for onboard Kalman filters or for state estimation using relatively short time spans, these trends indicate that some applications could benefit by accounting for the secular changes in the biases. One example is a new gyroscope calibration method that is under development that allows for multi-epoch bias solutions.

Sedlak, Joseph↗

DOE OSTI2023

Efficient Subset Simulation using Hamiltonian Neural Network enhanced Markov Chain Monte Carlo Methods

The Monte Carlo method delivers an unbiased estimate of the probability of failure. However, the variance of the estimate depends on the number of evaluated samples. This number must be very large for estimations of a low probability of failure. If the evaluation of each sample is computationally expensive, the crude Monte Carlo simulation strategy is impracticable. Therefore, subset simulations are used to reduce the required number of evaluations. Subset simulations require a Markov Chain Monte Carlo sampler, such as the random walk Metropolis-Hastings algorithm. The algorithm, however, struggles with sampling in low-probability regions, especially if they are narrow. As a consequence, advanced Markov Chain Monte Carlo simulations have been developed. In particular, the Hamiltonian Monte Carlo method explores the target distribution rapidly. Driven by the idea of Hamiltonian dynamics, this sampler provides a non-random walk through the target distribution. The incorporation of subset simulation and Hamiltonian Monte Carlo methods has shown promising results for reliability analysis. One downside of the Hamiltonian Monte Carlo method is that gradient evaluations are computationally expensive, especially when dealing with high-dimensional problems and evaluating long trajectories. We show that integrating Hamiltonian neural networks in Hamiltonian Monte Carlo simulations significantly speeds up the sampling task. Furthermore, the enhancement of adaptive trajectory length within the Hamiltonian Monte Carlo results in the efficient proposal of the following states. Based on this recent enhancement, we provide a fast sampling strategy for subset simulations using Hamiltonian neural networks to replace the evaluation of the gradient and significantly speed up the Hamiltonian Monte Carlo simulation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Accelerating multicanonical sampling with irreversibility

Flat-histogram Monte Carlo simulations are well-established, robust methods to perform random walks in a physical observable or parameter space, making them suitable for finding ground states or studying phase transitions in complex systems in statistical physics. However, their efficiency can be limited by the time to attain the desired flat distribution, which is generally unknown prior to the simulations. In particular, they might suffer from slowing down towards the end of a simulation due to the diffusive nature of random walks. In this work we apply irreversibility to the multicanonical Monte Carlo method via the lifting approach to alleviate this behavior. We achieve a 2–4 times speedup in ground-state search for a two-dimensional (2D) Ising model, and up to an order of magnitude of speedup for finding the ground-state energy in an Edwards–Anderson spin glass, compared to traditional multicanonical sampling. In conclusion, the round-trip times between ground states show a narrower distribution and are significantly shorter compared to the reversible counterpart, suggesting that a lower convergence time with a smaller time variance is feasible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1990

Stochastic estimation of tropospheric path delays in global positioning system geodetic measurements

Water vapor radiometric and surface meteorological measurements taken during three GPS geodetic experiments are used to calculate process noise levels for random walk and first-order Gauss-Markov temporal models of tropospheric path delays. Entire wet and combined wet and dry zenith delays at each network site are estimated simultaneously with the geodetic parameters without prior calibration. The path delays and corresponding baseline estimates are compared to those obtained with calibrated data and stochastic residual delays. In this manner, the marginal utility of a priori tropospheric calibration is assessed given the ability to estimate the path delays directly using only the GPS data. Estimation of total zenith path delays with appropriate random walk or Gauss-Markov models yields baseline repeatabilities of a few parts in 100 million. Results suggest that GPS data alone have sufficient strength to resolve centimeter-level zenith path delay fluctuations over periods of a few minutes.

Tralli, David M.↗

DOE OSTI2024

The variability structure function of the highest luminosity quasars on short time-scales

ABSTRACT The stochastic photometric variability of quasars is known to follow a random-walk phenomenology on emission time-scales of months to years. Some high-cadence rest-frame optical monitoring in the past has hinted at a suppression of variability amplitudes on shorter time-scales of a few days or weeks, opening the question of what drives the suppression and how it might scale with quasar properties. Here, we study a few thousand of the highest luminosity quasars in the sky, mostly in the luminosity range of $L_{\rm bol}$$=[46.4, 47.3]$ and redshift range of $z=[0.7, 2.4]$. We use a data set from the NASA/Asteroid Terrestrial-impact Last Alert System facility with nightly cadence, weather permitting, which has been used before to quantify strong regularity in longer term rest-frame-UV variability. As we focus on a careful treatment of short time-scales across the sample, we find that a linear function is sufficient to describe the UV variability structure function. Although the result can not rule out the existence of breaks in some groups completely, a simpler model is usually favoured under this circumstance. In conclusion, the data are consistent with a single-slope random walk across rest-frame time-scales of $\Delta t=[10, 250]$ d.

Tang, Ji-Jia (ORCID:0000000218600886)↗

DOE OSTI2022

Devices and methods for increasing the speed and efficiency at which a computer is capable of modeling a plurality of random walkers using a density method

A method for increasing a speed or energy efficiency at which a computer is capable of modeling a plurality of random walkers. The method includes defining a virtual space in which a plurality of virtual random walkers will move among different locations in the virtual space, wherein the virtual space comprises a plurality of vertices and wherein the different locations are ones of the plurality of vertices. A corresponding set of neurons in a spiking neural network is assigned to a corresponding vertex such that there is a correspondence between sets of neurons and the plurality of vertices, wherein a spiking neural network comprising a plurality of sets of spiking neurons is established. A virtual random walk of the plurality of virtual random walkers is executed using the spiking neural network, wherein executing includes tracking how many virtual random walkers are at each vertex at a given time increment.

Aimone, James Bradley↗

NASA NTRS1969

Solar protons E greater than 100 Mev incident over Antarctica during January- February 1967.

Commencing at 0825 +a -1 UT on January 28, 1967, a large and prolonged increase in the intensity of penetrating charged particles was observed by balloon-borne instruments floating over Byrd Station, Antarctica. (80°S, 120°W). A peak intensity of approximately 50 protons per cm 2 -sec-steradian with E> 100 MeV occurred at about 1230 UT on the 28th. The event was under observation almost continuously over a period of about 100 hours until the intensity decayed below cosmic-ray background on February 1. The initial decay was rapid but, some 40 hours after onset, went over into a slow exponential decay characterized by a 20 hour time-constant. The decay phase of an additional, though considerably less intense, event was observed on February 3 and 4. Presumably both events had their origins in major disturbances on the far side of the sun since nether event has been definitely linked to any feature which existed on the visible disk within an appropriate time interval. Results pertaining to the time-intensity profile and to the energy spectrum for protons E> 100 MeV are presented for the January 29 event. Comparison of the balloon results with neutron-monitor and satellite measurements and with models of interplanetary diffusion has led to some conclusions regarding the role of small-angle scattering by irregularities and by the random walk of magnetic lines of force relative to the mean interplanetary field within the orbit of earth.

Energy spectrum↗

DOE OSTI2023

Binary operations on neuromorphic hardware with application to linear algebraic operations and stochastic equations

Abstract Non-von Neumann computational hardware, based on neuron-inspired, non-linear elements connected via linear, weighted synapses—so-called neuromorphic systems—is a viable computational substrate. Since neuromorphic systems have been shown to use less power than CPUs for many applications, they are of potential use in autonomous systems such as robots, drones, and satellites, for which power resources are at a premium. The power used by neuromorphic systems is approximately proportional to the number of spiking events produced by neurons on-chip. However, typical information encoding on these chips is in the form of firing rates that unarily encode information. That is, the number of spikes generated by a neuron is meant to be proportional to an encoded value used in a computation or algorithm. Unary encoding is less efficient (produces more spikes) than binary encoding. For this reason, here we present neuromorphic computational mechanisms for implementing binary two’s complement operations. We use the mechanisms to construct a neuromorphic, binary matrix multiplication algorithm that may be used as a primitive for linear differential equation integration, deep networks, and other standard calculations. We also construct a random walk circuit and apply it in Brownian motion simulations. We study how both algorithms scale in circuit size and iteration time.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Semicoherent symmetric quantum processes: Theory and applications

Discovering pragmatic and efficient approaches to construct ε-approximations of quantum operators such as real (imaginary) time-evolution propagators in terms of the basic quantum operations (gates) is challenging. Prior ε-approximations are invaluable, in that they enable the compilation of classical and quantum algorithm modeling of, e.g., dynamical and thermodynamic quantum properties. In parallel, symmetries are powerful tools concisely describing the fundamental laws of nature; the symmetric underpinnings of physical laws have consistently provided profound insights and substantially increased predictive power. In this work, we consider the interplay between the ε-approximate processes and the exact symmetries in a semicoherent context—where measurements occur at each logical clock cycle. Here we draw inspiration from Pascual Jordan's groundbreaking formulation of nonassociative, but commutative, symmetric algebraic form. Our symmetrized formalism is then applied in various domains such as quantum random walks, real-time evolutions, variational algorithm ansatzes, and efficient entanglement verification. Our work paves the way for a deeper understanding and greater appreciation of how symmetries can be used to control quantum dynamics in settings where coherence is a limited resource.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

Multiscale modeling of solute diffusion in triblock copolymer membranes

We develop a multiscale simulation model for diffusion of solutes through porous triblock copolymer membranes. The approach combines two techniques: self-consistent field theory (SCFT) to predict the structure of the self-assembled, solvated membrane and on-lattice kinetic Monte Carlo (kMC) simulations to model diffusion of solutes. Solvation is simulated in SCFT by constraining the glassy membrane matrix while relaxing the brush-like membrane pore coating against the solvent. The kMC simulations capture the resulting solute spatial distribution and concentration-dependent local diffusivity in the polymer-coated pores; we parameterize the latter using particle-based simulations. We apply our approach to simulate solute diffusion through nonequilibrium morphologies of a model triblock copolymer, and we correlate diffusivity with structural descriptors of the morphologies. We also compare the model’s predictions to alternative approaches based on simple lattice random walks and find our multiscale model to be more robust and systematic to parameterize. Furthermore, our multiscale modeling approach is general and can be readily extended in the future to other chemistries, morphologies, and models for the local solute diffusivity and interactions with the membrane.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Staircases of passive and active scalar concentration in cellular flow

This paper develops a unified model for staircase formation in both passive and active scalar systems, building upon prior numerical studies by offering new heuristic and physical insights. While prior studies primarily reported numerical results, they did not explore the underlying unifying physics that governs both types of scalar transport; this work addresses that gap by identifying shared mechanisms across both cases. Results of studies of passive and active scalar staircase formation in cellular flows are presented. Staircase formation in cellular flows occurs due to the interplay of fast mixing within cells and slow transport across the inter-cell boundary. The cell boundary emerges as a de facto transport barrier. Special attention is focused on the effects of cellular fluctuations and noise upon staircase structure. A forced, fluctuating vortex array model is used to drive the underlying flow structure. Cellular Peclet number and staircase profile curvature are identified as figures-of-merit to quantify the resiliency of layering. These are related to simple, multi-scatterer scalar random walk models. Results for Peclet number and curvature scaling with flow excitation are presented. We also study staircases of magnetic potential evolving in two-dimensional magnetohydrodynamics as examples of layering of active scalar concentration. Formation of magnetic potential staircases is indeed observed. Flux expulsion inhibits the intercellular transport of magnetic potential and strengthens staircase barriers. Magnetic staircases can be supported against resistive decay by magnetic potential noise forcing. Implications for staircase formation in magnetic confinement experiments are discussed.

Control theory↗

DOE OSTI2025

Geometric Delocalization in Two Dimensions

We demonstrate the existence of transient two-dimensional surfaces where a random-walking particle escapes to infinity in contrast to localization in standard flat two-dimensional space. We first prove that any rotationally symmetric two-dimensional membrane embedded in flat three-dimensional space cannot be transient. Then we formulate a criterion for the transience of a general asymmetric two-dimensional membrane. We use it to explicitly construct a class of transient two-dimensional manifolds with a nontrivial metric and height function but “zero average curvature,” which we dub “tablecloth manifolds.” The absence of the logarithmic infrared divergence of the Laplace-Beltrami operator in turn implies the absence of weak localization, nonexistence of bound states in shallow potentials, and breakdown of the Mermin-Wagner theorem and Kosterlitz-Thouless transition on the tablecloth manifolds, which may be realizable in both quantum simulators and corrugated two-dimensional materials.

Anderson localization↗

NASA NTRS1972

Model for radon diffusion through the lunar regolith.

Description of a model for radon diffusion through the lunar regolith in which the atom migrates by random walk. The regolith is represented by a system of randomly oriented baffles in which the mean distance which the atom travels between two collisions takes on the role of a mean free path. The effective mean time between two collisions depends on two entities: the actual mean time-of-flight and the mean sticking time on grain surfaces for one collision. The latter depends strongly on the temperature and the heat of adsorption of radon on regolith materials. Both the mean free path as well as the heat of adsorption are either poorly known or unknown for the lunar regolith; hence these quantities are treated as free parameters. Because of the greatly different mean lifetimes against radioactive decay of Rn219, Rn220, and Rn222, the regolith acts as a powerful 'filter' for these species. Rn222 escape is significant (32%) even for a mean free path of 1 micron, a heat of adsorption of 7.0 kcal/mole and a regolith depth of 4 m. Calculations of radon escape from a 4 m thick regolith, using mean free paths of 1, 10, and 80 microns and heats of adsorption of 4.0, 5.2, and 7.0 kcal/mole show that the Rn222/Rn220 escape ratio can be as small as 7.7 and as large as, or larger than 47. The small value of 7.7 is of particular interest, because it is nearly equal to the escape ratio inferred by Turkevich et al. (1970) from their Surveyor 5 results.

Friesen, L. J.↗

NASA NTRS1995

Field lines and magnetic surfaces in a two-component slab/2D model of interplanetary magnetic fluctuations

A two-component model for the spectrum of interplanetary magnetic fluctuations was proposed on the basis of ISEE observations, and has found an intriguing level of application in other solar wind studies. The model fluctuations consist of a fraction of 'slab' fluctuations, varying only in the direction parallel to the locally uniform mean magnetic field B(0) and a complement of 2D (two-dimensional) fluctuations that vary in the directions transverse to B(0). We have developed an spectral method computational algorithm for computing the magnetic flux surfaces (flux tubes) associated with the composite model, based upon a precise analogy with equations for ideal transport of a passive scalar in planar two dimensional geometry. Visualization of various composite models will be presented, including the 80 percent 2D/ 20 percent slab model with delta B/B(0) approximately equals 1 and a minus 5/3 spectral law, that is thought to approximately represent a snapshot of solar wind turbulence. Characteristically, the visualizations show that flux tubes, even when defined as regular on some plane, shred and disperse rapidly as they are viewed along the parallel direction. This diffusive process, which generalizes the standard picture of field line random walk, will be discussed in detail. Evidently, the traditional picture that flux tubes randomize like strands of spaghetti with a uniform tangle along the axial direction is in need of modification.

Matthaeus, W. H.↗

DOE OSTI2023

A simple coin for a 2d entangled walk

We analyze the effect of a simple coin operator, built out of Bell pairs, in a 2d Discrete Quantum Random Walk (DQRW) problem. The specific form of the coin enables us to find analytical and closed form solutions to the recursion relations of the DQRW. The coin induces entanglement between the spin and position degrees of freedom, which oscillates with time and reaches a constant value asymptotically. We probe the entangling properties of the coin operator further, by two different measures. First, by integrating over the space of initial tensor product states, we determine the Entangling Power of the coin operator. Secondly, we compute the Generalized Relative Rényi Entropy between the corresponding density matrices for the entangled state and the initial pure unentangled state. Both the Entangling Power and Generalized Relative Rényi Entropy behaves similar to the entanglement with time. Finally, in the continuum limit, the specific coin operator reduces the 2d DQRW into two 1d massive fermions coupled to synthetic gauge fields, where both the mass term and the gauge fields are built out of the coin parameters.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

NASA NTRS2012

Recursive Branching Simulated Annealing Algorithm

This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.

Bolcar, Matthew↗