• 论文 • 上一篇    下一篇

线性规划算法并行特征剖析

赵凤治   

  1. 中国科学院计算中心
  • 出版日期:1992-02-20 发布日期:1992-02-20

赵凤治. 线性规划算法并行特征剖析[J]. 数值计算与计算机应用, 1992, 13(2): 131-138.

A PARALLEL CHARACTERISTICS ANALYSIS OF LINEAR PROGRAMMING ALGORITHM

  1. Zhao Feng-zhi Computing Center, Academia Sinica
  • Online:1992-02-20 Published:1992-02-20
由于并行计算机的出现,并行算法的研究已事在必行。该领域的工作,目前大体上可归为4类:从事算法思想的研究,如同步并行、异步并行等;构造并行算法,在各个科技计算分支上都或有所见,其中基本代数运算更有基础意义;改造已有算法,使之具有更高的
In this paper we analyze the parallel characteristics of the simplex method, Karmarkarmethod and Dantzig-wolge decomposition principle withe the scheduling method for parallelrealization of the three methods and construction of new parallel algorithms for linear pro-gramming.
()

[1] 赵凤治,线性规划计算方法,科学出版社,1981。
[2] N. Karmarkar, A New polynomial-time algorithm for linear programming, Combinalorica 4(4) (1984) .
[3] 席少霖,赵凤治,最优化计算方法,上海科技出版社,1983。
[4] 陈景良,并行数值方法,清华大学出版社,1983。
[5] J. M. Ortega, Introduction to parallel and vector solution of linear systems. Plemum publishing Corporation. 233 Spring strect. New York.
[6] A. V. Goldberg. S. A. Plotkin, D B. Shmoys, E. Tardos. Interior-point methods in parallel computation,Report No. STAN-CS-89-1259, Department of Computer science, Stanford University, Stanford, California 94305(1989) .
No related articles found!
阅读次数
全文


摘要