...
首页> 外文期刊>SIAM Journal on Scientific Computing >A hierarchical 3-D direct Helmholtz solver by domain decomposition and modified Fourier method
【24h】

A hierarchical 3-D direct Helmholtz solver by domain decomposition and modified Fourier method

机译:区域分解和改进傅里叶方法的分层3-D直接亥姆霍兹求解器

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

摘要

The paper contains a noniterative solver for the Helmholtz and the modified Helmholtz equations in a hexahedron. The solver is based on domain decomposition. The solution domain is divided into mostly parallelepiped subdomains. In each subdomain a particular solution of the nonhomogeneous Helmholtz equation is first computed by a fast spectral 3-D method which was developed in our earlier papers ( see, for example, SIAM J. Sci. Comput., 20 ( 1999), pp. 2237 - 2260). This method is based on the application of the discrete Fourier transform accompanied by a subtraction technique. For high accuracy the subdomain boundary conditions must be compatible with the specified inhomogeneous right-hand side at the edges of all the interfaces. In the following steps the partial solutions are hierarchically matched. At each step pairs of adjacent subdomains are merged into larger units. The paper describes in detail the matching algorithm for two boxes which is a basis for the domain decomposition scheme. The hierarchical approach is convenient for parallelization and can minimize the global communication. The algorithm requires O(N-3 log N) operations, where N is the number of grid points in each direction.
机译:本文包含六面体中Helmholtz的非迭代求解器和修改后的Helmholtz方程。求解器基于域分解。解决方案域主要分为平行六面体子域。在每个子域中,首先通过快速光谱3-D方法计算非均质Helmholtz方程的特定解,该方法在我们较早的论文中得到了发展(例如,参见SIAM J. Sci。Comput。,20(1999),pp。 2237-2260)。该方法基于离散傅里叶变换和减法技术的应用。为了获得高精度,子域边界条件必须与所有接口边缘处指定的不均匀右侧兼容。在以下步骤中,部分解决方案将进行层次匹配。在每个步骤中,相邻子域对将合并为更大的单元。本文详细描述了两个盒子的匹配算法,这是域分解方案的基础。分层方法便于并行化,并且可以最小化全局通信。该算法需要O(N-3 log N)个运算,其中N是每个方向上的网格点数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号