Direct multiplicative methods for sparse matrices. Linear programming

Direct multiplicative methods for sparse matrices. Linear programming

Multiplicative methods for sparse matrices are best suited to reduce the complexity of operations solving systems of linear equations performed on each iteration of the simplex method. The matrix of constraints in these problems of sparsely populated nonzero elements, which allows to obtain the mult...

Full description

Bibliographic Details
Main Author: Anastasiya Borisovna Sviridenko
Format: Article
Language:Russian
Published: Institute of Computer Science 2017-04-01
Series:Компьютерные исследования и моделирование
Subjects:
numerically stable direct multiplicative method
linear programming
the storage format of sparse matrices
parallel execution of matrix operations without unpacking
minimizing fill the main lines of multipliers
sparse matrices
Online Access:http://crm.ics.org.ru/uploads/crmissues/crm_2017_2/2017_02_02.pdf

Internet

http://crm.ics.org.ru/uploads/crmissues/crm_2017_2/2017_02_02.pdf

Similar Items