SEARCH · Engineering Papers

Results for “chaos”

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 73 records · Page 4

All sources NASA NTRS DOE OSTI

NASA NTRS1992

Loss of 'complexity' and aging. Potential applications of fractals and chaos theory to senescence

The concept of "complexity," derived from the field of nonlinear dynamics, can be adapted to measure the output of physiologic processes that generate highly variable fluctuations resembling "chaos." We review data suggesting that physiologic aging is associated with a generalized loss of such complexity in the dynamics of healthy organ system function and hypothesize that such loss of complexity leads to an impaired ability to adapt to physiologic stress. This hypothesis is supported by observations showing an age-related loss of complex variability in multiple physiologic processes including cardiovascular control, pulsatile hormone release, and electroencephalographic potentials. If further research supports this hypothesis, measures of complexity based on chaos theory and the related geometric concept of fractals may provide new ways to monitor senescence and test the efficacy of specific interventions to modify the age-related decline in adaptive capacity.

Non-NASA Center↗

NASA NTRS2006

Stochastic Representation of Chaos Using Terminal Attractors

A nonlinear version of the Liouville equation based on terminal attractors is part of a mathematical formalism for describing postinstability motions of dynamical systems characterized by exponential divergences of trajectories leading to chaos (including turbulence as a form of chaos). The formalism can be applied to both conservative systems (e.g., multibody systems in celestial mechanics) and dissipative systems (e.g., viscous fluids). The development of the present formalism was undertaken in an effort to remove positive Lyapunov exponents. The means chosen to accomplish this is coupling of the governing dynamical equations with the corresponding Liouville equation that describes the evolution of the flow of error probability. The underlying idea is to suppress the divergences of different trajectories that correspond to different initial conditions, without affecting a target trajectory, which is one that starts with prescribed initial conditions.

Zak, Michail↗

NASA NTRS2015

Subharmonic Oscillations and Chaos in Dynamic Atomic Force Microscopy

The increasing use of dynamic atomic force microscopy (d-AFM) for nanoscale materials characterization calls for a deeper understanding of the cantilever dynamics influencing scan stability, predictability, and image quality. Model development is critical to such understanding. Renormalization of the equations governing d- AFM provides a simple interpretation of cantilever dynamics as a single spring and mass system with frequency dependent cantilever stiffness and damping parameters. The renormalized model is sufficiently robust to predict the experimentally observed splitting of the free-space cantilever resonance into multiple resonances upon cantilever-sample contact. Central to the model is the representation of the cantilever sample interaction force as a polynomial expansion with coefficients F(sub ij) (i,j = 0, 1, 2) that account for the effective interaction stiffness parameter, the cantilever-to-sample energy transfer, and the amplitude of cantilever oscillation. Application of the Melnikov method to the model equation is shown to predict a homoclinic bifurcation of the Smale horseshoe type leading to a cascade of period doublings with increasing drive displacement amplitude culminating in chaos and loss of image quality. The threshold value of the drive displacement amplitude necessary to initiate subharmonic generation depends on the acoustic drive frequency, the effective damping coefficient, and the nonlinearity of the cantilever-sample interaction force. For parameter values leading to displacement amplitudes below threshold for homoclinic bifurcation other bifurcation scenarios can occur, some of which lead to chaos.

Cantrell, John H.↗

DOE OSTI2026

Strong-Drive Limits in Josephson Circuits: From Chaos to an Unbound-Resonance Threshold

