Related papers: Discrete averaging for discrete time dynamical sys…
We investigate stochastic averaging theory for locally Lipschitz discrete-time nonlinear systems with stochastic perturbation and its applications to convergence analysis of discrete-time stochastic extremum seeking algorithms. Firstly, by…
In this paper we study dynamic averaging load balancing on general graphs. We consider infinite time and dynamic processes, where in every step new load items are assigned to randomly chosen nodes. A matching is chosen, and the load is…
Adiabatic passage employs a slowly varying time-dependent Hamiltonian to control the evolution of a quantum system along the Hamiltonian eigenstates. For processes of finite duration, the exact time evolving state may deviate from the…
The method of continuous averaging can be regarded as a combination of the Lie method, where a change of coordinates is constructed as a shift along solutions of a differential equation and the Neishtadt method, well-known in perturbation…
We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is…
As periodic orbit theory works badly on computing the observable averages of dynamical systems with intermittency, we propose a scheme to cooperate with cycle expansion and perturbation theory so that we can deal with intermittent systems…
Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra…
We consider a discrete-time model of continuous-time distributed optimization over dynamic directed-graphs (digraphs) with applications to distributed learning. Our optimization algorithm works over general strongly connected dynamic…
A proof of the adiabatic theorem for quantum systems whose time evolution proceeds along discrete time, e.g., quantum maps and quantum circuits, is shown.
We introduce a two-dimensional discrete-time dynamical system which represents the evolution of an angle and angular velocity. While the angle evolves by a fixed amount in every step, the evolution of the angular velocity is governed by a…
We consider a dynamical system subjected to weak but adiabatically slow fluctuations of external origin. Based on the ``adiabatic following'' approximation we carry out an expansion in \alpha/|\mu|, where \alpha is the strength of…
Using the damped pendulum system we introduce the averaging method to study the periodic solutions of a dynamical system with small perturbation. We provide sufficient conditions for the existence of periodic solutions with small amplitude…
We study the behaviour of discrete dynamical systems generated by a continuous map $f$ of a compact real interval into itself where at randomly chosen times a function different from $f$ - so called impulse function is applied. We show that…
Adiabatic invariants are introduced and shown to provide an approximate second integral of motion for the non-integrable Dicke model, in the energy region where the system exhibits a regular dynamics. This low-energy region is always…
The discrete-dipole approximation (DDA) is a flexible technique for computing scattering and absorption by targets of arbitrary geometry. In this paper we perform systematic study of various non-stationary iterative (conjugate gradient)…
We consider discrete, iterative load balancing via matchings on arbitrary graphs. Initially each node holds a certain number of tokens, defining the load of the node, and the objective is to redistribute the tokens such that eventually each…
We present a new adaptive algorithm for learning discrete distributions under distribution drift. In this setting, we observe a sequence of independent samples from a discrete distribution that is changing over time, and the goal is to…
This paper aims to improve existing results about using averaging method for analysis of dynamic systems on time scales. We obtain a more accurate estimate for proximity between solutions of original and averaged systems regarding…
This paper introduces a novel continuous-time dynamic average consensus algorithm for networks whose interaction is described by a strongly connected and weight-balanced directed graph. The proposed distributed algorithm allows agents to…
We give an introduction to discrete functional analysis techniques for stationary and transient diffusion equations. We show how these techniques are used to establish the convergence of various numerical schemes without assuming…