首页> 外文会议>AIAA Computational Fluid Dynamics Conference >A parallel Newton-Krylov flow solver for the Euler equations on multi-block grids
【24h】

A parallel Newton-Krylov flow solver for the Euler equations on multi-block grids

机译:用于多块网格上的欧拉方程的并联Newton-Krylov流程求解器

获取原文

摘要

We present a parallel Newton-Krylov algorithm for solving the three-dimensional Euler equations on multi-block structured meshes. The Euler equations are discretized on each block independently using second-order accurate summation-by-parts operators and scalar numerical dissipation. Boundary conditions are imposed and block interfaces are coupled using simultaneous approximation terms (SATs). The resulting discrete equations are solved iteratively using an inexact Newton method. At each Newton iteration, the linear system is solved inexactly using a Krylov subspace iterative method, and both additive Schwarz and approximate Schur preconditioners are considered. The algorithm is tested on the ONERA M6 wing. The results show that a discretization based on SATs is well suited to a parallel Newton-Krylov solution strategy, and that the approximate Schur preconditioner is more efficient than the Schwarz preconditioner in terms of CPU time and Krylov iterations, for both flow and adjoint solves.
机译:我们介绍了一种并联牛顿 - Krylov算法,用于求解多块结构网格上的三维欧拉方程。 euler方程独立地使用二阶精确求和符合零件运算符和标量数值耗散来离散地在每个块上离散化。施加边界条件并使用同时近似术语(SAT)耦合块接口。使用不适的牛顿方法迭代地解决了所得到的离散方程。在每个牛顿迭代时,线性系统使用Krylov子空间迭代方法解决,并且考虑了添加剂Schwarz和近似的逊群前提者。该算法在Onera M6翼上进行了测试。结果表明,基于SAT的离散化非常适合并行的牛顿 - Krylov解决方案策略,并且近似的逊群预议员在CPU时间和Krylov迭代方面比Schwarz预处理器更有效,这两个流程和伴随的迭代都是如此。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号