scholarly journals On the convergence rate of the fraction of simple algebras

2020 ◽  
Vol 81 (4) ◽  
Author(s):  
Florian Aichinger

AbstractWe provide an improved lower bound for the convergence rate of the fraction of simple algebras using combinatorial arguments.

2011 ◽  
Vol 81 (2) ◽  
pp. 175-180
Author(s):  
Alexandra Babenko ◽  
Eduard Belitser
Keyword(s):  

Author(s):  
Hamidreza Tavafoghi Jahromi ◽  
Mohammad Haeri

This paper considers flocking to the virtual leader in network of agents with double-integrator. A locally linear algorithm is employed which guarantees exponential flocking to the virtual leader. A lower bound for flocking rate is calculated which is independent of the initial conditions. Simulations are provided to validate the result and it is shown that the calculated rate is not over bound the actual convergence rate. The effect of coefficients of algorithm is investigated and it is shown that the similar results can be inferred from the calculated formula for the convergence rate.


Nonlinearity ◽  
2021 ◽  
Vol 35 (2) ◽  
pp. 998-1035
Author(s):  
Evan Camrud ◽  
David P Herzog ◽  
Gabriel Stoltz ◽  
Maria Gordina

Abstract Convergence to equilibrium of underdamped Langevin dynamics is studied under general assumptions on the potential U allowing for singularities. By modifying the direct approach to convergence in L 2 pioneered by Hérau and developed by Dolbeault et al, we show that the dynamics converges exponentially fast to equilibrium in the topologies L 2(dμ) and L 2(W* dμ), where μ denotes the invariant probability measure and W* is a suitable Lyapunov weight. In both norms, we make precise how the exponential convergence rate depends on the friction parameter γ in Langevin dynamics, by providing a lower bound scaling as min(γ, γ −1). The results hold for usual polynomial-type potentials as well as potentials with singularities such as those arising from pairwise Lennard-Jones interactions between particles.


Sign in / Sign up

Export Citation Format

Share Document