A Sharp Bound on the s-Energy and Its Applications to Averaging Systems
Author(s): Chazelle, Bernard
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1cj99
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chazelle, Bernard | - |
dc.date.accessioned | 2021-10-08T19:45:56Z | - |
dc.date.available | 2021-10-08T19:45:56Z | - |
dc.date.issued | 2019-10 | en_US |
dc.identifier.citation | Chazelle, Bernard. "A Sharp Bound on the s-Energy and Its Applications to Averaging Systems." IEEE Transactions on Automatic Control 64, no. 10 (2019): pp. 4385-4390. doi:10.1109/TAC.2019.2899509 | en_US |
dc.identifier.issn | 0018-9286 | - |
dc.identifier.uri | https://arxiv.org/pdf/1802.01207.pdf | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr1cj99 | - |
dc.description.abstract | The s-energy is a generating function of wide applicability in network-based dynamics. We derive an (essentially) optimal bound of (3/ρs) n-1 on the s-energy of an n-agent symmetric averaging system, for any positive real s ≤ 1, where ρ is a lower bound on the nonzero weights. This is done by introducing the new dynamics of twist systems. We show how to use the new bound on the s-energy to tighten the convergence rates of systems in opinion dynamics, flocking, and synchronization. | en_US |
dc.format.extent | 4385 - 4390 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | IEEE Transactions on Automatic Control | en_US |
dc.rights | Author's manuscript | en_US |
dc.title | A Sharp Bound on the s-Energy and Its Applications to Averaging Systems | en_US |
dc.type | Journal Article | en_US |
dc.identifier.doi | 10.1109/TAC.2019.2899509 | - |
dc.identifier.eissn | 1558-2523 | - |
pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
SharpBoundAveragingSystems.pdf | 459.04 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.