Please use this identifier to cite or link to this item:
|Title:||Solution of large linear systems with embedded network structure for a non-homogeneous network flow programming problem|
|Authors:||Pilipchuk, L. A.|
Vecharynski, E. S.
Pesheva, Y. H.
|Keywords:||ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математика|
|Citation:||Pilipchuk, L.A. Solution of Large Linear Systems with Embedded Network Structure for a Non-Homogeneous Network Flow Programming Problem / L.A. Pilipchuk, E.S. Vecharynski, Y.H. Pesheva // Mathematica Balkanica. New Series. – 2008. – Vol. 22, Fasc. 3-4. – P. 235-254.|
|Abstract:||In the paper we consider the linear underdetermined system of a special type is considered. Systems of this type appear in non-homogeneous network flow programming problems in the form of systems of constraints and can be characterized as systems with a large sparse submatrix representing the embedded network structure. A direct method for finding solutions of the system is developed. The algorithm is based on the theoretic-graph specificities for the structure of the support and properties of the basis of a solution space of a homogeneous system. One of the key steps is decomposition of the system. A simple example is regarded at the end of the paper.|
|Appears in Collections:||Статьи факультета прикладной математики и информатики|
Files in This Item:
|PLA_SolutionOfLargeSystems.pdf||181,79 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.