Geodesic
Computation of linear algebraic equations with solvability verification over multi-agent networks
Kybernetika, Tome 53 (2017) no. 5, pp. 803-819 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

In this paper, we consider the problem of solving a linear algebraic equation $Ax=b$ in a distributed way by a multi-agent system with a solvability verification requirement. In the problem formulation, each agent knows a few columns of $A$, different from the previous results with assuming that each agent knows a few rows of $A$ and $b$. Then, a distributed continuous-time algorithm is proposed for solving the linear algebraic equation from a distributed constrained optimization viewpoint. The algorithm is proved to have two properties: firstly, the algorithm converges to a least squares solution of the linear algebraic equation with any initial condition; secondly, each agent in the algorithm knows the solvability property of the linear algebraic equation, that is, each agent knows whether the obtained least squares solution is an exact solution or not.
In this paper, we consider the problem of solving a linear algebraic equation $Ax=b$ in a distributed way by a multi-agent system with a solvability verification requirement. In the problem formulation, each agent knows a few columns of $A$, different from the previous results with assuming that each agent knows a few rows of $A$ and $b$. Then, a distributed continuous-time algorithm is proposed for solving the linear algebraic equation from a distributed constrained optimization viewpoint. The algorithm is proved to have two properties: firstly, the algorithm converges to a least squares solution of the linear algebraic equation with any initial condition; secondly, each agent in the algorithm knows the solvability property of the linear algebraic equation, that is, each agent knows whether the obtained least squares solution is an exact solution or not.
DOI : 10.14736/kyb-2017-5-0803
Classification : 15A06, 93D20
Keywords: multi-agent network; distributed optimization; linear algebraic equation; least squares solution; solvability verification 
@article{10_14736_kyb_2017_5_0803,
     author = {Zeng, Xianlin and Cao, Kai},
     title = {Computation of linear algebraic equations with solvability verification over multi-agent networks},
     journal = {Kybernetika},
     pages = {803--819},
     year = {2017},
     volume = {53},
     number = {5},
     doi = {10.14736/kyb-2017-5-0803},
     mrnumber = {3750104},
     zbl = {06861625},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.14736/kyb-2017-5-0803/}
}
TY  - JOUR
AU  - Zeng, Xianlin
AU  - Cao, Kai
TI  - Computation of linear algebraic equations with solvability verification over multi-agent networks
JO  - Kybernetika
PY  - 2017
SP  - 803
EP  - 819
VL  - 53
IS  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.14736/kyb-2017-5-0803/
DO  - 10.14736/kyb-2017-5-0803
LA  - en
ID  - 10_14736_kyb_2017_5_0803
ER  - 
%0 Journal Article
%A Zeng, Xianlin
%A Cao, Kai
%T Computation of linear algebraic equations with solvability verification over multi-agent networks
%J Kybernetika
%D 2017
%P 803-819
%V 53
%N 5
%U http://geodesic.mathdoc.fr/articles/10.14736/kyb-2017-5-0803/
%R 10.14736/kyb-2017-5-0803
%G en
%F 10_14736_kyb_2017_5_0803
Zeng, Xianlin; Cao, Kai. Computation of linear algebraic equations with solvability verification over multi-agent networks. Kybernetika, Tome 53 (2017) no. 5, pp. 803-819. doi: 10.14736/kyb-2017-5-0803

Cité par Sources :