首页> 外文期刊>Numerical Heat Transfer, Part B. Fundamentals: An International Journal of Computation and Methodology >A direct Schur-Fourier decomposition for the solution of the three-dimensional Poisson equation of incompressible flow problems using loosely coupled parallel computers
【24h】

A direct Schur-Fourier decomposition for the solution of the three-dimensional Poisson equation of incompressible flow problems using loosely coupled parallel computers

机译:使用松散耦合并行计算机对不可压缩流动问题的三维Poisson方程进行直接Schur-Fourier分解

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

摘要

Parallel computers based on PC-class hardware (Beowulf clusters) provide a matchless computing power per cost unit. However, their network performance tends to be too low for standard parallel computational fluid dynamics (CFD) algorithms. A relevant example is the solution of the Poisson equations. The subject of this article is a direct Schur-Fourier decomposition (DSFD) algorithm that, for certain three-dimensional flows, produces an accurate solution of each Poisson equation with just one message, providing speed-ups of at least 24 in a low-cost PC cluster with a conventional network and 36 processors. Direct Numerical Simulation (DNS) of turbulent natural convection flow is used as a benchmark problem. [References: 35]
机译:基于PC级硬件的并行计算机(Beowulf群集)可为每个成本单位提供无与伦比的计算能力。但是,对于标准的并行计算流体动力学(CFD)算法,它们的网络性能往往太低。一个相关的例子是泊松方程的解。本文的主题是一种直接的Schur-Fourier分解(DSFD)算法,对于某些三维流,仅需一条消息即可产生每个泊松方程的精确解,在低速情况下至少可提速24次。具有传统网络和36个处理器的PC集群。湍流自然对流的直接数值模拟(DNS)被用作基准问题。 [参考:35]

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号