Search NASA⌕ Search

SEARCH · Search NASA

Results for “Chaotic Iteration”

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.

24 records · Page 2

Distributed deep reinforcement learning for simulation control

Abstract Several applications in the scientific simulation of physical systems can be formulated as control/optimization problems. The computational models for such systems generally contain hyperparameters, which control solution fidelity and computational expense. The tuning of these parameters is non-trivial and the general approach is to manually ‘spot-check’ for good combinations. This is because optimal hyperparameter configuration search becomes intractable when the parameter space is large and when they may vary dynamically. To address this issue, we present a framework based on deep reinforcement learning (RL) to train a deep neural network agent that controls a model solve by varying parameters dynamically. First, we validate our RL framework for the problem of controlling chaos in chaotic systems by dynamically changing the parameters of the system. Subsequently, we illustrate the capabilities of our framework for accelerating the convergence of a steady-state computational fluid dynamics solver by automatically adjusting the relaxation factors of the discretized Navier–Stokes equations during run-time. The results indicate that the run-time control of the relaxation factors by the learned policy leads to a significant reduction in the number of iterations for convergence compared to the random selection of the relaxation factors. Our results point to potential benefits for learning adaptive hyperparameter learning strategies across different geometries and boundary conditions with implications for reduced computational campaign expenses 4 4 Data and codes available at https://github.com/Romit-Maulik/PAR-RL . .

42 ENGINEERING↗

Dynamics of classical particles in oval or elliptic billiards with a dispersing mechanism

Some dynamical properties for an oval billiard with a scatterer in its interior are studied. The dynamics consists of a classical particle colliding between an inner circle and an external boundary given by an oval, elliptical, or circle shapes, exploring for the first time some natural generalizations. The billiard is indeed a generalization of the annular billiard, which is of strong interest for understanding marginally unstable periodic orbits and their role in the boundary between regular and chaotic regions in both classical and quantum (including experimental) systems. For the oval billiard, which has a mixed phase space, the presence of an obstacle is an interesting addition. We demonstrate, with details, how to obtain the equations of the mapping, and the changes in the phase space are discussed. We study the linear stability of some fixed points and show both analytically and numerically the occurrence of direct and inverse parabolic bifurcations. Lyapunov exponents and generalized bifurcation diagrams are obtained. Moreover, histograms of the number of successive iterations for orbits that stay in a cusp are studied. These histograms are shown to be scaling invariant when changing the radius of the scatterer, and they have a power law slope around −3. The results here can be generalized to other kinds of external boundaries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Launching the chaotic realm of iso-fractals: A short remark

In this brief note, we introduce the new, emerging sub-discipline of iso-fractals by highlighting and discussing the preliminary results of recent works. First, we note the abundance of fractal, chaotic, non-linear, and self-similar structures in nature while emphasizing the importance of studying such systems because fractal geometry is the language of chaos. Second, we outline the iso-fractal generalization of the Mandelbrot set to exemplify the newly generated Mandelbrot iso-sets. Third, we present the cutting-edge notion of dynamic iso-spaces and explain how a mathematical space can be iso-topically lifted with iso-unit functions that (continuously or discretely) change; in the discrete case examples, we mention that iteratively generated sequences like Fibonacci’s numbers and (the complex moduli of) Mandelbrot’s numbers can supply a deterministic chain of iso-units to construct an ordered series of (magnified and/or de-magnified) iso-spaces that are locally iso-morphic. Fourth, we consider the initiation of iso-fractals with Inopin’s holographic ring (IHR) topology and fractional statistics for 2D and 3D iso-spaces. In total, the reviewed iso-fractal results are a significant improvement over traditional fractals because the application of Santilli’s iso-mathematics arms us an extra degree of freedom for attacking problems in chaos. Finally, we conclude by proposing some questions and ideas for future research work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamic analysis of nonlinear rotor-housing systems

Nonlinear analysis methods are developed which will enable the reliable prediction of the dynamic behavior of the space shuttle main engine (SSME) turbopumps in the presence of bearing clearances and other local nonlinearities. A computationally efficient convolution method, based on discretized Duhamel and transition matrix integral formulations, is developed for the transient analysis. In the formulation, the coupling forces due to the nonlinearities are treated as external forces acting on the coupled subsystems. Iteration is utilized to determine their magnitudes at each time increment. The method is applied to a nonlinear generic model of the high pressure oxygen turbopump (HPOTP). As compared to the fourth order Runge-Kutta numerical integration methods, the convolution approach proved to be more accurate and more highly efficient. For determining the nonlinear, steady-state periodic responses, an incremental harmonic balance method was also developed. The method was successfully used to determine dominantly harmonic and subharmonic responses fo the HPOTP generic model with bearing clearances. A reduction method similar to the impedance formulation utilized with linear systems is used to reduce the housing-rotor models to their coordinates at the bearing clearances. Recommendations are included for further development of the method, for extending the analysis to aperiodic and chaotic regimes and for conducting critical parameteric studies of the nonlinear response of the current SSME turbopumps.

Noah, Sherif T.↗

A synthetic seismicity model for the Middle America Trench

A novel iterative technique, based on the concept of fault segmentation and computed using 2D static dislocation theory, for building models of seismicity and fault interaction which are physically acceptable and geometrically and kinematically correct, is presented. The technique is applied in two steps to seismicity observed at the Middle America Trench. The first constructs generic models which randomly draw segment strengths and lengths from a 2D probability distribution. The second constructs predictive models in which segment lengths and strengths are adjusted to mimic the actual geography and timing of large historical earthquakes. Both types of models reproduce the statistics of seismicity over five units of magnitude and duplicate other aspects including foreshock and aftershock sequences, migration of foci, and the capacity to produce both characteristic and noncharacteristic earthquakes. Over a period of about 150 yr the complex interaction of fault segments and the nonlinear failure conditions conspire to transform an apparently deterministic model into a chaotic one.

Ward, Steven N.↗

On domains of convergence in optimization problems

Numerical optimization algorithms require the knowledge of an initial set of design variables. Starting from an initial design x(sup 0), improved solutions are obtained by updating the design iteratively in a way prescribed by the particular algorithm used. If the algorithm is successful, convergence is achieved to a local optimal solution. Let A denote the iterative procedure that characterizes a typical optimization algorithm, applied to the problem: Find x belonging to R(sup n) that maximizes f(x) subject to x belonging to Omega contained in R(sup n). We are interested in problems with several local maxima (x(sub j))(sup *), j=1, ..., m, in the feasible design space Omega. In general, convergence of the algorithm A to a specific solution (x(sub j))(sup *) is determined by the choice of initial design x(sup 0). The domain of convergence D(sub j) of A associated with a local maximum (x(sub j))(sup *) is a subset of initial designs x(sup 0) in Omega such that the sequence (x(sup k)), k=0,1,2,... defined by x(sup k+1) = A(x(sup k)), k=0,1,... converges to (x(sub j))(sup *). The set D(sub j) is also called the basin of attraction of (x(sub j))(sup *). Cayley first proposed the problem of finding the basin of attraction for Newton's method in 1897. It has been shown that the basin of attraction for Newton's method exhibits chaotic behavior in problems with polynomial objective. This implies that there may be regions in the feasible design space where arbitrarily close starting points will converge to different local optimal solutions. Furthermore, the boundaries of the domains of convergence may have a very complex, even fractal structure. In this paper we show that even simple structural optimization problems solved using standard gradient based (first order) algorithms exhibit similar features.

Diaz, Alejandro R.↗