Search NASA⌕ Search

SEARCH · Search NASA

Results for “chaotic states”

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 91 records · Page 5

Distinct universality classes of diffusive transport from full counting statistics

The hydrodynamic transport of local conserved densities furnishes an effective coarse-grained description of the dynamics of a many-body quantum system. However, the full quantum dynamics contains much more structure beyond the simplified hydrodynamic description. Here we show that systems with the same hydrodynamics can nevertheless belong to distinct dynamical universality classes, as revealed by new classes of experimental observables accessible in synthetic quantum systems, which can, for instance, measure simultaneous site-resolved snapshots of all of the particles in a system. Specifically, we study the full counting statistics of spin transport, whose first moment is related to linear-response transport, but the higher moments go beyond. We present an analytic theory of the full counting statistics of spin transport in various integrable and nonintegrable anisotropic one-dimensional spin models, including the XXZ spin chain. We find that spin transport, while diffusive on average, is governed by a distinct non-Gaussian dynamical universality class in the models considered. We consider a setup in which the left and right half of the chain are initially created at different magnetization densities, and consider the probability distribution of the magnetization transferred between the two half-chains. We derive a closed-form expression for the probability distribution of the magnetization transfer, in terms of random walks on the half-line. We show that this distribution strongly violates the large-deviation form expected for diffusive chaotic systems, and explain the physical origin of this violation. Here, we discuss the crossovers that occur as the initial state is brought closer to global equilibrium. Our predictions can directly be tested in experiments using quantum gas microscopes or superconducting qubit arrays.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Optimizing Earthquake Nowcasting With Machine Learning: The Role of Strain Hardening in the Earthquake Cycle

