اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدChoose interelement coupling to preserve self-adjoint dynamics in multiscale modelling and computation
103
0
0.0
(
0
)
تأليف
A. J. Roberts
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Consider the macroscale modelling of microscale spatiotemporal dynamics. Here we develop a new approach to ensure coarse scale discrete models preserve important self-adjoint properties of the fine scale dynamics. The first part explores the discretisation of microscale continuum dynamics. The second addresses how dynamics on a fine lattice are mapped to lattice a factor of two coarser (as in multigrids). Such mapping of discrete lattice dynamics may be iterated to empower us in future research to explore scale dependent emergent phenomena. The support of dynamical systems, centre manifold, theory ensures that the coarse scale modelling applies with a finite spectral gap, in a finite domain, and for all time. The accuracy of the models is limited by the asymptotic resolution of subgrid coarse scale processes, and is controlled by the level of truncation. As given examples demonstrate, the novel feature of the approach developed here is that it ensures the preservation of important conservation properties of the microscale dynamics.
قيم البحث
اقرأ أيضاً
The nature of distributed computation has often been described in terms of the component operations of universal computation: information storage, transfer and modification. We review the first complete framework that quantifies each of these individ
ual information dynamics on a local scale within a system, and describes the manner in which they interact to create non-trivial computation where the whole is greater than the sum of the parts. We describe the application of the framework to cellular automata, a simple yet powerful model of distributed computation. This is an important application, because the framework is the first to provide quantitative evidence for several important conjectures about distributed computation in cellular automata: that blinkers embody information storage, particles are information transfer agents, and particle collisions are information modification events. The framework is also shown to contrast the computations conducted by several well-known cellular automata, highlighting the importance of information coherence in complex computation. The results reviewed here provide important quantitative insights into the fundamental nature of distributed computation and the dynamics of complex systems, as well as impetus for the framework to be applied to the analysis and design of other systems.
Emergent processes in complex systems such as cellular automata can perform computations of increasing complexity, and could possibly lead to artificial evolution. Such a feat would require scaling up current simulation sizes to allow for enough comp
utational capacity. Understanding complex computations happening in cellular automata and other systems capable of emergence poses many challenges, especially in large-scale systems. We propose methods for coarse-graining cellular automata based on frequency analysis of cell states, clustering and autoencoders. These innovative techniques facilitate the discovery of large-scale structure formation and complexity analysis in those systems. They emphasize interesting behaviors in elementary cellular automata while filtering out background patterns. Moreover, our methods reduce large 2D automata to smaller sizes and enable identifying systems that behave interestingly at multiple scales.
The searching for the stable patterns in the evolution of cellular automata is implemented using stochastic synchronization between the present structures of the system and its precedent configurations. For most of the known evolution rules with comp
lex behavior a dynamic competition among all the possible stable patterns is established and no stationary regime is reached. For the particular rule coded by the decimal number 18, a self-synchronization phenomenon can be obtained, even when strong modifications to the synchronization method are applied.
We compare several definitions for number-conserving cellular automata that we prove to be equivalent. A necessary and sufficient condition for cas to be number-conserving is proved. Using this condition, we give a linear-time algorithm to decide num
ber-conservation. The dynamical behavior of number-conserving cas is studied and a classification that focuses on chaoticity is given.
We consider a scalar function depending on a numerical solution of an initial value problem, and its second-derivative (Hessian) matrix for the initial value. The need to extract the information of the Hessian or to solve a linear system having the H
essian as a coefficient matrix arises in many research fields such as optimization, Bayesian estimation, and uncertainty quantification. From the perspective of memory efficiency, these tasks often employ a Krylov subspace method that does not need to hold the Hessian matrix explicitly and only requires computing the multiplication of the Hessian and a given vector. One of the ways to obtain an approximation of such Hessian-vector multiplication is to integrate the so-called second-order adjoint system numerically. However, the error in the approximation could be significant even if the numerical integration to the second-order adjoint system is sufficiently accurate. This paper presents a novel algorithm that computes the intended Hessian-vector multiplication exactly and efficiently. For this aim, we give a new concise derivation of the second-order adjoint system and show that the intended multiplication can be computed exactly by applying a particular numerical method to the second-order adjoint system. In the discussion, symplectic partitioned Runge--Kutta methods play an essential role.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
