- 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., 35 (2024), pp. 973-1002.
Published online: 2024-05
Cited by
- BibTex
- RIS
- TXT
In this study, we apply first-order exponential time differencing (ETD) methods to solve benchmark problems for the diffuse-interface model using the Peng-Robinson equation of state. We demonstrate the unconditional stability of the proposed algorithm within the ETD framework. Additionally, we analyzed the complexity of the algorithm, revealing that computations like matrix multiplications and inversions in each time step exhibit complexity strictly less than $\mathcal{O}(n^2),$ where $n$ represents the number of variables or grid points. The main objective was to develop an algorithm with enhanced performance and robustness. To achieve this, we avoid iterative solutions (such as matrix inversion) in each time step, as they are sensitive to matrix properties. Instead, we adopted a hierarchical matrix ($\mathcal{H}$-matrix) approximation for the matrix inverse and matrix exponential used in each time step. By leveraging hierarchical matrices with a rank $k ≪ n,$ we achieve a complexity of $O(kn{\rm log}(n))$ for their product with an $n$-vector, which outperforms the traditional $\mathcal{O}(n^2)$ complexity. Overall, our focus is on creating an unconditionally stable algorithm with improved computational efficiency and reliability.
}, issn = {1991-7120}, doi = {https://doi.org/10.4208/cicp.OA-2023-0256}, url = {http://global-sci.org/intro/article_detail/cicp/23091.html} }In this study, we apply first-order exponential time differencing (ETD) methods to solve benchmark problems for the diffuse-interface model using the Peng-Robinson equation of state. We demonstrate the unconditional stability of the proposed algorithm within the ETD framework. Additionally, we analyzed the complexity of the algorithm, revealing that computations like matrix multiplications and inversions in each time step exhibit complexity strictly less than $\mathcal{O}(n^2),$ where $n$ represents the number of variables or grid points. The main objective was to develop an algorithm with enhanced performance and robustness. To achieve this, we avoid iterative solutions (such as matrix inversion) in each time step, as they are sensitive to matrix properties. Instead, we adopted a hierarchical matrix ($\mathcal{H}$-matrix) approximation for the matrix inverse and matrix exponential used in each time step. By leveraging hierarchical matrices with a rank $k ≪ n,$ we achieve a complexity of $O(kn{\rm log}(n))$ for their product with an $n$-vector, which outperforms the traditional $\mathcal{O}(n^2)$ complexity. Overall, our focus is on creating an unconditionally stable algorithm with improved computational efficiency and reliability.