首页> 外文期刊>Numerical linear algebra with applications >A direct Schur-Fourier decomposition for the efficient solution of high-order Poisson equations on loosely coupled parallel computers
【24h】

A direct Schur-Fourier decomposition for the efficient solution of high-order Poisson equations on loosely coupled parallel computers

机译:松耦合并行计算机上高阶泊松方程有效解的直接Schur-Fourier分解

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

摘要

In this paper a parallel direct Schur-Fourier decomposition (DSFD) algorithm for the direct solution of arbitrary order discrete Poisson equations on parallel computers is proposed. It is based on a combination of a Direct Schur method and a Fourier decomposition and allows to solve each Poisson equation almost to machine accuracy using only one communication episode. Thus, it is well suited for loosely Coupled parallel computers, that have a high network latency compared with the CPU performance. Several three-dimensional direct numerical simulations (DNS) of wall-bounded turbulent incompressible flows have been carried out using the DSFD algorithm. Numerical examples illustrating the robustness and scalability of the method on a PC cluster with a conventional 100 Mbits/s network are also presented. Copyright (C) 2005 John Wiley & Sons, Ltd.
机译:针对并行计算机上任意阶离散泊松方程的直接解,提出了一种并行直接舒尔-傅里叶分解(DSFD)算法。它基于Direct Schur方法和傅立叶分解的组合,并且仅使用一个通讯事件就可以求解每个Poisson方程,几乎达到机器精度。因此,它非常适合与CPU性能相比具有较高网络延迟的松散耦合并行计算机。使用DSFD算法对壁面湍流不可压缩流进行了多个三维直接数值模拟(DNS)。数值示例说明了该方法在具有常规100 Mbit / s网络的PC群集上的鲁棒性和可扩展性。版权所有(C)2005 John Wiley&Sons,Ltd.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号