- Journal Home
- Volume 36 - 2024
- Volume 35 - 2024
- Volume 34 - 2023
- Volume 33 - 2023
- Volume 32 - 2022
- Volume 31 - 2022
- Volume 30 - 2021
- Volume 29 - 2021
- Volume 28 - 2020
- Volume 27 - 2020
- Volume 26 - 2019
- Volume 25 - 2019
- Volume 24 - 2018
- Volume 23 - 2018
- Volume 22 - 2017
- Volume 21 - 2017
- Volume 20 - 2016
- Volume 19 - 2016
- Volume 18 - 2015
- Volume 17 - 2015
- Volume 16 - 2014
- Volume 15 - 2014
- Volume 14 - 2013
- Volume 13 - 2013
- Volume 12 - 2012
- Volume 11 - 2012
- Volume 10 - 2011
- Volume 9 - 2011
- Volume 8 - 2010
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2009
- Volume 4 - 2008
- Volume 3 - 2008
- Volume 2 - 2007
- Volume 1 - 2006
Commun. Comput. Phys., 32 (2022), pp. 1287-1309.
Published online: 2023-01
Cited by
- BibTex
- RIS
- TXT
The iterative solution of the sequence of linear systems arising from three-temperature (3-T) energy equations is an essential component in the numerical simulation of radiative hydrodynamic (RHD) problem. However, due to the complicated application features of the RHD problems, solving 3-T linear systems with classical preconditioned iterative techniques is challenging. To address this difficulty, a physical-variable based coarsening two-level (PCTL) preconditioner has been proposed by dividing the fully coupled system into four individual easier-to-solve subsystems. Despite its nearly optimal complexity and robustness, the PCTL algorithm suffers from poor efficiency because of the overhead associated with the construction of setup phase and the solution of subsystems. Furthermore, the PCTL algorithm employs a fixed strategy for solving the sequence of 3-T linear systems, which completely ignores the dynamically and slowly changing features of these linear systems. To address these problems and to efficiently solve the sequence of 3-T linear systems, we propose an adaptive two-level preconditioner based on the PCTL algorithm, referred to as $α$Setup-PCTL. The adaptive strategies of the $α$Setup-PCTL algorithm are inspired by those of $α$Setup-AMG algorithm, which is an adaptive-setup-based AMG solver for sequence of sparse linear systems. The proposed $α$Setup-PCTL algorithm could adaptively employ the appropriate strategies for each linear system, and thus increase the overall efficiency. Numerical results demonstrate that, for 36 linear systems, the $α$Setup-PCTL algorithm achieves an average speedup of 2.2, and a maximum speedup of 4.2 when compared to the PCTL algorithm.
}, issn = {1991-7120}, doi = {https://doi.org/10.4208/cicp.OA-2022-0088}, url = {http://global-sci.org/intro/article_detail/cicp/21364.html} }The iterative solution of the sequence of linear systems arising from three-temperature (3-T) energy equations is an essential component in the numerical simulation of radiative hydrodynamic (RHD) problem. However, due to the complicated application features of the RHD problems, solving 3-T linear systems with classical preconditioned iterative techniques is challenging. To address this difficulty, a physical-variable based coarsening two-level (PCTL) preconditioner has been proposed by dividing the fully coupled system into four individual easier-to-solve subsystems. Despite its nearly optimal complexity and robustness, the PCTL algorithm suffers from poor efficiency because of the overhead associated with the construction of setup phase and the solution of subsystems. Furthermore, the PCTL algorithm employs a fixed strategy for solving the sequence of 3-T linear systems, which completely ignores the dynamically and slowly changing features of these linear systems. To address these problems and to efficiently solve the sequence of 3-T linear systems, we propose an adaptive two-level preconditioner based on the PCTL algorithm, referred to as $α$Setup-PCTL. The adaptive strategies of the $α$Setup-PCTL algorithm are inspired by those of $α$Setup-AMG algorithm, which is an adaptive-setup-based AMG solver for sequence of sparse linear systems. The proposed $α$Setup-PCTL algorithm could adaptively employ the appropriate strategies for each linear system, and thus increase the overall efficiency. Numerical results demonstrate that, for 36 linear systems, the $α$Setup-PCTL algorithm achieves an average speedup of 2.2, and a maximum speedup of 4.2 when compared to the PCTL algorithm.