Multiscale high-order/low-order (HOLO) algorithms and applications

详细信息    查看全文

• 作者：L. Chacó ; n^a ; ^{chacon@lanl.gov} ; G. Chen^a ; D.A. Knoll^a ; C. Newman^a ; H. Park^a ; W. Taitano^a ; J.A. Willert^b ; G. Womeldorff^a
• 关键词：High-order/low-order ; HOLO ; Multiscale algorithms ; Implicit timestepping ; Communication avoiding algorithms
• 刊名：Journal of Computational Physics
• 出版年：2017
• 出版时间：1 February 2017
• 年：2017
• 卷：330
• 期：Complete
• 页码：21-45
• 全文大小：2201 K
• 卷排序：330

文摘

We review the state of the art in the formulation, implementation, and performance of so-called high-order/low-order (HOLO) algorithms for challenging multiscale problems. HOLO algorithms attempt to couple one or several high-complexity physical models (the high-order model, HO) with low-complexity ones (the low-order model, LO). The primary goal of HOLO algorithms is to achieve nonlinear convergence between HO and LO components while minimizing memory footprint and managing the computational complexity in a practical manner. Key to the HOLO approach is the use of the LO representations to address temporal stiffness, effectively accelerating the convergence of the HO/LO coupled system. The HOLO approach is broadly underpinned by the concept of nonlinear elimination, which enables segregation of the HO and LO components in ways that can effectively use heterogeneous architectures. The accuracy and efficiency benefits of HOLO algorithms are demonstrated with specific applications to radiation transport, gas dynamics, plasmas (both Eulerian and Lagrangian formulations), and ocean modeling. Across this broad application spectrum, HOLO algorithms achieve significant accuracy improvements at a fraction of the cost compared to conventional approaches. It follows that HOLO algorithms hold significant potential for high-fidelity system scale multiscale simulations leveraging exascale computing.