عنوان

Analysis of a Distributed Algorithm for Solving Linear Equations

Number

TLpq2467643961

.Language of Text, Soundtrack etc

انگلیسی

Title Proper

Analysis of a Distributed Algorithm for Solving Linear Equations

General Material Designation

[Thesis]

First Statement of Responsibility

Duru, Osman Mecnun

Subsequent Statement of Responsibility

Cihan, Onur

Name of Publisher, Distributor, etc.

Marmara Universitesi (Turkey)

Date of Publication, Distribution, etc.

2019

Specific Material Designation and Extent of Item

68

Dissertation or thesis details and type of degree

Master's

Body granting the degree

Marmara Universitesi (Turkey)

Text preceding or following the note

2019

Text of Note

Solving a linear equation system is one of the most known and important problems in science and engineering. Such systems have numerous applications such as forecasting, estimation and linear approaches to nonlinear equations. For the solution of these systems, several distributed algorithms have been proposed in the literature, which divide large linear equation systems into small pieces and enable them to be solved faster and more accurately than solving it by a centralized processor. The basic idea of these algorithms is to consider the system as a multi-agent network structure where the autonomous agents are physically separated from each other and communicate with their neighbors nearby. The network consists of multiple agents, each agent knows only a subset of the equation and therefore none can solve the overall equation individually. In order to overcome this issue, all agents must work cooperatively in a distributed way. Each agent i has a solution vector x_i (t) that takes values in R^n, and it is assumed that the only information that the agent receives from its neighbor j is its state vector. The aim of the thesis is to upgrade a well-known distributed algorithm in [1] for solving a linear algebraic equation and investigate its convergence rate. In this thesis, we consider a distributed algorithm and examine its convergence rate in networks with and without transmission delays. A new rapid method is proposed for both cases. Convergence rates of a well-known algorithm in the literature and the one proposed in this thesis are compared for un-delayed and delayed networks. Furthermore, the effect of weighting strategies on the convergence rate of the algorithm is investigated for several important network topologies as well and it is shown that for all topologies under consideration, the random walk method yields the fastest convergence for the example equation system.

Electrical engineering

Systems science

Cihan, Onur

Duru, Osman Mecnun

Electronic name

p

[Thesis]

276903

a

Y