• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>ASME(American Society of Mechanical Engineers)/JSME Pressure Vessels and Piping Conference: Computational Technologies for Fluid/Thermal/Structural/Chemical Systems with Industrial Applications v.2; 20040725-20040729; San Diego,CA; US >SIMULTANEOUS SOLUTION ALGORITHMS FOR GAS-SOLID FLOWS: AN EFFICIENT PARALLEL LINE SOLVER
【24h】

SIMULTANEOUS SOLUTION ALGORITHMS FOR GAS-SOLID FLOWS: AN EFFICIENT PARALLEL LINE SOLVER

机译：气固两流同时求解算法：一种有效的并行线求解器

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A pointwise simultaneous solution algorithm based on dual time stepping was developed by De Wilde et al. (2002). With increasing grid aspect ratios, the efficiency of the point method quickly drops. Most realistic flow cases, however, require high grid aspect ratio grids, with the highest grid spacing in the streamwise direction. In this direction, the stiffness is efficiently removed by applying preconditioning (Weiss and Smith, 1995). In the direction perpendicular to the stream wise direction, stiffness remains because of the viscous and the acoustic terms. To resolve this problem, a line method is presented. All nodes in a plane perpendicular to the stream wise direction, a so-called line, are solved simultaneously. This allows a fully implicit treatment of the fluxes in the line, removing the stiffness in the line wise directions. Calculations with different grid aspect ratios are presented to investigate the convergence behavior of the line method. The line method presented is particularly suited for paral lelization. At each pseudo-time step, the lines (typically hundreds) can be solved independently of each other. The Message Passing Interface (MPI) standard (Snir et al., 1996) is used. The communication between the processors can be easily reduced by solving a block of lines per processor. The communication is then limited to information regarding only the outer lines of the block. In common practice, the number of lines is much higher than the number of processors available, In this region of the lines/processor space, the reduction of the calculation time is linear with the number of processors that is used.
机译：De Wilde等人开发了一种基于双重时间步长的逐点同时求解算法。 （2002）。随着网格长宽比的增加，点方法的效率迅速下降。但是，大多数实际的流动情况都需要高网格长宽比的网格，并且在流方向上网格间距最大。在这个方向上，通过应用预处理可以有效地去除刚度（Weiss和Smith，1995）。在垂直于水流方向的方向上，由于粘性和声学项而保持刚度。为了解决这个问题，提出了一种行方法。垂直于流向的平面（即所谓的线）中的所有节点将同时求解。这允许对线中的通量进行完全隐式处理，从而消除了线方向上的刚度。提出了具有不同网格纵横比的计算，以研究线法的收敛行为。提出的线路方法特别适用于部分合法化。在每个伪时间步骤中，可以相互独立地求解线（通常为数百条）。使用了消息传递接口（MPI）标准（Snir等，1996）。通过解决每个处理器的线路块，可以轻松减少处理器之间的通信。然后，将通信限于仅与块的外线有关的信息。在通常的实践中，行数比可用处理器数高得多。在行数/处理器空间的此区域中，计算时间的减少与所使用的处理器数成线性关系。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号