Method for constructing general numerical simulation calculation grid data format based on CESE algorithm

Abstract

The invention provides a method for constructing a general numerical simulation calculation grid data format based on a CESE algorithm, and belongs to the technical field of numerical simulation. Firstly, the general grid data format is defined and used for storing geometric information of a grid, so that the geometric information is irrelevant to the dimension and the unit type of the grid; respectively defining the number of real grid units, the total number of all units, a grid unit data structure, a grid sub-unit data structure and a grid unit surface data structure; secondly, traditional grid data is converted into a new general format, a numerical simulation program suitable for the new data format is written, it is ensured that the new program can correctly process grids of different dimensions and types, and the accuracy of the new program is verified; the method does not depend on the specific shape and dimensionality of the grid, dimensionality and unit type information of the grid does not need to be stored, and the method can be suitable for computational grids of any dimensionality and unit type only by writing codes once.

Description

Technical Field

[0001] The present invention belongs to the technical field of numerical simulation, and in particular, relates to a method for constructing a universal numerical simulation calculation grid data format based on a CESE algorithm. Background Art

[0002] With the rapid development of computer science and technology, numerical simulation technology has been applied in more and more fields. The numerical simulation method is to discretize the equation (or set of equations) to be solved on the computational grid to obtain a discrete set of equations that is compatible with the original equation (or set of equations), and then use a computer to solve the discrete set of equations to obtain an approximate solution to the original equation (or set of equations).

[0003] Since discretization needs to be performed on the computational grid, the form of the discrete equations is usually closely related to the computational grid. If the computational grid uses different dimensions and different unit shapes, the equations obtained after discretization will also be different. Take the finite volume method commonly used in fluid mechanics numerical simulation as an example: when calculating the flux through the side of the grid unit, the one-dimensional unit is a straight line segment and its side is a point, so the calculation of the flux does not need to consider the size of the side; while the side of the two-dimensional unit is an edge, and the length of the edge needs to be considered when calculating the flux; similarly, the side of the three-dimensional unit is a plane, and the area of ​​the plane needs to be considered when calculating the flux. In this way, when designing numerical simulation algorithms and writing numerical simulation software, different algorithms need to be designed and different software needs to be written according to the different dimensions of the computational grid and the different grid units used. This greatly increases the workload of algorithm design and simulation software compilation. Summary of the invention

[0004] To solve the above problems, the present invention proposes a method for constructing a universal numerical simulation calculation grid data format based on the CESE algorithm, which is independent of the specific shape and dimension of the grid and converts the geometric information of all grids into a unified format.

[0005] The present invention is achieved through the following technical solutions:

[0006] A method for constructing a universal numerical simulation computing grid data format based on the CESE algorithm.

[0007] The method specifically comprises the following steps:

[0008] Step 1: Define a general mesh data format based on the CESE algorithm to store the geometric information of the mesh, making it independent of the dimension and cell type of the mesh;

[0009] Step 2: Convert the grid data, convert the traditional grid data into a new universal format;

[0010] Step 3: Build a simulation framework suitable for the new data format in step 2;

[0011] Write code to handle computations on mesh cells, subcells, and cell faces; implement time stepping and spatial discretization in the CESE algorithm; ensure the program can handle meshes of arbitrary dimensions and cell types;

[0012] Step 4: Test and verify. Select grids of different dimensions and types for testing to ensure that the new program can correctly handle grids of different dimensions and types. Compare the results with known solutions or traditional methods to verify its accuracy.

[0013] Step 5: Optimize the program based on the test results to improve efficiency and accuracy.

[0014] Furthermore, in step 1, specifically:

[0015] Define the number of real grid cells Nre and the total number of all cells Ne;

[0016] Define the data structure of the grid cell Element, including volume, center point coordinates and adjacent cell number groups;

[0017] Define the data structure of the grid sub-unit SubElement, including the volume of the sub-unit, the coordinates of the center point and the serial numbers of the two units that constitute the sub-unit;

[0018] Define the data structure of the mesh unit face Face, including the unit face area, center point coordinates, unit external normal vector components and adjacent mesh unit numbers.

[0019] Furthermore, in step 1, the general grid data format is defined as:

[0020]

[0021] Where Nse is the number of grid sub-elements and Nf is the data of the grid cell face.

[0022] Furthermore, in step 2, specifically:

[0023] Calculate the volume of each grid cell (Volume); determine the coordinates (X, Y, Z) of the center point of each grid cell; determine the adjacent cell number group of each grid cell;

[0024] Calculate the volume and center point coordinates of each subunit; determine which two units each subunit is composed of;

[0025] Calculate the area and center point coordinates of each unit face; determine the unit external normal vector of each unit face; determine the grid unit number adjacent to each unit face.

[0026] Furthermore, the definition of the grid unit Element is:

[0027]

[0028] The definition of grid sub-unit SubElement is:

[0029]

[0030] The mesh element face Face is defined as:

[0031]

[0032] Further, in step 3, the simulation framework includes a core computing module, an input and output module, and an interactive interface;

[0033] The input and output module is used to read network data, parse Element, SubElement and Face data structures, build a mesh data structure based on the parsed data, and output a simulation structure;

[0034] The core calculation module is used to write functions to calculate the volume of grid cells, the volume of sub-cells and the area of ​​cell faces, and implement the CESE algorithm;

[0035] The interactive interface is used for display, user interaction and control.

[0036] An electronic device comprises a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the above method when executing the computer program.

[0037] A computer-readable storage medium is used to store computer instructions, and when the computer instructions are executed by a processor, the steps of the above method are implemented.

[0038] Beneficial effects of the present invention

[0039] The present invention proposes a new universal grid data format suitable for the CESE method. Different from the traditional grid data recording format, the new format no longer needs to save the grid dimension and unit type information, but converts the grid geometry information into data such as area, coordinates and normal vectors. Independent of the specific shape and dimension of the grid, all grid geometry information (such as volume, area, coordinates, etc.) is converted into a unified format, and the same method can be used to process grids of any shape or dimension.

[0040] The advantages of the present invention over the existing methods are mainly reflected in two aspects:

[0041] First, the traditional grid data format requires different data storage formats for different dimensions and different unit types, and the organization structure of grid information is complicated. The new data format of the present invention uses the same grid information organization structure for grids of different dimensions and different unit types, thereby greatly simplifying the data structure of the grid and facilitating the reading and writing of grid data.

[0042] Secondly, when writing a numerical simulation program, the traditional grid data format requires writing corresponding calculation codes for various dimensions and grid unit types. The writing and debugging of the program is large and the development time is long. However, by adopting the new format proposed by the present invention, the code only needs to be written once, and it can be applied to the calculation grid of any dimension and unit type. In this way, the development speed of the numerical simulation program can be greatly accelerated and the development time can be saved. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] Figure 1 Schematic diagram of a two-dimensional unstructured triangular mesh in an embodiment of the present invention. DETAILED DESCRIPTION

[0044] The technical solutions in the embodiments of the present invention will be described clearly and completely below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0045] The experimental methods used in the following examples are conventional methods unless otherwise specified. The materials, reagents, methods and instruments used are conventional materials, reagents, methods and instruments in the art unless otherwise specified, and can be obtained through commercial channels by those skilled in the art.

[0046] Among all kinds of computational fluid dynamics methods, the Space-Time Conservation Elements and Solution Elements method (CESE method) is a type of high-precision finite volume method. This method discretizes the control equations in both space and time dimensions. It is a multidimensional algorithm with relatively high computational accuracy. Like the traditional finite volume method, this method uses an unstructured grid as the computational grid.

[0047] Unstructured grid data generally contains at least the following parts:

[0048] 1) The dimensions of the grid;

[0049] 2) The coordinates of all grid nodes, and the above node coordinates must be arranged in a certain order. Depending on the different dimensions, the number of parameters representing the node coordinates is also different: for a two-dimensional grid, each node requires two coordinate parameters; for a three-dimensional grid, each node requires three coordinate parameters;

[0050] 3) Type of grid cell;

[0051] 4) The composition of all grid cells.

[0052] However, when the CESE method is used for numerical simulation, the calculation program does not directly use the above unstructured grid data, but uses a transformed form of the above data.

[0053] Take the CESE method to solve the Euler equation as an example. The general form of the Euler equation is as follows:

[0054]

[0055] in,

[0056]

[0057] In the formula, ρ represents density, u, v, and w are the components of velocity in three directions, E represents total internal energy, and p represents pressure.

[0058] Therefore, on any grid cell, the formula for calculating the parameter value of the n+1th time layer by the CESE algorithm is:

[0059]

[0060] Where m is the number of mesh unit boundary surfaces and the number of sub-units. The number of mesh unit outer boundary surfaces is equal to the number of sub-units. i is the area of ​​the ith boundary surface, V i is the volume of the ith subunit, V is the volume of the entire grid unit, and satisfies:

[0061]

[0062] also,

[0063]

[0064] is the spatial unit external normal vector of the i-th boundary surface;

[0065]

[0066] is the parameter value at the center point of the i-th boundary surface, which is calculated by using the first-order Taylor series interpolation method to calculate the parameters of the n-th time layer (the parameters of the n-th time layer are known parameters) corresponding to the boundary surface; is the parameter value at the center point of the ith subunit, which is calculated by using the first-order Taylor series interpolation method to calculate the nth time layer parameter corresponding to the subunit; Δt is the time step.

[0067] It can be seen here that the geometric information used in the calculation formula includes: the volume of the grid unit, the number of sub-units and boundary surfaces, the volume of the sub-unit, the area of ​​the boundary surface, and the spatial distance between the sub-unit and the boundary surface unit and the known parameter point. Obviously, the specific type information of the grid unit is not required here. If the one-dimensional and two-dimensional coordinates are expanded to three dimensions (just set the values ​​of the extra dimensions to 0), then the calculation formulas for grids of different dimensions will also remain consistent in form (all in three-dimensional format).

[0068] From the above analysis, it can be seen that the geometric data information representing the grid unit can be converted into the above-mentioned abstract geometric data that is independent of the grid unit and dimension, and a numerical simulation algorithm can be constructed based on the above-mentioned geometric data. In this way, only one set of numerical simulation algorithms and calculation programs are needed to perform numerical simulation on the computational grid of any grid unit type and dimension, thereby greatly reducing the workload of constructing numerical simulation algorithms and writing programs.

[0069] Therefore, the present invention proposes a method for constructing a universal numerical simulation calculation grid data format based on the CESE algorithm, which is characterized by:

[0070] The method specifically comprises the following steps:

[0071] Step 1: Define a general mesh data format based on the CESE algorithm; that is, create a new data format to store the geometric information of the mesh, making it independent of the dimension and cell type of the mesh;

[0072] Define the number of real grid cells Nre and the total number of all cells Ne;

[0073] Define the data structure of the grid cell Element, including volume, center point coordinates and adjacent cell number groups;

[0074] Define the data structure of the grid sub-unit SubElement, including the volume of the sub-unit, the coordinates of the center point and the serial numbers of the two units that constitute the sub-unit;

[0075] Define the data structure of the mesh unit face Face, including the unit face area, center point coordinates, unit external normal vector components and adjacent mesh unit numbers.

[0076]

[0077] Nre is the number of real grid cells, and Ne is the total number of all cells including real grid cells and virtual grid cells. Here, real grid cells refer to grid cells located in the computational domain, and virtual grid cells refer to grid cells added outside the grid domain for additional calculations.

[0078] Element is a data structure of a grid cell (real grid cell and virtual grid cell), and is specifically defined as follows.

[0079] 1) Definition of grid cells

[0080]

[0081] Nse is the number of grid sub-units, and SubElement is the data structure of the grid sub-unit, which is specifically defined as follows.

[0082] 2) Definition of grid sub-units

[0083]

[0084] Nf is the data of the mesh unit face, and Face is the data structure of the mesh unit face, which is specifically defined as follows:

[0085] 3) Definition of mesh element surface

[0086]

[0087]

[0088] Taking a triangle unit and its adjacent units as an example, the parameters in the above data structure are explained in detail. Figure 1 As shown in the figure, the triangular unit is composed of points A, B, and C, and it has three adjacent units, namely triangles ABD, ACE, and BCF. Points O, P, Q, and R are the geometric center points of triangles ABC, ABD, ACE, and BCF, respectively. Each grid is divided into three subdomains according to its boundary edges. In the figure, triangle ABC is divided into three subdomains of triangles ABO, BCO, and CAO. The adjacent subdomains of adjacent grid units constitute a grid subunit. Figure 1 The quadrilateral AQBO is a grid sub-unit, which is composed of two sub-domains (triangle ABO and triangle ABQ). The boundary edge of the grid unit (for example: Figure 1 The line segment AB in the figure is a mesh element face.

[0089] Step 2: Convert mesh data. Convert the traditional mesh data into a new universal format.

[0090] Calculate the volume of each grid cell (Volume); determine the coordinates (X, Y, Z) of the center point of each grid cell; determine the adjacent cell number group of each grid cell;

[0091] Grid cell (Element): records the volume, center point coordinates and adjacent cell information of each grid cell.

[0092] Calculate the volume and center point coordinates of each subunit; determine which two units each subunit is composed of;

[0093] Grid sub-cell (SubElement): records the volume and center point coordinates of the part (sub-cell) shared by two grid cells.

[0094] Calculate the area and center point coordinates of each unit face; determine the unit external normal vector of each unit face; determine the grid unit number adjacent to each unit face.

[0095] Mesh cell face (Face): records the area, center point coordinates and adjacent cell information of the mesh cell face (such as edge or plane).

[0096] Step 3: Build a simulation framework suitable for the new data format in step 2;

[0097] Write code to handle computations on mesh cells, subcells, and cell faces; implement time stepping and spatial discretization in the CESE algorithm; ensure the program can handle meshes of arbitrary dimensions and cell types;

[0098] by Figure 1 Taking the grid in as an example, the meaning of each parameter in the grid unit, grid sub-unit and grid unit surface data structure is explained:

[0099] 1)Element data structure

[0100] Volume refers to the volume of the grid cell. For example Figure 1 For the grid cell triangle ABC, Volume is the area of ​​triangle ABC. Note: Figure 1 The grid is two-dimensional, so the volume of the grid cell actually refers to the area of ​​the grid cell. If it is a one-dimensional grid, the volume of the grid cell is actually the length of the grid cell. Only for a three-dimensional grid, Volume is the actual volume of the grid cell. However, no matter the length, area, or volume, it is a floating point number in terms of value. From the perspective of the data file, there is no difference between the three. X, Y, and Z are the coordinate components of the center point of the grid cell. For Figure 1For the triangle ABC unit, this is the coordinate of point O. Also, because triangle ABC is a two-dimensional unit, the center point has only two coordinates, X and Y, so it is necessary to assign Z a value of 0 to make up the three coordinates. Similarly, for a one-dimensional unit, both Y and Z need to be assigned a value of 0. N is the number of adjacent unit number groups. The following are adjacent unit number groups in groups of three. The number group is formed by connecting the center points of all adjacent units in pairs, taking the outer boundary of the formed geometric shape, and then the unit numbers connected to each outer boundary constitute a number group. For example Figure 1 In the figure, the adjacent unit centers of triangle ABC are points P, Q, and R, which form triangle PQR. The boundaries of the triangle are line segments PQ, QR, and PR, respectively. Therefore, the numbers of triangles ACE and ABD, triangles ABD and BCF, and triangles BCF and ACE form three groups of numbers. Figure 1 Because it is a two-dimensional grid, each number group has only two numbers, and the following number needs to be repeated once to form a number group of three numbers. If it is a one-dimensional grid, it needs to be repeated twice.

[0101] 2) SubElement data structure

[0102] Volume refers to the volume of the subunit. Figure 1 In the example, for the subunit AQBO, it refers to the area of ​​the quadrilateral AQBO. Similar to the grid unit, only for the three-dimensional unit, Volume is the actual volume, while for the two-dimensional unit, Volume is actually the area, and for the one-dimensional unit, it is actually the length. X, Y, and Z are the coordinate components of the center point of the subunit. For example, for the subunit AQBO, these three numbers are the coordinates of the geometric center of the quadrilateral AQBO. Similarly, for subunits less than three dimensions, it is necessary to assign 0 values ​​to the insufficient coordinate parameters to make up the three coordinates. Each subunit is composed of a subdomain of two units, and the El and Er parameters are the serial numbers of these two units.

[0103] 3) Face data structure

[0104] Area refers to the area of ​​the unit face. For two-dimensional units, the unit face is a line segment (for example, line segment AB is a unit face of unit ABC), which only has a length, so Area is actually the length of the boundary line segment. If it is a one-dimensional unit, the boundary is a point, and Area is directly assigned a value of 1. Only for three-dimensional units, Area is the real area. Similarly, for grids of different dimensions, the physical meaning of the unit face area is different, but they are all floating-point numbers, and there is no difference in the data format. X, Y, and Z are the coordinate components of the center point of the unit face, Nx, Ny, and Nz are the unit external normal vector components of the unit face, and El and Er are the serial numbers of the grid cells adjacent to the unit face. Note that the unit external normal vector needs to point from the El grid cell to the Er grid cell. As before, if the grid dimension is less than three dimensions, the missing components need to be filled.

[0105] From the above definition, it can be seen that there are neither grid dimension parameters nor grid cell type parameters in the computational grid data, that is, for computational grids of any dimension and cell type, the grid data is the same in form.

[0106] The simulation framework includes a core computing module, an input and output module, and an interactive interface;

[0107] The input and output module is used to read network data, parse Element, SubElement and Face data structures, build a mesh data structure based on the parsed data, and output a simulation structure;

[0108] The core calculation module is used to write functions to calculate the volume of grid cells, the volume of sub-cells and the area of ​​cell faces, and implement the CESE algorithm;

[0109] The interactive interface is used for display, user interaction and control.

[0110] Step 4: Test and verify. Select grids of different dimensions and types for testing to ensure that the new program can correctly handle grids of different dimensions and types. Compare the results with known solutions or traditional methods to verify its accuracy.

[0111] Step 5: Optimize the program based on the test results to improve efficiency and accuracy.

[0112] An electronic device comprises a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the above method when executing the computer program.

[0113] A computer-readable storage medium is used to store computer instructions, and when the computer instructions are executed by a processor, the steps of the above method are implemented.

[0114] The memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory, ROM, a programmable read-only memory, PROM, an erasable programmable read-only memory, EPROM, an electrically erasable programmable read-only memory, EEPROM, or a flash memory. The volatile memory may be a random access memory, RAM, which is used as an external cache. By way of example but not limitation, many forms of RAM are available, such as static random access memory static RAM, SRAM, dynamic random access memory dynamic RAM, DRAM, synchronous dynamic random access memory synchronous DRAM, SDRAM, double data rate synchronous dynamic random access memory double data rate SDRAM, DDR SDRAM, enhanced synchronous dynamic random access memory enhanced SDRAM, ESDRAM, synchronous link dynamic random access memory synchlink DRAM, SLDRAM, and direct memory bus random access memory direct rambus RAM, DR RAM. It should be noted that memory of the methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0115] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented by software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer instructions are loaded and executed on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from a website site, computer, server or data center through a wired method such as coaxial cable, optical fiber, digital subscriber line digital subscriber line, DSL or wireless such as infrared, wireless, microwave, etc. to another website site, computer, server or data center. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or data center that includes one or more available media integrated. The available medium can be a magnetic medium such as a floppy disk, a hard disk, a tape, an optical medium such as a high-density digital video disc digital video disc, DVD, or a semiconductor medium such as a solid state hard disk solid state disc, SSD, etc.

