应用科学学报 ›› 2004, Vol. 22 ›› Issue (4): 549-552.

• 论文 • 上一篇    下一篇

一个基于QR分解的并行原-对偶内点算法

陈政洪, 郁松年   

  1. 上海大学计算机工程与科学学院 上海 200072
  • 收稿日期:2003-07-10 修回日期:2003-09-15 出版日期:2004-12-31 发布日期:2004-12-31
  • 作者简介:陈政洪(1975-),男,浙江绍兴人,硕士生.
  • 基金资助:
    上海市科委自然科学基金(00JC14052);上海市教委(网格技术-E研究院)资助项目

A Parallel Primal-Dual Interior Point Algorithm Based on the QR Decomposition

CHEN Zheng-hong, YU Song-nian   

  1. School of Computer Engineering and Science, Shanghai University, Shanghai 200072, China
  • Received:2003-07-10 Revised:2003-09-15 Online:2004-12-31 Published:2004-12-31

摘要: 首先介绍了原-对偶内点算法的主要计算步骤,阐明哪一步上可以进行并行化处理.接着介绍QR分解的理论,及如何利用QR分解并行求解线性方程组.最后提出了一种基于QR分解的并行内点算法,并给出了实验结果.

关键词: 并行, 原-对偶内点算法

Abstract: This paper first describes the steps involved in primal-dual interior point algorithm and explains which step in it can be parallelized. Next the theory of the QR decomposition is also detailed. It also points out how to use the QR decomposition to solve the linear simultaneous equations parallelly. In conclusion, it proposes a parallel primal-dual interior point algorithm based on the QR decomposition and lists some test results.

Key words: parallelism, primal-dual interior point algorithm

中图分类号: