首页> 外文会议>International Conference on Computer Science and Information Processing;CSIP 2012 >Parallel decoupling algorithm for solving the block tri-diagonal linear equations
【24h】

Parallel decoupling algorithm for solving the block tri-diagonal linear equations

机译:解块三对角线性方程组的并行解耦算法

获取原文
获取原文并翻译 | 示例

摘要

In this paper, the parallel decoupling algorithm is given to solve the block tri-diagonal linear equations. The solution process of the algorithm are as follows: Firstly, decoupling method is used to decompose the huge block tri-diagonal linear equations to even number small block tri-diagonal ones with balancing loadings, and sum of the small blocks tri-diagonal linear equations equals the number of processors in the cluster that are composed of multiple computers. Secondly, the parallel computing model of the single program multiple data is employed to solve each small blocks tri-diagonal linear equations by the pursuit method in each processor. Lastly, the main processor collects the results from different processors and calculates the final solution of the large block tri-diagonal linear equations.
机译:本文给出了并行解耦算法来求解块三对角线性方程组。该算法的求解过程如下:首先,采用解耦方法将巨大的块三对角线性方程分解为偶数个具有平衡载荷的小块三对角线性方程,并将小块的三对角线性方程求和等于群集中由多台计算机组成的处理器的数量。其次,采用单程序多数据并行计算模型,通过每个处理器中的追踪方法求解每个小块的三对角线性方程组。最后,主处理器从不同的处理器收集结果,并计算大块三对角线性方程的最终解。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号