首页> 外文期刊>Parallel Computing >A fast parallel algorithm for solving block-tridiagonal systems of linear equations including the domain decomposition method
【24h】

A fast parallel algorithm for solving block-tridiagonal systems of linear equations including the domain decomposition method

机译:求解线性方程组的对角线对角线系统的快速并行算法,包括域分解方法

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

摘要

In this study, we develop a new parallel algorithm for solving systems of linear algebraic equations with the same block-tridiagonal matrix but with different right-hand sides. The method is a generalization of the parallel dichotomy algorithm for solving systems of linear equations with tridiagonal matrices [1]. Using this approach, we propose a parallel realization of the domain decomposition method (the Schur complement method). The calculation of acoustic wave fields using the spectral-difference technique improves the efficiency of the parallel algorithms. A near-linear dependence of the speedup with the number of processors is attained using both several and several thousands of processors. This study is innovative because the parallel algorithm developed for solving block-tridiagonal systems of equations is an effective and simple set of procedures for solving engineering tasks on a supercomputer.
机译:在这项研究中,我们开发了一种新的并行算法,用于求解具有相同块三对角矩阵但右侧不同的线性代数方程组。该方法是并行二分法算法的推广,用于求解具有三对角矩阵的线性方程组[1]。使用这种方法,我们提出了域分解方法(舒尔补数法)的并行实现。使用谱差技术计算声波场可以提高并行算法的效率。使用数以千计的处理器,都可以达到加速与处理器数量的线性关系。这项研究具有创新性,因为为求解方程组的块对角线方程组而开发的并行算法是解决超级计算机上工程任务的一套有效且简单的过程。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号