ESCI SJR: 0.249 SNIP: 0.434 CiteScore™: 0.7
ISSN 打印: 1940-2503
卷:卷 11, 2019 卷 10, 2018 卷 9, 2017 卷 8, 2016 卷 7, 2015 卷 6, 2014 卷 5, 2013 卷 4, 2012 卷 3, 2011 卷 2, 2010 卷 1, 2009
COMPUTATIONAL COMPLEXITY OF THE ALGORITHM FOR A 2D ADAPTIVE MESH REFINEMENT METHOD USING LID-DRIVEN CAVITY FLOWS
School of Computing and Mathematics, Charles Sturt University, Thurgoona, NSW2640, Australia
After successful accuracy and reliability verifications of the algorithm for a 2D adaptive mesh refinement method using exact and numerical benchmark results, we consider the computational complexity of this algorithm using 2D steady incompressible lid-driven cavity flows. The algorithm for the 2D adaptive mesh refinement method is proposed based on the qualitative theory of differential equations. The adaptive mesh refinement method performs mesh refinement based on the numerical solutions of Navier-Stokes equations solved by Navier2D, an open source vertex-centered finite volume code that uses the median dual mesh to form the control volumes about each vertex. We show the comparisons of the computational complexities between the algorithm of the adaptive mesh refinement method twice and the algorithm that uses uniform mesh with the same size of twice refined cells for Reynolds numbers 100, 1000, 2500. The adaptive mesh refinement method can be applied to find the accurate numerical solutions of any mathematical models containing continuity equations for incompressible fluid or steady-state fluid flows.
键词: computational complexity, adaptive mesh refinement, finite volume method, lid-driven cavity flow
|Begell Digital Portal||Begell 数字图书馆||电子图书||期刊||参考文献及会议录||研究收集|