Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the reliable and efficient numerical integration of the Kuramoto model and related dynamical systems on graphs
370
0
0.0
(
0
)
Added by
Tobias B\\\"ohle
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this work, a novel approach for the reliable and efficient numerical integration of the Kuramoto model on graphs is studied. For this purpose, the notion of order parameters is revisited for the classical Kuramoto model describing all-to-all interactions of a set of oscillators. First numerical experiments confirm that the precomputation of certain sums significantly reduces the computational cost for the evaluation of the right-hand side and hence enables the simulation of high-dimensional systems. In order to design numerical integration methods that are favourable in the context of related dynamical systems on network graphs, the concept of localised order parameters is proposed. In addition, the detection of communities for a complex graph and the transformation of the underlying adjacency matrix to block structure is an essential component for further improvement. It is demonstrated that for a submatrix comprising relatively few coefficients equal to zero, the precomputation of sums is advantageous, whereas straightforward summation is appropriate in the complementary case. Concluding theoretical considerations and numerical comparisons show that the strategy of combining effective community detection algorithms with the localisation of order parameters potentially reduces the computation time by several orders of magnitude.
rate research
Read More
We develop an algorithm for the concurrent (on-the-fly) estimation of parameters for a system of evolutionary dissipative partial differential equations in which the state is partially observed. The intuitive nature of the algorithm makes its extension to several different systems immediate, and it allows for recovery of multiple parameters simultaneously. We test this algorithm on the Kuramoto-Sivashinsky equation in one dimension and demonstrate its efficacy in this context.
The goal of this paper is twofold. First, we present a unified way of formulating numerical integration problems from both approximation theory and discrepancy theory. Second, we show how techniques, developed in approximation theory, work in proving lower bounds for recently developed new type of discrepancy -- the smooth discrepancy.
Solutions to the stochastic wave equation on the unit sphere are approximated by spectral methods. Strong, weak, and almost sure convergence rates for the proposed numerical schemes are provided and shown to depend only on the smoothness of the driving noise and the initial conditions. Numerical experiments confirm the theoretical rates. The developed numerical method is extended to stochastic wave equations on higher-dimensional spheres and to the free stochastic Schrodinger equation on the unit sphere.
A systematic mathematical framework for the study of numerical algorithms would allow comparisons, facilitate conjugacy arguments, as well as enable the discovery of improved, accelerated, data-driven algorithms. Over the course of the last century, the Koopman operator has provided a mathematical framework for the study of dynamical systems, which facilitates conjugacy arguments and can provide efficient reduced descriptions. More recently, numerical approximations of the operator have enabled the analysis of a large number of deterministic and stochastic dynamical systems in a completely data-driven, essentially equation-free pipeline. Discrete or continuous time numerical algorithms (integrators, nonlinear equation solvers, optimization algorithms) are themselves dynamical systems. In this paper, we use this insight to leverage the Koopman operator framework in the data-driven study of such algorithms and discuss benefits for analysis and acceleration of numerical computation. For algorithms acting on high-dimensional spaces by quickly contracting them towards low-dimensional manifolds, we demonstrate how basis functions adapted to the data help to construct efficient reduced representations of the operator. Our illustrative examples include the gradient descent and Nesterov optimization algorithms, as well as the Newton-Raphson algorithm.
In this article, we construct and analyse explicit numerical splitting methods for a class of semi-linear stochastic differential equations (SDEs) with additive noise, where the drift is allowed to grow polynomially and satisfies a global one-sided Lipschitz condition. The methods are proved to be mean-square convergent of order 1 and to preserve important structural properties of the SDE. In particular, first, they are hypoelliptic in every iteration step. Second, they are geometrically ergodic and have asymptotically bounded second moments. Third, they preserve oscillatory dynamics, such as amplitudes, frequencies and phases of oscillations, even for large time steps. Our results are illustrated on the stochastic FitzHugh-Nagumo model and compared with known mean-square convergent tamed/truncated variants of the Euler-Maruyama method. The capability of the proposed splitting methods to preserve the aforementioned properties makes them applicable within different statistical inference procedures. In contrast, known Euler-Maruyama type methods commonly fail in preserving such properties, yielding ill-conditioned likelihood-based estimation tools or computationally infeasible simulation-based inference algorithms.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
