عنوان
پدید آورنده
موضوع
رده
کتابخانه
محل استقرار
شماره کتابشناسی ملی
شماره
TL54595
زبان اثر
زبان متن نوشتاري يا گفتاري و مانند آن
انگلیسی
عنوان و نام پديدآور
عنوان اصلي
Analysis of a Distributed Algorithm for Solving Linear Equations
نام عام مواد
[Thesis]
نام نخستين پديدآور
Duru, Osman Mecnun
نام ساير پديدآوران
Cihan, Onur
وضعیت نشر و پخش و غیره
نام ناشر، پخش کننده و غيره
Marmara Universitesi (Turkey)
تاریخ نشرو بخش و غیره
2019
يادداشت کلی
متن يادداشت
68 p.
یادداشتهای مربوط به پایان نامه ها
جزئيات پايان نامه و نوع درجه آن
Master's
کسي که مدرک را اعطا کرده
Marmara Universitesi (Turkey)
امتياز متن
2019
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
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
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )
مستند نام اشخاص تاييد نشده
Duru, Osman Mecnun
نام شخص - ( مسئولیت معنوی درجه دوم )
مستند نام اشخاص تاييد نشده
Cihan, Onur
شناسه افزوده (تنالگان)
مستند نام تنالگان تاييد نشده
Marmara Universitesi (Turkey)
دسترسی و محل الکترونیکی
نام الکترونيکي
مطالعه متن کتاب وضعیت انتشار
فرمت انتشار
p
اطلاعات رکورد کتابشناسی
نوع ماده
[Thesis]
کد کاربرگه
276903
اطلاعات دسترسی رکورد
سطح دسترسي
a
تكميل شده
Y
