A distributed algorithm based on multi-agent network for solving linear algebraic equation

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a distributed discrete-time consensus algorithm based on multi-agent network to solve large-scale linear algebraic equation (LAE). The matrix in the LAE is divided into submatrices by the columns. Each agent in the network only has its own local data on the LAE and all the agents collaboratively find the solutions while they communicate with their neighbors. Based on the Lyapunov method for difference equation, the multi-agent network is analyzed to reach consensus at the solutions under some mild conditions. Compared with existing algorithms for LAE, the proposed algorithm is capable of solving large-scale distributed LAE problems with fixed step size.

Cite

CITATION STYLE

APA

Liu, Q., Xiong, J., Zhong, J., Ying, H., & Li, K. (2018). A distributed algorithm based on multi-agent network for solving linear algebraic equation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10878 LNCS, pp. 415–422). Springer Verlag. https://doi.org/10.1007/978-3-319-92537-0_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free