首页> 外文会议>The Third International Workshop on Applied Matrix Theory(第三届国际矩阵分析与应用会议)论文集 >A Parallel Preconditioned Power Method for the Maximum Eigenvalue of Real Symmetric Matrices
【24h】

A Parallel Preconditioned Power Method for the Maximum Eigenvalue of Real Symmetric Matrices

机译:实对称矩阵最大特征值的并行预处理幂方法

获取原文

摘要

This paper presents the preconditioned method for parallel solution to the maximum eigenvalue of real symmetric matrices by the power method. It is based on the low complexity information transmission of the banded matrix satisfying some bandwidth condition. We reduce the large-scale real symmetric dense matrix to a banded matrix by parallel Householder transformation, then solve the maximum eigenvalue of the banded matrix by the power method. Finally, some numerical experiments on Lenovo ShenTeng 1800 cluster are shown for the different bandwidth matrices formed by matrix transformation. Comparing it with the calculation results by the power method without pretreatment ,it is shown that if the bandwidth is the widest under a bandwidth condition our method has the highest parallel efficiency.
机译:本文提出了一种用幂方法对实对称矩阵的最大特征值进行并行求解的预处理方法。它基于满足某些带宽条件的带状矩阵的低复杂度信息传输。通过并行Householder变换将大规模实对称密集矩阵简化为带状矩阵,然后通过幂方法求解带状矩阵的最大特征值。最后,对联想神腾1800集群进行了一些数值实验,研究了矩阵变换形成的不同带宽矩阵。将其与未经预处理的幂方法的计算结果进行比较,结果表明,在带宽条件下,如果带宽最大,则该方法的并行效率最高。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号