Parallel algorithm for solving least-squares problems and its convergence analysis

被引：0

作者：

Chen, Zhong ^{[1
]}

机构：

[1] Jianghan Petroleum Institute, Jingzhou 434023, China

来源：

Jianghan Shiyou Xueyuan Xuebao/Journal of Jianghan Petroleum Institute | 2002年 / 24卷 / 01期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Based on the thought of Gauss-Seidel iteration, a parallel algorithm is proposed for solving the least-square problems, the method is proved to be convergent. The calculated amount is greatly reduced, thus calculating time is saved extensively when the method is used, because only triangle decomposition is needed for one of the submatrices of Matrix Jacobi and the decomposition is not needed for the whole Jacobi.

引用

页码：92 / 93