Strong microwave drives enable fast measurement and parametric control in superconducting circuits but can induce transitions out of the intended low-energy manifold. We develop a unified description of strong-drive limits in flux- and charge-driven Josephson circuits across drive frequency and dc flux bias. Using classical phase-space analysis and Floquet--Markov simulations, we identify distinct low- and high-frequency mechanisms. At low frequency, we characterize bound-state resonances and separatrix chaos and find that the flux-drive chaos threshold depends strongly on dc flux bias. At high frequency, these mechanisms are suppressed, and the dissipative steady state transfers from the central bound-state sector to outer resonances formed by above-barrier running trajectories. The resulting unbound-resonance threshold is nearly independent of drive frequency and circuit parameters over the regime studied and is controlled primarily by dc flux bias. Coherent simulations show that parametric operation persists beyond this threshold, but at a reduced rate, setting an effective upper bound on the achievable operation speed. We derive analytical criteria for both thresholds, validate them numerically, and experimentally confirm the predicted dc-bias dependence of the low-frequency threshold in a flux-driven SQUID. We also determine the timescales for transfer into the unbound-resonance regime and relaxation back to the bound-state manifold after the drive is removed. Finally, we relate the stability limits to a complementary picture based on the junction critical current and extend the framework to multitone drives and inductively shunted circuits. Together, these results identify the mechanisms limiting strong driving and suggest routes to extend the stable operating range of Josephson circuits.

You, Xinyuan [Fermilab] (ORCID:0000000291789419)↗

DOE OSTI2026

Bayesian Adaptive Polynomial Chaos Expansions

Polynomial chaos expansions (PCEs) are widely used for uncertainty quantification (UQ) tasks, particularly in the applied mathematics community. However, PCE has received comparatively less attention in the statistics literature, and fully Bayesian formulations remain rare—especially with implementations in R. Motivated by the success of adaptive Bayesian machine learning models such as BART, BASS and BPPR, we develop a new fully Bayesian adaptive PCE method with an efficient and accessible R implementation: khaos. Our approach includes a novel proposal distribution that enables data-driven interaction selection and supports a modified g-prior tailored to PCE structure. Through simulation studies and real-world UQ applications, we demonstrate that the Bayesian adaptive PCE provides competitive performance for surrogate modeling, global sensitivity analysis and ordinal regression tasks.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

An effective field theory for non-maximal quantum chaos

In non-maximally quantum chaotic systems, the exponential behavior of out-of-time-ordered correlators (OTOCs) results from summing over exchanges of an infinite tower of higher “spin” operators. We construct an effective field theory (EFT) to capture these exchanges in (0 + 1) dimensions. The EFT generalizes the one for maximally chaotic systems, and reduces to it in the limit of maximal chaos. The theory predicts the general structure of OTOCs both at leading order in the 1/N expansion (N is the number of degrees of freedom), and after resuming over an infinite number of higher order 1/N corrections. These general results agree with those previously explicitly obtained in specific models. We also show that the general structure of the EFT can be extracted from the large q SYK model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

Approximating the linear response of physical chaos

Abstract Parametric derivatives of statistics are highly desired quantities in prediction, design optimization and uncertainty quantification. In the presence of chaos, the rigorous computation of these quantities is certainly possible, but mathematically complicated and computationally expensive. Based on Ruelle’s formalism, this paper shows that the sophisticated linear response algorithm can be dramatically simplified in higher-dimensional systems featuring statistical homogeneity in the physical space. We argue that the contribution of the SRB (Sinai–Ruelle–Bowen) measure gradient, which is an integral yet the most cumbersome part of the full algorithm, is negligible if the objective function is appropriately aligned with unstable manifolds. This abstract condition could potentially be satisfied by a vast family of real-world chaotic systems, regardless of the physical meaning and mathematical form of the objective function and perturbed parameter. We demonstrate several numerical examples that support these conclusions and that present the use and performance of a simplified linear response algorithm. In the numerical experiments, we consider physical models described by differential equations, including Lorenz 96 and Kuramoto–Sivashinsky.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

Accelerated basis adaptation in homogeneous chaos spaces

Polynomial chaos expansions (PCE) provide an efficient approach to uncertainty quantification (UQ) and have been adapted to diverse applications across the spectrum of science and engineering. For situations involving large stochastic parameterizations, the curse of dimensionality renders PCE-based methods computationally prohibitive. A basis adaptation approach for PCE was proposed by Tipireddy and Ghanem (2014) which transforms the input random variables through an isometry such that sufficient probabilistic characterization of specific quantities of interest (QoI) is concentrated in an algebraic manifold embedded in the linear span of the dominant transformed variables. While quite versatile, that original version of the PCE basis adaptation exhibited slow convergence for a number of problems of practical significance. In the present paper, we propose two novel methods to accelerate the convergence of the original basis adaptation approach, thus expanding its reach while also providing insight into its performance. In the first method, information gained from a pilot PCE representation is used to correct the mean and Gaussian coefficients in the adapted space. By taking advantages of probabilistic information in higher dimensional adaptation gleaned from an initial adaptation, the second method updates the rotation matrix used to identify the dominant transformed variables. In this manner, the new rotation matrix concentrates even more probabilistic information in its first few dimensions. These two method can be combined to achieve even better performance, the combined method is referred to as sequentially optimized adaptation method. Here, the methods are demonstrated on an analytical test function and a model of a space structure with several sub-components and a non-smooth quantity of interest representing the maximum acceleration over time. Both methods achieve accelerated convergence of the basis adaptation approach with negligible additional costs.

Accelerated convergence↗

DOE OSTI2023

Projection pursuit adaptation on polynomial chaos expansions

Here, the present work addresses the issue of accurate stochastic approximations in high-dimensional parametric space using tools from uncertainty quantification (UQ). The basis adaptation method and its accelerated algorithm in polynomial chaos expansions (PCE) were recently proposed to construct low-dimensional approximations adapted to specific quantities of interest (QoI). The present paper addresses one difficulty with these adaptations, namely their reliance on quadrature point sampling, which limits the reusability of potentially expensive samples. Projection pursuit (PP) is a statistical tool to find the “interesting” projections in high-dimensional data and thus bypass the curse-of-dimensionality. In the present work, we combine the fundamental ideas of basis adaptation and projection pursuit regression (PPR) to propose a novel method to simultaneously learn the optimal low-dimensional spaces and PCE representation from given data. While this projection pursuit adaptation (PPA) can be entirely data-driven, the constructed approximation exhibits mean-square convergence to the solution of an underlying governing equation and thus captures the supports and probability distributions associated with the physics constraints. The proposed approach is demonstrated on a borehole problem and a structural dynamics problem, demonstrating the versatility of the method and its ability to discover low-dimensional manifolds with high accuracy with limited data. In addition, the method can learn surrogate models for different quantities of interest while reusing the same data set.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Multi-element flow-driven spectral chaos (ME-FSC) method for uncertainty quantification of dynamical systems

The flow-driven spectral chaos (FSC) is a recently developed method for tracking and quantifying uncertainties in the long-time response of stochastic dynamical systems using the spectral approach. The method uses a novel concept called enriched stochastic flow maps as a means to construct an evolving finite-dimensional random function space that is both accurate and computationally efficient in time. In this paper, we present a multi-element version of the FSC method (the ME-FSC method for short) to tackle (mainly) those dynamical systems that are inherently discontinuous over the probability space. In ME-FSC, the random domain is partitioned into several elements, and then the problem is solved separately on each random element using the FSC method. Subsequently, results are aggregated to compute the probability moments of interest using the law of total probability. To demonstrate the effectiveness of the ME-FSC method in dealing with discontinuities and long-time integration of stochastic dynamical systems, four representative numerical examples are presented in this paper, including the Van-der-Pol oscillator problem and the Kraichnan-Orszag three-mode problem. Results show that the ME-FSC method is capable of solving problems that have strong nonlinear dependencies over the probability space, both reliably and at low computational cost.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Polynomial chaos expansions on principal geodesic Grassmannian submanifolds for surrogate modeling and uncertainty quantification

In this work we introduce a manifold learning-based surrogate modeling framework for uncertainty quantification in high-dimensional stochastic systems. Our first goal is to perform data mining on the available simulation data to identify a set of low-dimensional (latent) descriptors that efficiently parameterize the response of the high-dimensional computational model. To this end, we employ Principal Geodesic Analysis on the Grassmann manifold of the response to identify a set of disjoint principal geodesic submanifolds, of possibly different dimension, that captures the variation in the data. Since operations on the Grassmann require the data to be concentrated, we propose an adaptive algorithm based on Riemannian K-means and the minimization of the sample Fréchet variance on the Grassmann manifold to identify “local” principal geodesic submanifolds that represent different system behavior across the parameter space. Polynomial chaos expansion is then used to construct a mapping between the random input parameters and the projection of the response on these local principal geodesic submanifolds. Here, the method is demonstrated on four test cases, a toy-example that involves points on a hypersphere, a Lotka-Volterra dynamical system, a continuous-flow stirred-tank chemical reactor system, and a two-dimensional Rayleigh-Bénard convection problem.

