Solving linear algebraic equations with limited computational power and network bandwidth

Shenyu Liu*, Sonia Martinez

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

摘要

This work introduces a distributed algorithm for finding least squares (LS) solutions of linear algebraic equations (LAEs). Unlike the methods studied in the literature, we assume that our distributed algorithm has limited computation power and network bandwidth, in the sense that each agent can only solve small-scale LAEs and the group of agents can only exchange messages of small size at a time. Our algorithm contains two layers of nested loops. A part of the solution is updated by a consensus algorithm in the inner loop, while an scheduling sequence in the outer loop decides which part of the solution to be updated. By appealing to the alternating projection theorem, we prove convergence of the proposed algorithm when the scheduling sequence is both spanning and periodic. The accuracy of our algorithm is verified through a numerical example.

源语言英语
文章编号106008
期刊Systems and Control Letters
196
DOI
出版状态已出版 - 2月 2025

指纹

探究 'Solving linear algebraic equations with limited computational power and network bandwidth' 的科研主题。它们共同构成独一无二的指纹。

引用此

Liu, S., & Martinez, S. (2025). Solving linear algebraic equations with limited computational power and network bandwidth. Systems and Control Letters, 196, 文章 106008. https://doi.org/10.1016/j.sysconle.2024.106008