Please use this identifier to cite or link to this item:
|Title:||Computational techniques and data structures of the sparse underdetermined systems with using graph theory|
|Authors:||Pilipchuk, L. A.|
Pilipchuk, A. S.
|Keywords:||ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математика|
|Citation:||Pilipchuk, L.A. Computational techniques and data structures of the sparse underdetermined systems with using graph theory / L.A., Pilipchuk, A.S. Pilipchuk // American Institute of Physics (AIP). AIP Conf. Proc. Vol. 1789, 060014 (2016); doi: 10.1063/1.4968506–7 p.|
|Abstract:||For constructing of the solutions of the sparse linear systems we propose effective methods, technologies and their implementation in Wolfram Mathematica. Sparse systems of these types appear in generalized network flow programming problems in the form of restrictions and can be characterized as systems with a large sparse sub-matrix representing the embedded network structure. In addition, such systems arise in estimating traffic in the generalized graph or multigraph on its unobservable part. For computing of each vector of the basis solution space with linear estimate in the worst case we propose effective algorithms and data structures in the case when a support of the multigraph or graph for the sparse systems contains a cycles.|
|Description:||Полный текст статьи: AIP Conference Proceedings 1789, 060014 (2016); http://doi.org/10.1063/1.4968506|
|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.