- Journal Home
- Volume 37 - 2025
- 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., 37 (2025), pp. 137-170.
Published online: 2025-01
Cited by
- BibTex
- RIS
- TXT
We propose a kind of second-order stabilized Crank-Nicolson scheme which can be applied to three types of Cahn-Hilliard model with dynamic boundary conditions. We give the corresponding proof of stability and convergence theoretically which takes the reaction rate dependent dynamic boundary conditions as an example. We verify the effectiveness and universality of our proposed scheme by conducting some typical numerical simulations and comparing with the literature works. It’s found that second-order scheme takes much less CPU time than the first-order scheme to reach the same final time.
}, issn = {1991-7120}, doi = {https://doi.org/10.4208/cicp.OA-2022-0269}, url = {http://global-sci.org/intro/article_detail/cicp/23783.html} }We propose a kind of second-order stabilized Crank-Nicolson scheme which can be applied to three types of Cahn-Hilliard model with dynamic boundary conditions. We give the corresponding proof of stability and convergence theoretically which takes the reaction rate dependent dynamic boundary conditions as an example. We verify the effectiveness and universality of our proposed scheme by conducting some typical numerical simulations and comparing with the literature works. It’s found that second-order scheme takes much less CPU time than the first-order scheme to reach the same final time.