复兴AMLI-cycle:从切比雪夫多项式到动量加速
Rejuvenating AMLI-Cycle: From Chebyshev Polynomials to Momentum Acceleration
AI总结:
本文研究AMLI-cycle方法,一方面基于切比雪夫多项式建立其一致收敛理论以简化实现、降低成本,另一方面提出动量加速AMLI-cycle,无需特征值或收敛率估计即可保证一致条件数,经理论与实验验证其性能与切比雪夫版本相当。
摘要:
本文研究AMLI-cycle方法并作出两项贡献。首先,我们利用切比雪夫多项式重新审视AMLI-cycle,在两层网格方法一致收敛的假设下建立了其一致收敛理论。这免去了在所有粗网格层估计极端特征值的需求,仅需估计两层网格的收敛率,且该估计可在次粗网格层完成,简化了实现流程并降低了大规模问题的计算成本。其次,我们利用动量加速中的多项式提出了动量加速AMLI-cycle。这种新方法无需估计极端特征值或两层网格收敛率即可保证一致的条件数,使其实现过程与标准多重网格方法一样简便。我们证明,当采用二次动量加速多项式时,该方法的渐近性能与使用切比雪夫多项式的AMLI-cycle相当。数值实验证实了动量加速AMLI-cycle在各类问题中的鲁棒性与效率,其性能与基于切比雪夫的AMLI-cycle相当。这些结果验证了动量加速AMLI-cycle的理论优势与实际效用。
英文摘要:
In this paper, we investigate the AMLI-cycle method and make two contributions. First, we revisit the AMLI-cycle using the Chebyshev polynomials and establish a theory for its uniform convergence, assuming the two-grid method converges uniformly. This removes the need for estimating extreme eigenvalues at all coarse levels. Only an estimation of the two-grid convergence rate is needed, which could be done on the second coarsest level, simplifying implementation and reducing computational costs for large-scale problems. Second, we introduce a momentum-accelerated AMLI-cycle using polynomials from momentum accelerations. This novel approach ensures a uniform condition number without requiring extreme eigenvalue or two-grid convergence rate estimations, making its implementation as straightforward as standard multigrid methods. We prove that it is asymptotically as good as the AMLI-cycle using the Chebyshev polynomials when the quadratic momentum-accelerated polynomials is used. Numerical experiments confirm the robustness and efficiency of the momentum-accelerated AMLI-cycle across various problems, demonstrating performance comparable to the Chebyshev-based AMLI-cycle. These findings validate the theoretical advantages and practical efficacy of the momentum-accelerated AMLI-cycle.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。