Abstract
This study proposes an algorithm capable of working in parallel for solving variable statistics with large and sparse linear equations under given right hand side ranges. A comparative study to the direct linear programming method is conducted under a main central processor and up to four parallel processors. The studied results are reported computationally and discussed. Moreover, the approach can be adapted for the system under domain decompositions structure leading to a better efficiency experimentally in a case example.
Acknowledgements
The author would like to express his sincere appreciations to all reviewers. The final version of this manuscript has been drastically improved by their critical comments and recommendations.