Theoretical-graph approach for research of the sparse linear underdetermined systems to the Sensor Location Problem

被引:2
|
作者
Pilipchuk, L. A. [1 ]
Pesheva, Y. H. [2 ]
Vishnevetskaya, T. S. [1 ]
机构
[1] Belarusian State Univ, Minsk 220050, BELARUS
[2] Tech Univ Sofia, Sofia, Bulgaria
关键词
Sparse linear system; underdetermined system; basis of the solution space of a homogeneous sparse linear system; network support; decomposition of a support; forest of trees; characteristic vector; variable intensity; Sensor Location Problem;
D O I
10.1063/1.3664387
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页数:7
相关论文
共 50 条