This is the authors' abstract. We don't add key points for this paper.
We provide an example proving that there exists no quadratic Lyapunov function for a certain class of linear agreement/consensus algorithms, a fact that had been numerically verified in . We also briefly discuss sufficient conditions for the existence of such a Lyapunov function.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Olshevsky et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: