QSGS_2D.rar_LBM多孔介质_LBM多孔介质_QSGS_2D_show8yg_随机介质

共1个文件

cpp：1个

版权申诉

5星 · 超过95%的资源 92 浏览量 2022-07-14 05:35:57 上传评论 4 收藏 1KB RAR 举报

标题中的“QSGS_2D.rar_LBM 多孔介质_LBM多孔介质_QSGS_2D_show8yg_随机介质”指的是一个使用Lattice Boltzmann Method（LBM）模拟多孔介质的程序，其中QSGS是Quantized Stochastic Geometrical Structure的缩写，2D表示二维空间，show8yg可能是作者或项目的标识，而“随机介质”则表明程序用于生成具有随机结构的多孔材料。 Lattice Boltzmann Method（LBM）是一种基于统计力学的数值方法，常用于流体动力学模拟，包括流体在复杂几何环境如多孔介质中的流动。LBM的基本思想是通过离散速度模型将连续的Boltzmann方程简化为在固定网格上的迭代过程，以此来模拟流体的运动。在多孔介质中，流体流动受到孔隙结构的强烈影响，因此需要能够模拟这些复杂几何特性的工具。QSGS算法是一种四参数模型，它允许用户根据需求调整生成的多孔结构的特性，如孔隙率、连通性、分布等。这种随机生成的方法可以有效地模拟真实世界中的多孔材料，如岩石、土壤或生物组织，对于研究流体在这些材料中的渗透、扩散等现象非常有价值。描述中提到的“c++”表明该程序是用C++编程语言编写的，这是一种常用的、高效的编程语言，特别适合于实现科学计算和高性能应用。QSGS_2D.cpp是压缩包内的源代码文件，它是实现QSGS算法的主体部分，包含了数据结构定义、算法逻辑以及可能的输入输出处理等。在实际应用中，用户可能需要通过修改或扩展这个C++程序来适应特定的多孔介质模型和流体流动问题。例如，可能需要调整QSGS算法的参数以匹配特定的物理条件，或者集成额外的边界条件和流体动力学模型。此外，为了进行可视化和数据分析，程序可能还需要与其他工具（如ParaView、Matlab等）进行接口。这个程序提供了一种强大的工具，能够帮助研究人员和工程师在二维空间内模拟和理解多孔介质中的流体行为，对于地质工程、环境科学、能源储存等领域有着重要的应用价值。通过深入理解和使用提供的C++源代码，用户可以进一步定制和优化这一模拟过程，以适应他们的具体研究需求。

资源详情

资源评论

资源推荐

收起资源包目录

QSGS_2D.rar （1个子文件）

QSGS_2D.cpp 6KB

