No label defined (Q3139322)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 434541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 434541 |
Statements
8 September 1994
0 references
parallel computation
0 references
interior point method
0 references
linear programming
0 references
preconditioned conjugate gradient approach
0 references
numerical results
0 references
0.8964780569076538
0 references
0.8762357831001282
0 references
0.850713849067688
0 references
0.8362286686897278
0 references
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].
0 references