42 ENGINEERING↗

DOE OSTI2025

Neural chaos: A spectral stochastic neural operator

Building surrogate models for operators with uncertainty quantification capabilities is essential for many engineering applications where randomness–such as variability in material properties, boundary conditions, and initial conditions–is unavoidable. Polynomial Chaos Expansion (PCE) is widely recognized as a go-to method for constructing stochastic surrogates in both intrusive and non-intrusive ways, and it has recently been used in the context of operator learning. However, its application becomes challenging for complex or high-dimensional processes, as achieving accuracy requires higher-order polynomials, which can increase computational demand and/or the risk of overfitting. Furthermore, PCE requires specialized treatments to manage random variables that are not independent, and these treatments may be problem-dependent or may fail with increasing complexity. Here, in this work, we adopt the same formalism as the spectral expansion used in PCE; however, we replace the classical polynomial basis functions with neural network (NN) basis functions to leverage their expressivity. To achieve this, we propose an algorithm that identifies NN-parameterized basis functions in a purely data-driven manner, without any prior assumptions about the joint distribution of the random variables involved, whether independent or dependent, or about their marginal distributions. The proposed algorithm identifies each NN-parameterized basis function sequentially, ensuring they are orthogonal with respect to the data distribution. The basis functions are constructed directly on the joint stochastic variables without requiring a tensor product structure or assuming independence of the random variables. This approach may offer greater flexibility for complex stochastic models, while simplifying implementation compared to the tensor product structures typically used in PCE to handle random vectors. This is particularly advantageous given the current state of open-source packages, where building and training neural networks can be done with just a few lines of code and extensive community support. We demonstrate the effectiveness of the proposed scheme through several numerical examples of varying complexity and provide comparisons with classical PCE.

Polynomial chaos expansion↗

DOE OSTI2023

Scrambling and quantum chaos indicators from long-time properties of operator distributions

Scrambling is a key concept in the analysis of nonequilibrium properties of quantum many-body systems. Most studies focus on its characterization via out-of-time-ordered correlation (OTOC) functions, particularly through the early-time decay of the OTOC. However, scrambling is a complex process which involves operator spreading and operator entanglement, and a full characterization requires one to access more refined information on the operator dynamics at several timescales. In this work we analyze operator scrambling by expanding the target operator in a complete basis and studying the structure of the expansion coefficients treated as a coarse-grained probability distribution in the space of operators. Here we study different features of this distribution, such as its mean, variance, and participation ratio, for the Ising model with longitudinal and transverse fields, kicked collective spin models, and random circuit models. We show that the long-time properties of the operator distribution display common features across these cases and discuss how these properties can be used as a proxy for the onset of quantum chaos. Finally, we discuss the connection with OTOCs and analyze the cost of probing the operator distribution experimentally using these correlation functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Emergence of many-body quantum chaos via spontaneous breaking of unitarity

It is suggested that many-body quantum chaos appears as the spontaneous symmetry breaking of unitarity in interacting quantum many-body systems. It has been shown that many-body level statistics, probed by the spectral form factor (SFF) defined as K(η,t)=$\langle$|Tr exp(-ηH+itH)| 2 $\rangle$, is dominated by a diffuson-type mode in a field theory analysis. The key finding of this Letter is that the “unitary” η = 0 case is different from the η → 0 ± limit, with the latter leading to a finite mass of these modes due to interactions. This mass suppresses a rapid exponential ramp in the SFF, which is responsible for the fast emergence of Poisson statistics in the noninteracting case, and gives rise to a nontrivial random matrix structure of many-body levels. The interaction-induced mass in the SFF shares similarities with the dephasing rate in the theory of weak localization and the Lyapunov exponent of the out-of-time-ordered correlators.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Nature of temperature chaos in spin glasses

