SearcharxivSearch

arXiv · 1501.04237

Quantized linear systems on integer lattices: a frequency-based approach

Abstract

The roundoff errors in computer simulations of continuous dynamical systems, caused by finiteness of machine arithmetic, can lead to qualitative discrepancies between phase portraits of the resulting spatially discretized systems and the original systems. These effects can be modelled on a multidimensional integer lattice by using a dynamical system obtained by composing the transition operator of the original system with a quantizer. Such models manifest pseudorandomness which can be studied using a rigorous probability theoretic approach. To this end, the lattice $\mathbb{Z}^n$ is endowed with a class of frequency measurable subsets and a spatial frequency functional as a finitely additive probability measure on them. Using a multivariate version of Weyl's equidistribution criterion, we introduce an algebra of frequency measurable quasiperiodic subsets of the lattice. This approach is applied to quantized linear systems with the transition operator $R \circ L$, where $L$ is a nonsingular matrix of the original linear system in $\mathbb{R}^n$, and the map $R$ commutes with the additive group of translations of the lattice. For almost every $L$, the events associated with the deviation of trajectories of the quantized and original systems are frequency measurable quasiperiodic subsets of the lattice whose frequencies involve geometric probabilities on finite-dimensional tori. Using the skew products of measure preserving toral automorphisms, we prove mutual independence and uniform distribution of the quantization errors and investigate statistical properties of invertibility loss for the quantized linear system, extending V.V.Voevodin's results. When $L$ is similar to an orthogonal matrix, we establish a functional central limit theorem for the deviations of trajectories of the quantized and original systems. These results are demonstrated for rounded-off planar rotations.

Explore related subjects

Keep this discovery

BibTeXRIS

Igor G. Vladimirov. 2015-01-17. Quantized linear systems on integer lattices: a frequency-based approach. https://arxiv.org/abs/1501.04237

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR