首页> 外文期刊>Journal of Computational Physics >A fast and robust computational method for the ionization cross sections of the driven Schrodinger equation using an O(N) multigrid-based scheme
【24h】

A fast and robust computational method for the ionization cross sections of the driven Schrodinger equation using an O(N) multigrid-based scheme

机译:使用基于O(N)多重网格的方法对驱动的薛定inger方程的电离截面进行快速且鲁棒的计算方法

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

摘要

This paper improves the convergence and robustness of a multigrid-based solver for the cross sections of the driven Schrodinger equation. Adding a Coupled Channel Correction Step (CCCS) after each multigrid (MG) V-cycle efficiently removes the errors that remain after the V-cycle sweep. The combined iterative solution scheme (MG-CCCS) is shown to feature significantly improved convergence rates over the classical MG method at energies where bound states dominate the solution, resulting in a fast and scalable solution method for the complex-valued Schrodinger break-up problem for any energy regime. The proposed solver displays optimal scaling; a solution is found in a time that is linear in the number of unknowns. The method is validated on a 2D Temkin-Poet model problem, and convergence results both as a solver and preconditioner are provided to support the O(N) scalability of the method. This paper extends the applicability of the complex contour approach for far field map computation (Cools et al. (2014) [10]). (C) 2015 Elsevier Inc. All rights reserved.
机译:本文针对驱动的薛定inger方程的横截面,提高了基于多重网格的求解器的收敛性和鲁棒性。在每个多重网格(MG)V周期之后添加一个耦合通道校正步骤(CCCS),可以有效地消除在V周期扫描之后残留的误差。结合迭代解方案(MG-CCCS)在能量上以束缚态主导解的能量表现出比经典MG方法显着提高的收敛速度,从而为复值Schrodinger分解问题提供了一种快速且可扩展的解决方法对于任何能源制度。建议的求解器显示最佳缩放比例;在未知数线性的时间内找到了一个解。该方法在二维Temkin-Poet模型问题上得到了验证,并提供了作为求解器和预处理器的收敛结果,以支持该方法的O(N)可伸缩性。本文扩展了复杂轮廓方法在远场地图计算中的适用性(Cools等人(2014)[10])。 (C)2015 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号