Please use this identifier to cite or link to this item:
https://elib.bsu.by/handle/123456789/10094| Title: | Theoretical-graph approach for research of the sparse linear underdetermined systems to the Sensor Location Problem |
| Authors: | Pilipchuk, L. A. Pesheva, Y. H. Vishnevetskaya, T. S. |
| Keywords: | ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математика |
| Issue Date: | 2011 |
| Citation: | Pilipchuk, L.A. Theoretical-graph approach for research of the sparse linear underdetermined systems to the Sensor Location Problem / L.A. Pilipchuk, Y.H. Pesheva, T.S. Vishnevetskaya // American Institute of Physics (AIP). AIP Conf. Proc. 1410. – 2011. – 339-345. |
| Abstract: | We consider algorithms decomposition for solving sparse linear systems with embedded network structure. We investigate this problem on the base of theoretical-graph specificity of the structure of the support and of properties of the base of the solution space. One of applications of the given approach is the Sensor Location Problem (SLP), that is the location of the minimum number of sensors in the nodes of the network, in order to determine the arcs flow volume and nodes with variable intensities for all the network. |
| Description: | Полный текст статьи можно найти по адресу: http://proceedings.aip.org/resource/2/apcpcs/1410/1/339_1?isAuthorized=no |
| URI: | http://elib.bsu.by/handle/123456789/10094 |
| Appears in Collections: | Статьи факультета прикладной математики и информатики |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.