Search NASA⌕ Search

SEARCH · Search NASA

Results for “Random dynamics”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS2017

A Comparison of Three Random Number Generators for Aircraft Dynamic Modeling Applications

Three random number generators, which produce Gaussian white noise sequences, were compared to assess their suitability in aircraft dynamic modeling applications. The first generator considered was the MATLAB (registered) implementation of the Mersenne-Twister algorithm. The second generator was a website called Random.org, which processes atmospheric noise measured using radios to create the random numbers. The third generator was based on synthesis of the Fourier series, where the random number sequences are constructed from prescribed amplitude and phase spectra. A total of 200 sequences, each having 601 random numbers, for each generator were collected and analyzed in terms of the mean, variance, normality, autocorrelation, and power spectral density. These sequences were then applied to two problems in aircraft dynamic modeling, namely estimating stability and control derivatives from simulated onboard sensor data, and simulating flight in atmospheric turbulence. In general, each random number generator had good performance and is well-suited for aircraft dynamic modeling applications. Specific strengths and weaknesses of each generator are discussed. For Monte Carlo simulation, the Fourier synthesis method is recommended because it most accurately and consistently approximated Gaussian white noise and can be implemented with reasonable computational effort.

Grauer, Jared A.↗
NASA NTRS1978

Analysis of dynamic system response to product random processes

The response of dynamic systems to the product of two independent Gaussian random processes is developed by use of the Fokker-Planck and associated moment equations. The development is applied to the amplitude modulated process which is used to model atmospheric turbulence in aeronautical applications. The exact solution for the system response is compared with the solution obtained by the quasi-steady approximation which omits the dynamic properties of the random amplitude modulation. The quasi-steady approximation is valid as a limiting case of the exact solution for the dynamic response of linear systems to amplitude modulated processes. In the nonlimiting case the quasi-steady approximation can be invalid for dynamic systems with low damping.

Sidwell, K.↗
DOE OSTI2024

Saturation and Recurrence of Quantum Complexity in Random Local Quantum Dynamics

Quantum complexity is a measure of the minimal number of elementary operations required to approximately prepare a given state or unitary channel. Recently, this concept has found applications beyond quantum computing—in studying the dynamics of quantum many-body systems and the long-time properties of anti–de Sitter black holes. In this context, Brown and Susskind [] conjectured that the complexity of a chaotic quantum system grows linearly in time up to times exponential in the system size, saturating at a maximal value, and remaining maximally complex until undergoing recurrences at doubly exponential times. In this work, we prove the saturation and recurrence of complexity in two models of chaotic time evolutions based on (i) random local quantum circuits and (ii) stochastic local Hamiltonian evolution. Our results advance an understanding of the long-time behavior of chaotic quantum systems and could shed light on the physics of black-hole interiors. From a technical perspective, our results are based on establishing new quantitative connections between the Haar measure and high-degree approximate designs, as well as the fact that random quantum circuits of sufficiently high depth converge to approximate designs. Published by the American Physical Society 2024

Oszmaniec, Michał (ORCID:0000000249466835)↗
NASA NTRS1974

Determination of critical nondimensional parameters in aircraft dynamic response to random input

The critical parameters of subsonic jet aircraft response in a random atmospheric environment are determined. Equations of motion are presented for semirigid aircraft with a flexible primary airfoil. However, the analysis is easily extendable to include additional appendage flexibility. The analysis establishes the mechanical admittance values for pitching, plunging, and the first mode effects from wing elastic bending and torsion. Nondimensional parameters are established which allow the representation of all subsonic jet transport aircraft with one nondimensional model. The critical parameters for random forcing are found to be aircraft relative mass, reduced natural and forcing frequencies, and Mach number. Turbulence scale lengths are found to be directly related to the critical values of reduced forcing frequency. Results are given for subsonic craft traveling at constant altitude. Specific values of admittance functions are tabulated at Mach numbers of 0.2, 0.5, and 0.7. The relative mass range covers all aircraft currently in operation.

Hillard, S. E.↗
NASA NTRS1976

Response of linear dynamic systems with random coefficients

Numerous models of physical systems contain parameters whose values are not known exactly. The physical and mathematical complexities arising in the prediction of the statistical behavior of such systems are discussed. Although the discussions are far from providing a satisfactory solution to such problems, they perhaps, by utilization of simple examples, will create a greater awareness of the statistical effect of random parameters.

Dickerson, J.↗
NASA NTRS1990

Random-Field Estimation For Dynamics Of Robots

