Engineering Papers⌕ Search

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.

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

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

Scaling of chaos in strongly nonlinear lattices

Although it is now understood that chaos in complex classical systems is the foundation of thermodynamic behavior, the detailed relations between the microscopic properties of the chaotic dynamics and the macroscopic thermodynamic observations still remain mostly in the dark. In this work, we numerically analyze the probability of chaos in strongly nonlinear Hamiltonian systems and find different scaling properties depending on the nonlinear structure of the model. We argue that these different scaling laws of chaos have definite consequences for the macroscopic diffusive behavior, as chaos is the microscopic mechanism of diffusion. This is compared with previous results on chaotic diffusion [M. Mulansky and A. Pikovsky, New J. Phys. 15, 053015 (2013)], and a relation between microscopic chaos and macroscopic diffusion is established.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Quantum signatures of chaos or quantum chaos?

A critical analysis of the present-day concept of chaos in quantum systems as nothing but a “quantum signature” of chaos in classical mechanics is given. In contrast to the existing semi-intuitive guesses, a definition of classical and quantum chaos is proposed on the basis of the Liouville–Arnold theorem: a quantum chaotic system featuring N degrees of freedom should have M < N independent first integrals of motion (good quantum numbers) specified by the symmetry of the Hamiltonian of the system. Quantitative measures of quantum chaos that, in the classical limit, go over to the Lyapunov exponent and the classical stability parameter are proposed. The proposed criteria of quantum chaos are applied to solving standard problems of modern dynamical chaos theory.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2015

Limitations of polynomial chaos expansions in the Bayesian solution of inverse problems

Polynomial chaos expansions are used to reduce the computational cost in the Bayesian solutions of inverse problems by creating a surrogate posterior that can be evaluated inexpensively. We show, by analysis and example, that when the data contain significant information beyond what is assumed in the prior, the surrogate posterior can be very different from the posterior, and the resulting estimates become inaccurate. One can improve the accuracy by adaptively increasing the order of the polynomial chaos, but the cost may increase too fast for this to be cost effective compared to Monte Carlo sampling without a surrogate posterior.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2013

Magnetic field induced dynamical chaos

In this article, we have studied the dynamics of a particle having charge in the presence of a magnetic field. The motion of the particle is confined in the x–y plane under a two dimensional nonlinear potential. We have shown that constant magnetic field induced dynamical chaos is possible even for a force which is derived from a simple potential. For a given strength of the magnetic field, initial position, and velocity of the particle, the dynamics may be regular, but it may become chaotic when the field is time dependent. Chaotic dynamics is very often if the field is time dependent. Origin of chaos has been explored using the Hamiltonian function of the dynamics in terms of action and angle variables. Applicability of the present study has been discussed with a few examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Routes to spatiotemporal chaos in Kerr optical frequency combs

We investigate the various routes to spatiotemporal chaos in Kerr optical frequency combs, obtained through pumping an ultra-high Q-factor whispering-gallery mode resonator with a continuous-wave laser. The Lugiato–Lefever model is used to build bifurcation diagrams with regards to the parameters that are externally controllable, namely, the frequency and the power of the pumping laser. We show that the spatiotemporal chaos emerging from Turing patterns and solitons display distinctive dynamical features. Experimental spectra of chaotic Kerr combs are also presented for both cases, in excellent agreement with theoretical spectra.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Transient spatiotemporal chaos in the Morris-Lecar neuronal ring network

Transient behavior is thought to play an integral role in brain functionality. Numerical simulations of the firing activity of diffusively coupled, excitable Morris-Lecar neurons reveal transient spatiotemporal chaos in the parameter regime below the saddle-node on invariant circle bifurcation point. The neighborhood of the chaotic saddle is reached through perturbations of the rest state, in which few initially active neurons at an effective spatial distance can initiate spatiotemporal chaos. The system escapes from the neighborhood of the chaotic saddle to either the rest state or to a state of pulse propagation. The lifetime of the chaotic transients is manipulated in a statistical sense through a singular application of a synchronous perturbation to a group of neurons.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs

Generalized polynomial chaos (gPC) expansions allow us to represent the solution of a stochastic system using a series of polynomial chaos basis functions. The number of gPC terms increases dramatically as the dimension of the random input variables increases. When the number of the gPC terms is larger than that of the available samples, a scenario that often occurs when the corresponding deterministic solver is computationally expensive, evaluation of the gPC expansion can be inaccurate due to over-fitting. We propose a fully Bayesian approach that allows for global recovery of the stochastic solutions, in both spatial and random domains, by coupling Bayesian model uncertainty and regularization regression methods. It allows the evaluation of the PC coefficients on a grid of spatial points, via (1) the Bayesian model average (BMA) or (2) the median probability model, and their construction as spatial functions on the spatial domain via spline interpolation. The former accounts for the model uncertainty and provides Bayes-optimal predictions; while the latter provides a sparse representation of the stochastic solutions by evaluating the expansion on a subset of dominating gPC bases. Moreover, the proposed methods quantify the importance of the gPC bases in the probabilistic sense through inclusion probabilities. We design a Markov chain Monte Carlo (MCMC) sampler that evaluates all the unknown quantities without the need of ad-hoc techniques. The proposed methods are suitable for, but not restricted to, problems whose stochastic solutions are sparse in the stochastic space with respect to the gPC bases while the deterministic solver involved is expensive. We demonstrate the accuracy and performance of the proposed methods and make comparisons with other approaches on solving elliptic SPDEs with 1-, 14- and 40-random dimensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions

