Chebyshev Polynomials in Distributed Consensus Applications

DOI10.1109/TSP.2012.2226173MaRDI QIDQ4578389zbMATH OpenFDO

Authors Eduardo Montijano, Carlos Sagues, J. I. Montijano

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1111.4825

Mathematics Subject Classification ID

Communication theory (94A05)

Abstract: In this paper we analyze the use of Chebyshev polynomials in distributed consensus applications. We study the properties of these polynomials to propose a distributed algorithm that reaches the consensus in a fast way. The algorithm is expressed in the form of a linear iteration and, at each step, the agents only require to transmit their current state to their neighbors. The difference with respect to previous approaches is that the update rule used by the network is based on the second order difference equation that describes the Chebyshev polynomials of first kind. As a consequence, we show that our algorithm achieves the consensus using far less iterations than other approaches. We characterize the main properties of the algorithm for both, fixed and switching communication topologies. The main contribution of the paper is the study of the properties of the Chebyshev polynomials in distributed consensus applications, proposing an algorithm that increases the convergence rate with respect to existing approaches. Theoretical results, as well as experiments with synthetic data, show the benefits using our algorithm.

Recommendations

• Polynomial Filtering for Fast Convergence in Distributed Consensus
• Chebyshev's approximation algorithms and applications
• Reaching consensus via polynomial stochastic operators: A general study
• On Chebyshev polynomials and their applications
• scientific article; zbMATH DE number 2049012
• Distributed algorithms for reaching consensus on general functions
• Accelerating the secure distributed computation of the mean by a Chebyshev expansion
• On the dynamic behaviour of Chebyshev polynomials
• scientific article; zbMATH DE number 1083099

Cited in

(7)

• A distributed algorithm for average consensus on strongly connected weighted digraphs
• The replica location problem and Chebyshev polynomials of the second kind
• Characterizing limits and opportunities in speeding up Markov chain mixing
• Fast distributed algebraic connectivity estimation in large scale networks
• Average consensus on strongly connected weighted digraphs: a generalized error bound
• Adopted spectral tau approach for the time-fractional diffusion equation via seventh-kind Chebyshev polynomials
• On \((\beta,\gamma)\)-Chebyshev functions and points of the interval

This page was built for publication: Chebyshev Polynomials in Distributed Consensus Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4578389)