Report discusses use of random-field mathematical models as alternatives to deterministic models of classical mechanics to describe dynamics of robot arms. These alternative models used to establish relationship between methods of estimation theory and robot dynamics. Approach yields new class of algorithms performing computations typical of estimation theory to solve such fundamental problems in robotics as forward and inverse dynamics and inverse kinematics.

Rodriguez, Guillermo↗
NASA NTRS1990

A probabilistic approach to the dynamic analysis of ducts subjected to multibase harmonic and random excitation

The dynamic behavior of the discharge duct of the high-pressure oxidizer turbopump of a cryogenic rocket motor is investigated analytically. The probabilistic analysis program NESSUS (Numerical Evaluation of Stochastic Structures Under Stress; Cruse et al., 1988) is used to treat the uncertainties due to random and harmonic excitation (e.g., pump noise, pump-induced harmonics, and combustion noise), variations in engine inlet pressure, and changes in system damping. The load modeling procedure, the variation in power-spectral density in different zones of the engine structure, and the dynamic structural-analysis technique are described, and the numerical results of the NESSUS analysis are presented in extensive tables and graphs and discussed in detail.

Debchaudhury, Amit↗
NASA NTRS1989

Review of probabilistic analysis of dynamic response of systems with random parameters

The various methods that have been studied in the past to allow probabilistic analysis of dynamic response for systems with random parameters are reviewed. Dynamic response may have been obtained deterministically if the variations about the nominal values were small; however, for space structures which require precise pointing, the variations about the nominal values of the structural details and of the environmental conditions are too large to be considered as negligible. These uncertainties are accounted for in terms of probability distributions about their nominal values. The quantities of concern for describing the response of the structure includes displacements, velocities, and the distributions of natural frequencies. The exact statistical characterization of the response would yield joint probability distributions for the response variables. Since the random quantities will appear as coefficients, determining the exact distributions will be difficult at best. Thus, certain approximations will have to be made. A number of techniques that are available are discussed, even in the nonlinear case. The methods that are described were: (1) Liouville's equation; (2) perturbation methods; (3) mean square approximate systems; and (4) nonlinear systems with approximation by linear systems.

Kozin, F.↗
NASA NTRS1973

Limiting performance of dynamic systems subject to random inputs

The problem of determining the limiting performance characteristics of mechanical systems subject to random input is studied. A review is presented of the classical work in the optimal design of stochastic systems. Some recent results of stochastic optimal control theory are employed. The solution to the limiting performance problem is formulated in both the frequency and time domains. Both formulations require substantial, burdensome computations when applied to large scale systems.

Pilkey, W. D.↗
NASA NTRS1988

Random field estimation approach to multibody dynamics

The use of recursive techniques similar to random field models to factor and invert the inertia matrix of a multibody system is discussed. An equivalence is established between the composite multibody system inertia matrix and the covariance of the output of a described linear system model. Conditional mean estimation and sequential estimation problems are solved along with problems of filtering and smoothing. Formulas are developed to compute the covariance of several relevant quantities. The foregoing results are used to obtain the inverse of the composite multibody system inertia in closed form.

Rodriguez, G.↗
NASA NTRS2008

Random Testing and Model Checking: Building a Common Framework for Nondeterministic Exploration

Two popular forms of dynamic analysis, random testing and explicit-state software model checking, are perhaps best viewed as search strategies for exploring the state spaces introduced by nondeterminism in program inputs. We present an approach that enables this nondeterminism to be expressed in the SPIN model checker's PROMELA language, and then lets users generate either model checkers or random testers from a single harness for a tested C program. Our approach makes it easy to compare model checking and random testing for models with precisely the same input ranges and probabilities and allows us to mix random testing with model checking's exhaustive exploration of non-determinism. The PROMELA language, as intended in its design, serves as a convenient notation for expressing nondeterminism and mixing random choices with nondeterministic choices. We present and discuss a comparison of random testing and model checking. The results derive from using our framework to test a C program with an effectively infinite state space, a module in JPL's next Mars rover mission. More generally, we show how the ability of the SPIN model checker to call C code can be used to extend SPIN's features, and hope to inspire others to use the same methods to implement dynamic analyses that can make use of efficient state storage, matching, and backtracking.

dynamic analysis↗
DOE OSTI2026

Deterministic Quantum Trajectory via Imaginary Time Evolution

Stochastic quantum trajectories, such as pure state evolutions under unitary dynamics and random measurements, offer a crucial ensemble description of many-body open system dynamics. Recent studies have highlighted that individual quantum trajectories also encode essential physical information. Prominent examples include measurement-induced phase transitions, where a pure quantum state corresponding to fixed measurement outcomes (trajectories) exhibits distinct entanglement phases, depending on the measurement rate. However, direct observation of this effect is hindered by an exponential postselection barrier, whereby the probability of realizing a specific trajectory is exponentially small. We propose a deterministic method to efficiently prepare quantum trajectories in polynomial time using imaginary time evolution and, thus, overcome this fundamental challenge. Here, we demonstrate that our method applies to a certain class of quantum states, and argue that universal approaches do not exist for any quantum trajectories. Our result paves the way for experimentally exploring the physics of individual quantum trajectories at scale and enables direct observation of certain postselection-dependent phenomena.

Mittal, Shivan [Los Alamos National Laboratory (LA↗
DOE OSTI2025

A randomized sketching trust-region secant method for low-memory dynamic optimization

The numerical solution of dynamic optimization problems is often limited by the memory required to store the state trajectory, which is used to evaluate the objective function and its derivatives. Recently, [R. Muthukumar et al., SIAM Journal on Optimization 31(2), pp. 1242–1275 (2021)] introduced a trust-region method for dynamic optimization that employs randomized sketching to compress the state trajectory, resulting in inexact derivative computations. By adaptively learning the sketch rank, the trust-region algorithm achieves rigorous convergence guarantees. Here, we extend this approach to use secant Hessian approximations. Due to the randomness introduced by the sketch, the traditional secant update formulae can produce poor Hessian approximations. In particular, the difference of two gradients, computed from two different sketches, may be inconsistent. To overcome this, we employ a sketched approximation of the Hessian application, in lieu of computing the gradient difference. We numerically demonstrate the improved stability of this approach on an example from PDE-constrained optimization.

dynamic optimization↗
DOE OSTI2026

Generalized master equation for particle transport in binary random media with renewal statistics

Particle transport in binary stochastic mixtures is classically modeled assuming Markovian or exponential mixing statistics but in many applications material memory invalidates the Markov assumption. For non-Markovian mixing characterized by alternating renewal processes, a transport-theoretic framework is presented that provides an exact description of transport in nonscattering random binary media with general non-exponential statistics. Our approach is to Markovianize the problem by augmenting the {material type, particle flux} state space with the age or distance from the last interface. A Chapman-Kolmogorov equation is formulated for the joint probability density of the material type, particle flux, and age, and subsequently reduced to a generalized Master equation (GME) in differential form. This constitutes the primary result of this work. A state-updating Monte Carlo algorithm consistent with the GME is developed and benchmarked against analytical solutions for multiple chord-length laws. For purely absorbing renewal statistical media, the GME reproduces analytical benchmarks for the equilibrium age distribution, interior mean/variance of material-conditioned fluxes, and boundary transmittance. Simulations further demonstrate that a Markov (exponential) approximation of non-exponential statistics can introduce large errors in transmittance and interior flux profiles. Lastly, the reintroduction of memory due to scattering is briefly addressed through heuristic considerations.

Fluctuations & noise↗
DOE OSTI2026

Constant Overhead Entanglement Distillation via Scrambling

High-fidelity quantum entanglement enables key quantum networking capabilities such as secure communication and distributed quantum computing, but long-distance entanglement distribution is limited by noise and loss. Entanglement distillation protocols address this problem by extracting high-fidelity Bell pairs from multiple noisy ones. The primary objective is minimizing the resource overhead: the number of noisy input pairs needed to distill each high-fidelity output pair. While protocols achieving optimal overhead are known in theory, they often require complex decoding operations that make practical implementation challenging. We circumvent this challenge by introducing protocols that use quantum scrambling—the spreading of quantum information under chaotic dynamics—through random Clifford operations. Based on this scrambling mechanism, our protocol maintains asymptotically constant overhead, independent of the desired output error rate $\bar{𝜖}$ , and can be implemented with shallow quantum circuits of depth 𝑂⁡(poly log log⁡ $\bar{𝜖}$ −1 ) and memory 𝑂⁡(poly log⁡ $\bar{𝜖}$ −1 ). Our protocol remains effective even with noisy quantum gates. By incorporating error correction, our protocol achieves state-of-the-art performance: starting with pairs of 10% initial infidelity, we require only seven noisy inputs per output pair to distill a single Bell pair with infidelity $\bar{𝜖}$ =10 −12 , substantially outperforming existing schemes. We demonstrate the utility of our protocols for quantum repeater networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