Temperature chaos (TC) in spin glasses has been claimed to exist no matter how small the temperature change, Δ⁢T. However, experimental studies have exhibited a finite value of Δ⁢T for a transition to TC. This paper explores the onset of TC with much higher resolution than before and over a larger temperature range. We find that TC is always present, though small at the smallest Δ⁢T that we can reliably measure. However, it grows rapidly as Δ⁢T increases, the region of rapid growth coinciding with the Δ⁢T predicted from renormalization group arguments and observed experimentally. Here, we are able to transcend the full range of TC, from the completely reversible state to one that is maximally decorrelated from the initially prepared state.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Quantum chaos, integrability, and late times in the Krylov basis

Quantum chaotic systems are conjectured to display a spectrum whose fine-grained features (gaps and correlations) are well described by random matrix theory (RMT). We propose and develop a complementary version of this conjecture: quantum chaotic systems display a Lanczos spectrum whose local means and covariances are well described by RMT. To support this proposal, we first demonstrate its validity in examples of chaotic and integrable systems. We then show that for Haar-random initial states in RMTs the mean and covariance of the Lanczos spectrum suffice to produce the full long-time behavior of general survival probabilities including the spectral form factor, as well as the spread complexity. In addition, for initial states with continuous overlap with energy eigenstates, we analytically find the long-time averages of the probabilities of Krylov basis elements in terms of the mean Lanczos spectrum. This analysis suggests a notion of eigenstate complexity, the statistics of which differentiate integrable systems and classes of quantum chaos. Lastly, we clarify the relation between spread complexity and the universality classes of RMT by exploring various values of the Dyson index and Poisson distributed spectra.

Combinatorics↗

DOE OSTI2021

A Generalized Copula-Polynomial Chaos Expansion for Probabilistic Power Flow Considering Nonlinear Correlations of PV Injections

This paper develops a generalized Copula-polynomial chaos expansion (PCE) framework for power system probabilistic power flow that can handle both linear and nonlinear correlations of uncertain power injections, such as wind and PVs. A data-driven Copula statistical model is used to capture the correlations of uncertain power injections. This allows us to resort to the Rosenblatt transformation to transform correlated variables into independent ones while preserving the dependence structure. This paves the way of leveraging the PCE for surrogate modeling and uncertainty quantification of power flow results, i.e., achieving the probabilistic distributions of power flows. Simulations carried out on the IEEE 57-bus system show that the proposed framework can get much more accurate results than other alternatives with different linear and nonlinear power injection correlations.

copula↗

DOE OSTI2025

Polynomial Chaos Surrogate Construction for Random Fields with Parametric Uncertainty

Engineering and applied science rely on computational experiments to rigorously study physical systems. The mathematical models used to probe these systems are highly complex, and sampling-intensive studies often require prohibitively many simulations for acceptable accuracy. Surrogate models provide a means of circumventing the high computational expense of sampling such complex models. In particular, polynomial chaos expansions (PCEs) have been successfully used for uncertainty quantification studies of deterministic models where the dominant source of uncertainty is parametric. We discuss an extension to conventional PCE surrogate modeling to enable surrogate construction for stochastic computational models that have intrinsic noise in addition to parametric uncertainty. We develop a PCE surrogate on a joint space of intrinsic and parametric uncertainty, enabled by Rosenblatt transformations, which are evaluated via kernel density estimation of the associated conditional cumulative distributions. Furthermore, we extend the construction to random field data via the Karhunen–Loève expansion. We then take advantage of closed-form solutions for computing PCE Sobol indices to perform a global sensitivity analysis of the model which quantifies the intrinsic noise contribution to the overall model output variance. Additionally, the resulting joint PCE is generative in the sense that it allows generating random realizations at any input parameter setting that are statistically approximately equivalent to realizations from the underlying stochastic model. The method is demonstrated on a chemical catalysis example model and a synthetic example controlled by a parameter that enables a switch from unimodal to bimodal response distributions.

97 MATHEMATICS AND COMPUTING↗