/// \file GSGS.cpp /// \reference Wang, M., Wang, J., Pan, N., & Chen, S. (2007). /// Mesoscopic predictions of the effective thermal conductivity for microscale random porous media. /// Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 75(3), 1每10. /// https://doi.org/10.1103/PhysRevE.75.036702 /// /// #include <iostream> #include <stdlib.h> #include <time.h> #include <string> #include <fstream> using namespace std; const float phi = 0.1; const float p_cd = 0.05; const float z = 0.05, f = 0.0125; const float p_d1 = z, p_d2 = z, p_d3 = z, p_d4 = z; const float p_d5 = f, p_d6 = f, p_d7 = f, p_d8 = f; const int N = 300; int Solid[N][N]; int Grow_Times = 0; /// No solid in the beginning. void init() { for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { Solid[i][j] = 0; } } } /// \brief Grow in eight directions. /// /// Grow directions ///***** 6 2 5 ***** ///***** ***** ///***** 3 C 1 ***** ///***** ***** ///***** 7 4 8 ***** /// void grow() { Grow_Times += 1; cout << "Grow Times: " << Grow_Times << endl; int Solid_p[N][N]; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { Solid_p[i][j] = Solid[i][j]; } } cout << "Copy compeleted" << endl; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { if (i == 0) { if (j == 0) { if (Solid[i][j] == 1) { if ((rand() / double(RAND_MAX)) < p_d1) Solid_p[i + 1][j] = 1; if ((rand() / double(RAND_MAX)) < p_d2) Solid_p[i][j + 1] = 1; if ((rand() / double(RAND_MAX)) < p_d5) Solid_p[i + 1][j + 1] = 1; } } else if (j == N - 1) { if (Solid[i][j] == 1) { if ((rand() / double(RAND_MAX)) < p_d1) Solid_p[i + 1][j] = 1; if ((rand() / double(RAND_MAX)) < p_d4) Solid_p[i][j - 1] = 1; if ((rand() / double(RAND_MAX)) < p_d8) Solid_p[i + 1][j - 1] = 1; } } else { if (Solid[i][j] == 1) { if ((rand() / double(RAND_MAX)) < p_d1) Solid_p[i + 1][j] = 1; if ((rand() / double(RAND_MAX)) < p_d2) Solid_p[i][j + 1] = 1; if ((rand() / double(RAND_MAX)) < p_d4) Solid_p[i][j - 1] = 1; if ((rand() / double(RAND_MAX)) < p_d5) Solid_p[i + 1][j + 1] = 1; if ((rand() / double(RAND_MAX)) < p_d8) Solid_p[i + 1][j - 1] = 1; } } } else if (i == N - 1) { if (j == 0) { if (Solid[i][j] == 1) { if ((rand() / double(RAND_MAX)) < p_d2) Solid_p[i][j + 1] = 1; if ((rand() / double(RAND_MAX)) < p_d3) Solid_p[i - 1][j] = 1; if ((rand() / double(RAND_MAX)) < p_d6) Solid_p[i - 1][j + 1] = 1; } } else if (j == N - 1) { if (Solid[i][j] == 1) { if ((rand() / double(RAND_MAX)) < p_d3) Solid_p[i - 1][j] = 1; if ((rand() / double(RAND_MAX)) < p_d4) Solid_p[i][j - 1] = 1; if ((rand() / double(RAND_MAX)) < p_d7) Solid_p[i - 1][j - 1] = 1; } } else { if (Solid[i][j] == 1) { if ((rand() / double(RAND_MAX)) < p_d2) Solid_p[i][j + 1] = 1; if ((rand() / double(RAND_MAX)) < p_d3) Solid_p[i - 1][j] = 1; if ((rand() / double(RAND_MAX)) < p_d4) Solid_p[i][j - 1] = 1; if ((rand() / double(RAND_MAX)) < p_d6) Solid_p[i - 1][j + 1] = 1; if ((rand() / double(RAND_MAX)) < p_d7) Solid_p[i - 1][j - 1] = 1; } } } else { if (j == 0) { if (Solid[i][j] == 1) { if ((rand() / double(RAND_MAX)) < p_d1) Solid_p[i + 1][j] = 1; if ((rand() / double(RAND_MAX)) < p_d2) Solid_p[i][j + 1] = 1; if ((rand() / double(RAND_MAX)) < p_d3) Solid_p[i - 1][j] = 1; if ((rand() / double(RAND_MAX)) < p_d5) Solid_p[i + 1][j + 1] = 1; if ((rand() / double(RAND_MAX)) < p_d6) Solid_p[i - 1][j + 1] = 1; } } else if (j == N - 1) { if (Solid[i][j] == 1) { if ((rand() / double(RAND_MAX)) < p_d1) Solid_p[i + 1][j] = 1; if ((rand() / double(RAND_MAX)) < p_d3) Solid_p[i - 1][j] = 1; if ((rand() / double(RAND_MAX)) < p_d4) Solid_p[i][j - 1] = 1; if ((rand() / double(RAND_MAX)) < p_d7) Solid_p[i - 1][j - 1] = 1; if ((rand() / double(RAND_MAX)) < p_d8) Solid_p[i + 1][j - 1] = 1; } } else { if (Solid[i][j] == 1) { if ((rand() / double(RAND_MAX)) < p_d1) Solid_p[i + 1][j] = 1; if ((rand() / double(RAND_MAX)) < p_d2) Solid_p[i][j + 1] = 1; if ((rand() / double(RAND_MAX)) < p_d3) Solid_p[i - 1][j] = 1; if ((rand() / double(RAND_MAX)) < p_d4) Solid_p[i][j - 1] = 1; if ((rand() / double(RAND_MAX)) < p_d5) Solid_p[i + 1][j + 1] = 1; if ((rand() / double(RAND_MAX)) < p_d6) Solid_p[i - 1][j + 1] = 1; if ((rand() / double(RAND_MAX)) < p_d7) Solid_p[i - 1][j - 1] = 1; if ((rand() / double(RAND_MAX)) < p_d8) Solid_p[i + 1][j - 1] = 1; } } } } } cout << "Neighbor produced" << endl; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { Solid[i][j] = Solid_p[i][j]; } } cout << "One time grow compeleted" << endl; } int main() { float phi_p; /// Produce random seed srand((unsigned)time(NULL)); cout << "Produce random seed completed" <<endl; /// Initialization init(); cout << "Initialization completed" << endl; /// Produce growth core for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { if ((rand() / double(RAND_MAX)) < p_cd) { Solid[i][j] = 1; } } } cout << "Produce growth core completed" << endl; /// Produce process do { grow(); /// Calculate porosity float t_temp = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { t_temp += Solid[i][j]; } } phi_p = t_temp / (N * N); cout << phi_p << endl; } while (phi_p < phi); cout << "Grow completed" << endl; /// Output result ofstream outfile; string filename; filename = "porous.out"; outfile.open(filename); for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { outfile << Solid[i][j] << " "; } outfile << endl; } outfile.close(); cout << "Output result completed" << endl; system("pause"); return 0; }