Homemath.DSarXiv:2605.29451

Linear stability analysis of the Lloyd algorithm on a circle

math.DSmath.OC2026-05v1license

Abstract

Lloyd algorithm is the standard iterative method for computing quantizers and codebooks in source coding and vector quantization. In this article, we study the dynamical and stability properties of the Lloyd map on the unit circle S1\mathbb S^1 using von Mises distributions. We construct the Lloyd iteration as a discrete dynamical system on the configuration space of ordered point sets modulo rotational symmetry. Also, we study the rotational equivarience of the Lloyd map. Further, we derive an explicit representation of the Jacobian matrix and prove that it possesses a circulant structure for the equally spaced configuration. Also, we study the bifurcation characteristics based on Lloyd map analysis. In the end, we provide the numerical algorithms for stability diagrams, Lyapunov spectrum estimation, and residue analysis, purely for empirical visualization. Our results provide a dynamical systems framework for Lloyd quantization on S1\mathbb S^1 for studying stability properties.

Comments: 20 pages

Cite

@article{arxiv.2605.29451,
  title  = {Linear stability analysis of the Lloyd algorithm on a circle},
  author = {Silpi Saha and Sangita Jha and Mrinal Kanti Roychowdhury},
  journal= {arXiv preprint arXiv:2605.29451},
  year   = {2026}
}