scientific article; zbMATH DE number 434541

From MaRDI portal
Publication:3139322





The speedup of the interior point method for linear programming, comes from solving the positive definite system of linear normal equations (1) \((A^ T D^ 2_ k A)dx= c\), where \(D_ k=\text{diag } d_ i\). In this paper one describes a simple parallel preconditioned conjugate gradient approach for solving system (1). Some numerical results on an 8CPU INMOS Transputer system are described. For the entire collection see [Zbl 0772.00024].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139322)