Here, compressive sensing is a powerful technique for recovering sparse solutions of underdetermined linear systems, which is often encountered in uncertainty quantification analysis of expensive and high-dimensional physical models. We perform numerical investigations employing several compressive sensing solvers that target the unconstrained LASSO formulation, with a focus on linear systems that arise in the construction of polynomial chaos expansions. With core solvers l1_ls, SpaRSA, CGIST, FPC_AS, and ADMM, we develop techniques to mitigate overfitting through an automated selection of regularization constant based on cross-validation, and a heuristic strategy to guide the stop-sampling decision. Practical recommendations on parameter settings for these techniques are provided and discussed. The overall method is applied to a series of numerical examples of increasing complexity, including large eddy simulations of supersonic turbulent jet-in-crossflow involving a 24-dimensional input. Through empirical phase-transition diagrams and convergence plots, we illustrate sparse recovery performance under structures induced by polynomial chaos, accuracy, and computational trade-offs between polynomial bases of different degrees, and practicability of conducting compressive sensing for a realistic, high-dimensional physical application. Across test cases studied in this paper, we find ADMM to have demonstrated empirical advantages through consistent lower errors and faster computational times.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Compressive sampling of polynomial chaos expansions: Convergence analysis and sampling strategies

Sampling orthogonal polynomial bases via Monte Carlo is of interest for uncertainty quantification of models with random inputs, using Polynomial Chaos (PC) expansions. It is known that bounding a probabilistic parameter, referred to as coherence, yields a bound on the number of samples necessary to identify coefficients in a sparse PC expansion via solution to an ℓ{sub 1}-minimization problem. Utilizing results for orthogonal polynomials, we bound the coherence parameter for polynomials of Hermite and Legendre type under their respective natural sampling distribution. In both polynomial bases we identify an importance sampling distribution which yields a bound with weaker dependence on the order of the approximation. For more general orthonormal bases, we propose the coherence-optimal sampling: a Markov Chain Monte Carlo sampling, which directly uses the basis functions under consideration to achieve a statistical optimality among all sampling schemes with identical support. We demonstrate these different sampling strategies numerically in both high-order and high-dimensional, manufactured PC expansions. In addition, the quality of each sampling method is compared in the identification of solutions to two differential equations, one with a high-dimensional random input and the other with a high-order PC expansion. In both cases, the coherence-optimal sampling scheme leads to similar or considerably improved accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Distinguishing localization from chaos: Challenges in finite-size systems

Highlights: • Provides an overview of the current understanding of the many-body localization phase transition. • Discusses the subtleties of finite-size scaling near this transition • Assesses the implications of these subtleties for numerical studies of spin chains. • Explores scaling of diagnostics in models with known localization transitions. • Presents suggestions for future numerical work. We re-examine attempts to study the many-body localization transition using measures that are physically natural on the ergodic/quantum chaotic regime of the phase diagram. Using simple scaling arguments and an analysis of various models for which rigorous results are available, we find that these measures can be particularly adversely affected by the strong finite-size effects observed in nearly all numerical studies of many-body localization. This severely impacts their utility in probing the transition and the localized phase. In light of this analysis, we discuss a recent study (Šuntajs et al., 2020) of the behaviour of the Thouless energy and level repulsion in disordered spin chains, and its implications for the question of whether MBL is a true phase of matter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Signature candidate of quantum chaos far from the semiclassical regime

We numerically investigated the entanglement product in the simplest coupled kicked top model with the spin j = 1. Different from the dynamical pattern of entanglement in the semiclassical regime, two similar initial states may have discordant entanglement oscillations. A candidate of the quantum signature of this classical chaotic system was proposed. The potential antimonotonic relation between the rank correlation coefficient qualifying the concordant of two entanglement evolutions and the stationary entanglement was preliminarily revealed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Poincaré recurrence statistics as an indicator of chaos synchronization

The dynamics of the autonomous and non-autonomous Rössler system is studied using the Poincaré recurrence time statistics. It is shown that the probability distribution density of Poincaré recurrences represents a set of equidistant peaks with the distance that is equal to the oscillation period and the envelope obeys an exponential distribution. The dimension of the spatially uniform Rössler attractor is estimated using Poincaré recurrence times. The mean Poincaré recurrence time in the non-autonomous Rössler system is locked by the external frequency, and this enables us to detect the effect of phase-frequency synchronization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Basis adaptation in homogeneous chaos spaces

We present a new method for the characterization of subspaces associated with low-dimensional quantities of interest (QoI). The probability density function of these QoI is found to be concentrated around one-dimensional subspaces for which we develop projection operators. Our approach builds on the properties of Gaussian Hilbert spaces and associated tensor product spaces.

97 MATHEMATICS AND COMPUTING↗