[0116] In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in a processor or an instruction in the form of software. The steps of the method disclosed in conjunction with the embodiment of the present application can be directly embodied as a hardware processor for execution, or a combination of hardware and software modules in a processor for execution. The software module can be located in a storage medium mature in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in a memory, and the processor reads the information in the memory and completes the steps of the above method in conjunction with its hardware. To avoid repetition, it is not described in detail here.

[0117] It should be noted that the processor in the embodiment of the present application can be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method embodiment can be completed by an integrated logic circuit of hardware in the processor or an instruction in the form of software. The above processor can be a general-purpose processor, a digital signal processor DSP, an application-specific integrated circuit ASIC, a field programmable gate array FPGA or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the embodiment of the present application can be directly embodied as a hardware decoding processor to perform, or the hardware and software modules in the decoding processor can be combined to perform. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in a memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0118] The above is a detailed introduction to the method for constructing a general numerical simulation calculation grid data format based on the CESE algorithm proposed in the present invention, and the principles and implementation methods of the present invention are explained. The description of the above embodiments is only used to help understand the method of the present invention and its core idea; at the same time, for general technical personnel in this field, according to the idea of ​​the present invention, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present invention.

Claims

1. A method for constructing a universal numerical simulation computing grid data format based on a CESE algorithm, characterized in that: The method specifically comprises the following steps: Step 1: Define a general mesh data format based on the CESE algorithm to store the geometric information of the mesh, making it independent of the dimension and cell type of the mesh; Step 2: Convert the grid data, convert the traditional grid data into a new universal format; Step 3: Build a simulation framework suitable for the new data format in step 2; Write code to handle computations on mesh cells, subcells, and cell faces; implement time stepping and spatial discretization in the CESE algorithm; ensure the program can handle meshes of arbitrary dimensions and cell types; Step 4: Test and verify. Select grids of different dimensions and types for testing to ensure that the new program can correctly handle grids of different dimensions and types. Compare the results with known solutions or traditional methods to verify its accuracy. Step 5: Optimize the program based on the test results to improve efficiency and accuracy.

2. The method according to claim 1, characterized in that: In step 1, specifically: Define the number of real grid cells Nre and the total number of all cells Ne; Define the data structure of the grid cell Element, including volume, center point coordinates and adjacent cell number groups; Define the data structure of the grid sub-unit SubElement, including the volume of the sub-unit, the coordinates of the center point and the serial numbers of the two units that constitute the sub-unit; Define the data structure of the mesh unit face Face, including the unit face area, center point coordinates, unit external normal vector components and adjacent mesh unit numbers.

3. The method according to claim 2, characterized in that: In step 1, the general grid data format is defined as: Where Nse is the number of grid sub-elements and Nf is the data of the grid cell face.

4. The method according to claim 3, characterized in that: In step 2, specifically: Calculate the volume of each grid cell (Volume); determine the coordinates (X, Y, Z) of the center point of each grid cell; determine the adjacent cell number group of each grid cell; Calculate the volume and center point coordinates of each subunit; determine which two units each subunit is composed of; Calculate the area and center point coordinates of each unit face; determine the unit external normal vector of each unit face; determine the grid unit number adjacent to each unit face.

5. The method according to claim 4, characterized in that: The definition of grid unit Element is: The definition of grid sub-unit SubElement is: The mesh element face Face is defined as:

6. The method according to claim 5, characterized in that: In step 3, the simulation framework includes a core computing module, an input and output module, and an interactive interface; The input and output module is used to read network data, parse Element, SubElement and Face data structures, build a mesh data structure based on the parsed data, and output a simulation structure; The core calculation module is used to write functions to calculate the volume of grid cells, the volume of sub-cells and the area of ​​cell faces, and implement the CESE algorithm; The interactive interface is used for display, user interaction and control.

7. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

8. A computer-readable storage medium for storing computer instructions, characterized in that: When the computer instructions are executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

Images