Abstract
In [2], a distributed algorithm has recently been developed for solving linear algebraic equations via multi-agent networks. To adopt the algorithm, each agent only has to know part of the linear equation as well as its nearby neighbors' estimates to the solution. In this paper, we would like to further discuss this algorithm from the following two perspectives. The first one is to improve the numerical stability of the algorithm and meanwhile eliminate initialization step that is necessary in [2]. The second one is to achieve a specific solution with minimum l 2 norm when the linear equation has more than one solutions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
