Application of mode decomposition approach to the synchronization of the non-identical dynamical systems

The synchronization problem of two different dynamical systems is considered by employing mode decomposition approach in this paper. Synchronization of non-identical coupled dynamical systems with non-chaotic attractors, i.e., equilibria, periodic and quasi-periodic solutions, is investigated analytically and numerically. Some results are obtained by this method. Some examples, supported by numerical simulation, are presented to illustrate the conciseness and effectiveness of the approach.     

Spectral estimates for saddle point matrices arising in weak constraint four‐dimensional variational data assimilation

We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds.     

Information percolation and cutoff for the random‐cluster model

We consider the random‐cluster model (RCM) on with parameters p∈(0,1) and q ≥ 1. This is a generalization of the standard bond percolation (with edges open independently with probability p) which is biased by a factor q raised to the number of connected components. We study the well‐known Fortuin‐Kasteleyn (FK)‐dynamics on this model where the update at an edge depends on the global geometry of the system unlike the Glauber heat‐bath dynamics for spin systems, and prove that for all small enough p (depending on the dimension) and any q>1, the FK‐dynamics exhibits the cutoff phenomenon at with a window size , where λ_∞ is the large n limit of the spectral gap of the process. Our proof extends the information percolation framework of Lubetzky and Sly to the RCM and also relies on the arguments of Blanca and Sinclair who proved a sharp mixing time bound for the planar version. A key aspect of our proof is the analysis of the effect of a sequence of dependent (across time) Bernoulli percolations extracted from the graphical construction of the dynamics, on how information propagates.     

Description of stability for linear time-invariant systems based on the first curvature

This paper focuses on using the first curvature κ(t) of trajectory to describe the stability of linear time-invariant system. We extend the results for two and three-dimensional systems (Wang, Sun, Song et al, arXiv:1808.00290) to n-dimensional systems. We prove that for a system $\text{◂=▸}\dot{r}(t)=\text{◂⋅▸}Ar(t)$, (a) if there exists a measurable set whose Lebesgue measure is greater than zero, such that $\text{◂≠▸}\underset{t\to +\infty }{\lim }\kappa (t)\ne 0$ or $\underset{t\to +\infty }{\lim }\kappa (t)$ does not exist for any initial value in this set, then the zero solution of the system is stable; (b) if the matrix A is invertible, and there exists a measurable set whose Lebesgue measure is greater than zero, such that $\text{◂=▸}\underset{t\to +\infty }{\lim }\kappa (t)=+\infty$ for any initial value in this set, then the zero solution of the system is asymptotically stable.     

Energy decay and control for a system of strings elastically connected in parallel

In the present paper, we study energy decay and exact boundary controllability for a system of n one-dimensional linear wave equations coupled in parallel. The control obtained is a square integrable of the Neuman type for initial data with finite energy. The controllability time is near optimal value. We treat the case of control in the whole boundary and also in part of it.     

P systems with array objects and array rewriting rules

Array P systems were introduced by Paun Gh. which is linking the two areas of membrane computing and picture grammars. Puzzle grammars were introduced by us for generating connected picture arrays in the two-dimensional plane, motivated by the problem of tiling the plane. On the other hand, incorporating into arrays the developmental type of generation used in the well-known biologically motivated L systems, Siromoney and Siromoney proposed a very general rectangular array generating model, called extended controlled tabled L array system (ECTLAS). In this paper we introduce two variations of the array P system, called BPG array P system and parallel array P system. The former has in the regions array objects and basic puzzle grammar rules (BPG), which are a specific kind of puzzle grammar rules. In the latter, the regions have rectangular array objects and tables of context-free rules. We examine these two types of P systems for their array generative power.     

ON ENERGY CONSERVATION BY TRIGONOMETRIC INTEGRATORS IN THE LINEAR CASE WITH APPLICATION TO WAVE EQUATIONS

Trigonometric integrators for oscillatory linear Hamiltonian differential equations are considered. Under a condition of Hairer & Lubich on the filter functions in the method, a modified energy is derived that is exactly preserved by trigonometric integrators. This implies and extends a known result on all-time near-conservation of energy. The extension can be applied to linear wave equations.