Abstract Nowcasting is a term originating from economics, finance, and meteorology. It refers to the process of determining the uncertain state of the economy, markets or the weather at the current time by indirect means. In this paper, we describe a simple two‐parameter data analysis that reveals hidden order in otherwise seemingly chaotic earthquake seismicity. One of these parameters relates to a mechanism of seismic quiescence arising from the physics of strain‐hardening of the crust prior to major events. We observe an earthquake cycle associated with major earthquakes in California, similar to what has long been postulated. An estimate of the earthquake hazard revealed by this state variable time series can be optimized by the use of machine learning in the form of the Receiver Operating Characteristic skill score. The ROC skill is used here as a loss function in a supervised learning mode. Our analysis is conducted in the region of 5° × 5° in latitude‐longitude centered on Los Angeles, a region which we used in previous papers to build similar time series using more involved methods (Rundle & Donnellan, 2020, https://doi.org/10.1029/2020EA001097 ; Rundle, Donnellan et al., 2021, https://doi.org/10.1029/2021EA001757 ; Rundle, Stein et al., 2021, https://doi.org/10.1088/1361-6633/abf893 ). Here we show that not only does the state variable time series have forecast skill, the associated spatial probability densities have skill as well. In addition, use of the standard ROC and Precision (PPV) metrics allow probabilities of current earthquake hazard to be defined in a simple, straightforward, and rigorous way.

58 GEOSCIENCES↗

Simultaneous Measurements of Noncommuting Observables: Positive Transformations and Instrumental Lie Groups

We formulate a general program for describing and analyzing continuous, differential weak, simultaneous measurements of noncommuting observables, which focuses on describing the measuring instrument autonomously, without states. The Kraus operators of such measuring processes are time-ordered products of fundamental differential positive transformations, which generate nonunitary transformation groups that we call instrumental Lie groups. The temporal evolution of the instrument is equivalent to the diffusion of a Kraus-operator distribution function, defined relative to the invariant measure of the instrumental Lie group. This diffusion can be analyzed using Wiener path integration, stochastic differential equations, or a Fokker-Planck-Kolmogorov equation. This way of considering instrument evolution we call the Instrument Manifold Program. We relate the Instrument Manifold Program to state-based stochastic master equations. We then explain how the Instrument Manifold Program can be used to describe instrument evolution in terms of a universal cover that we call the universal instrumental Lie group, which is independent not just of states, but also of Hilbert space. The universal instrument is generically infinite dimensional, in which case the instrument’s evolution is chaotic. Special simultaneous measurements have a finite-dimensional universal instrument, in which case the instrument is considered principal, and it can be analyzed within the differential geometry of the universal instrumental Lie group. Principal instruments belong at the foundation of quantum mechanics. We consider the three most fundamental examples: measurement of a single observable, position and momentum, and the three components of angular momentum. As these measurements are performed continuously, they converge to strong simultaneous measurements. For a single observable, this results in the standard decay of coherence between inequivalent irreducible representations. For the latter two cases, it leads to a collapse within each irreducible representation onto the classical or spherical phase space, with the phase space located at the boundary of these instrumental Lie groups.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A physical model for earthquakes. I - Fluctuations and interactions. II - Application to southern California

The idea that earthquakes represent a fluctuation about the long-term motion of plates is expressed mathematically through the fluctuation hypothesis, under which all physical quantities which pertain to the occurance of earthquakes are required to depend on the difference between the present state of slip on the fault and its long-term average. It is shown that under certain circumstances the model fault dynamics undergo a sudden transition from a spatially ordered, temporally disordered state to a spatially disordered, temporally ordered state, and that the latter stages are stable for long intervals of time. For long enough faults, the dynamics are evidently chaotic. The methods developed are then used to construct a detailed model for earthquake dynamics in southern California. The result is a set of slip-time histories for all the major faults, which are similar to data obtained by geological trenching studies. Although there is an element of periodicity to the events, the patterns shift, change and evolve with time. Time scales for pattern evolution seem to be of the order of a thousand years for average recurring intervals of about a hundred years.

Rundle, John B.↗

Chaotic nature of the spin-glass phase

The microscopic structure of the ordered phase of spin glasses is investigated theoretically in the framework of the T = 0 fixed-point model (McMillan, 1984; Fisher and Huse, 1986; and Bray and Moore, 1986). The sensitivity of the ground state to changes in the interaction strengths at T = 0 is explored, and it is found that for sufficiently large length scales the ground state is unstable against arbitrarily weak perturbations to the bonds. Explicit results are derived for d = 1, and the implications for d = 2 and d = 3 are considered in detail. It is concluded that there is no hidden order pattern for spin glasses at all T less than T(C), the ordered-phase spin correlations being chaotic functions of spin separation at fixed temperature or of temperature (for a given pair of spins) at scale lengths L greater than (T delta T) exp -1/zeta, where zeta = d(s)/2 - y, d(s) is the interfacial fractal dimension, and -y is the thermal eigenvalue at T = 0.

Bray, A. J.↗

Limitations for Quantum Algorithms to Solve Turbulent and Chaotic Systems

We investigate the limitations of quantum computers for solving nonlinear dynamical systems. In particular, we tighten the worst-case bounds of the quantum Carleman linearisation (QCL) algorithm answering one of their open questions. We provide a further significant limitation for any quantum algorithm that aims to output a quantum state that approximates the normalized solution vector. Given a natural choice of coordinates for a dynamical system with one or more positive Lyapunov exponents and solutions that grow sub-exponentially, we prove that any such algorithm has complexity scaling at least exponentially in the integration time. As such, an efficient quantum algorithm for simulating chaotic systems or regimes is likely not possible.

97 MATHEMATICS AND COMPUTING↗

A Machine-Checked Proof of A State-Space Construction Algorithm

This paper presents the correctness proof of Saturation, an algorithm for generating state spaces of concurrent systems, implemented in the SMART tool. Unlike the Breadth First Search exploration algorithm, which is easy to understand and formalise, Saturation is a complex algorithm, employing a mutually-recursive pair of procedures that compute a series of non-trivial, nested local fixed points, corresponding to a chaotic fixed point strategy. A pencil-and-paper proof of Saturation exists, but a machine checked proof had never been attempted. The key element of the proof is the characterisation theorem of saturated nodes in decision diagrams, stating that a saturated node represents a set of states encoding a local fixed-point with respect to firing all events affecting only the node s level and levels below. For our purpose, we have employed the Prototype Verification System (PVS) for formalising the Saturation algorithm, its data structures, and for conducting the proofs.

Catano, Nestor↗

Magnetic droplet soliton pairs

We demonstrate magnetic droplet soliton pairs in all-perpendicular spin-torque nano-oscillators (STNOs), where one droplet resides in the STNO free layer (FL) and the other in the reference layer (RL). Typically, theoretical, numerical, and experimental droplet studies have focused on the FL, with any additional dynamics in the RL entirely ignored. Here we show that there is not only significant magnetodynamics in the RL, but the RL itself can host a droplet driven by, and coexisting with, the FL droplet. Both single droplets and pairs are observed experimentally as stepwise changes and sharp peaks in the dc and differential resistance, respectively. While the single FL droplet is highly stable, the coexistence state exhibits high-power broadband microwave noise. Furthermore, micromagnetic simulations reveal that the pair dynamics display periodic, quasi-periodic, and chaotic signatures controlled by applied field and current. The strongly interacting and closely spaced droplet pair offers a unique platform for fundamental studies of highly non-linear soliton pair dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An introduction to chaotic and random time series analysis

The origin of chaotic behavior and the relation of chaos to randomness are explained. Two mathematical results are described: (1) a representation theorem guarantees the existence of a specific time-domain model for chaos and addresses the relation between chaotic, random, and strictly deterministic processes; (2) a theorem assures that information on the behavior of a physical system in its complete state space can be extracted from time-series data on a single observable. Focus is placed on an important connection between the dynamical state space and an observable time series. These two results lead to a practical deconvolution technique combining standard random process modeling methods with new embedded techniques.

Scargle, Jeffrey D.↗

Speed of quantum information spreading in chaotic systems

In this work, we present a general theory of quantum information propagation in chaotic quantum many-body systems. The generic expectation in such systems is that quantum information does not propagate in localized form; instead, it tends to spread out and scramble into a form that is inaccessible to local measurements. To characterize this spreading, we define an information speed via a quench-type experiment and derive a general formula for it as a function of the entanglement density of the initial state. As the entanglement density varies from zero to one, the information speed varies from the entanglement speed to the butterfly speed. We verify that the formula holds both for a quantum chaotic spin chain and in field theories with an AdS/CFT gravity dual. For the second case, we study in detail the dynamics of entanglement in two-sided Vaidya-AdS-Reissner-Nordstrom black branes. We also show that, with an appropriate decoding process, quantum information can be construed as moving at the information speed, and, in the case of AdS/CFT, we show that a locally detectable signal propagates at the information speed in a spatially local variant of the traversable wormhole setup.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Chaos on the hypercube

We analyze the spectral properties of a d-dimensional HyperCubic (HC) lattice model originally introduced by Parisi. The U(1) gauge links of this model give rise to a magnetic flux of constant magnitude φ but random orientation through the faces of the hypercube. The HC model, which also can be written as a model of 2d interacting Majorana fermions, has a spectral flow that is reminiscent of Maldacena-Qi (MQ) model, and its spectrum at φ = 0, actually coincides with the coupling term of the MQ model. As was already shown by Parisi, at leading order in 1/d, the spectral density of this model is given by the density function of the Q-Hermite polynomials, which is also the spectral density of the double-scaled Sachdev-Ye-Kitaev model. Parisi demonstrated this by mapping the moments of the HC model to Q-weighted sums on chord diagrams. We point out that the subleading moments of the HC model can also be mapped to weighted sums on chord diagrams, in a manner that descends from the leading moments. The HC model has a magnetic inversion symmetry that depends on both the magnitude and the orientation of the magnetic flux through the faces of the hypercube. The spectrum for fixed quantum number of this symmetry exhibits a transition from regular spectra at φ = 0 to chaotic spectra with spectral statistics given by the Gaussian Unitary Ensembles (GUE) for larger values of φ. For small magnetic flux, the ground state is gapped and is close to a Thermofield Double (TFD) state.

1/N expansion↗

On the estimation of the correlation dimension and its application to radar reflector discrimination

Recently, system theorists have recognized that low order systems of nonlinear differential equations can give rise to solutions which are neither periodic, constant, nor predictable in steady state, but which are nonetheless bounded and deterministic. This behavior, which was first described in the study of weather systems, has been termed 'chaotic.' Much study of chaotic systems has concentrated on analysis of the systems' phase space attractors. It has been recognized that invariant measures of the attractor possess inherent information about the system. One such measure is the dimension of the attractors. The dimension of a chaotic attractor has been shown to be noninteger, leading to the term 'strange attractor;' the attractor is said to have a fractal structure. The correlation dimension has become one of the most popular measures of dimension. However, many problems have been identified in correlation dimension estimation from time sequences. The most common methods for obtaining the correlation dimension have been least squares curves fitting to find the slope of the correlation integral and the Takens Estimator. However, these estimates show unacceptable sensitivity to the upper limit on the distance chosen. Here, a new method is proposed which is shown to be rather insensitive to the upper limit and to perform in a very stable manner, at least in the absence of noise. The correlation dimension is also shown to be an effective discriminant in distinguishing between radar returns resulting from weather and those from the ground. The weather returns are shown to have a correlation dimension generally between 2.0 and 3.0, while ground returns have a correlation dimension exceeding 3.0.

Barnett, Kevin D.↗

Chaotic Rotation of Nereid

The shape and spin of Neptune's outermost satellite Nereid are still unknown. Ground-based photometry indicates large brightness variations, but different observers report very different lightcurve amplitudes and periods. On the contrary, Voyager 2 images spanning 12 days show no evidence of variations greater than 0.1 mag. The latter suggest either that Nereid is nearly spherical, or that it is rotating slowly. We propose that tides have already despun Nereid's rotation to a period of a few weeks, during the time before the capture of Triton when Nereid was closer to Neptune. Since Nereid reached its present orbit, tides have further despun Nereid to a period on the order of a month. For Nereid's orbital eccentricity of 0.75, tidal evolution ceases when the spin period is still approximately 1/8 of the orbital period. Furthermore, the synchronous resonance becomes quite weak for such high eccentricities, along with other low-order spin orbit commensurabilities. In contrast, high-order resonances become very strong particularly the 6:1, 6.5:1, 7:1, 7.5:1, and 8:1 spin states. If Nereid departs by more than approximately 1% from a sphere, however, these resonances overlap, generating chaos. Our simulations show that Nereid is likely to be in chaotic rotation for any spin period longer than about 2 weeks.

Dobrovolskis, Anthony R.↗

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current state-of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be implemented in a high-performance but general way in XBraid and explored for more complicated problems. We will additionally research, as time allows, improvements to these techniques, as well as multigrid relaxation techniques based on Least Squares Shadowing (LSS by Wang) and a nonintrusive block tridiagonal solver based on MGRIT, called TriMGRIT.

97 MATHEMATICS AND COMPUTING↗

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallel-in-time methods, with the most common method, parareal, diverging in many cases. The current state of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be further researched and improved (including with a new relaxation method inspired by on Least Squares Shadowing (LSS)) and explored for more complicated problems.

97 MATHEMATICS AND COMPUTING↗

Interesting examples of supervised continuous variable systems

The authors analyze two simple deterministic flow models for multiple buffer servers which are examples of the supervision of continuous variable systems by a discrete controller. These systems exhibit what may be regarded as the two extremes of complexity of the closed loop behavior: one is eventually periodic, the other is chaotic. The first example exhibits chaotic behavior that could be characterized statistically. The dual system, the switched server system, exhibits very predictable behavior, which is modeled by a finite state automaton. This research has application to multimodal discrete time systems where the controller can choose from a set of transition maps to implement.

Chase, Christopher↗