A method, device, equipment and storage medium for processing grid flow field

Abstract

The present application discloses a method, device, equipment and storage medium for processing a grid flow field, and relates to the technical field of computational fluid dynamics. In the method, additional processing is performed on grid cells at the boundary, and the processing device sequentially expands at least two layers of auxiliary grid cell sets to adjacent areas adjacent to the sub-areas along the boundaries of the sub-areas, so that for the grid cells at the boundary, these grid cells are adjacent to the auxiliary grid cells in the auxiliary grid cell set, and the intermediate increments and update amounts of the flow field solutions of the auxiliary grid cells are updated in real time and are not set to 0 by default. In the process of calculating the grid cells at the boundary, the processing device uses the latest increments of the flow field solutions of the adjacent grid cells, so that the number of iterations of the calculation process can be reduced, the convergence process can be accelerated, and the processing efficiency can be improved.

Description

Technical Field

[0001] The present application relates to the field of computational fluid dynamics technology, and in particular to a method, device, equipment and storage medium for processing a grid flow field. Background Art

[0002] Computational fluid dynamics (CFD) technology is an important means of studying engineering and scientific problems, and has a wide range of applications in both military and civilian fields. For example, simulation calculations of flow states of high-speed aircraft, aerodynamic heating of reentry vehicles, aerodynamic states of aircraft takeoff, landing, and cruising, movement of cars, and the impact of wind on bridges. Computational aerodynamics is an important branch of computational fluid dynamics, which is characterized by the significant compressibility of fluid media and a variety of physical and chemical phenomena. At present, many general CFD analysis software for aerodynamics have been developed.

[0003] The implicit LU-SGS (lower-upper Symmetric Gauss-Seidel Relaxation) algorithm, which is widely used in this type of CFD engineering software, is a high-precision and high-efficiency solution method. It has the advantages of unconditional stability and ensuring matrix diagonal dominance. At the same time, it is easy to expand the adaptability of unsteady calculations. Therefore, it is most widely used in computational aerodynamic flow simulation.

[0004] The implicit LU-SGS algorithm has strong data dependence, that is, the processing of the latter step depends on the processing result of the previous step, and parallel processing cannot be achieved. Therefore, the grid can be divided into regions for separate processing.

[0005] However, in the process of processing each region separately, the increment of the flow field solution of the grid unit at the boundary of adjacent regions is defaulted to 0, and the boundary of adjacent regions becomes Jacobi iteration, which will reduce the implicit acceleration effect and reduce the convergence efficiency. It can be seen that the traditional processing solution has the problem of low processing efficiency. Summary of the invention

[0006] The present application provides a grid flow field processing method, device, equipment and storage medium, which can improve processing efficiency.

[0007] In order to achieve the above objectives, this application adopts the following technical solutions:

[0008] In a first aspect, the present application provides a method for processing a grid flow field, the method comprising:

[0009] Divide the grid to be processed into multiple non-overlapping sub-areas;

[0010] Extending at least two layers of auxiliary grid unit sets in sequence along the boundary of the sub-region to adjacent regions adjacent to the sub-region, wherein the first layer of auxiliary grid unit sets is adjacent to the boundary of the sub-region and is located outside the sub-region;

[0011] For each sub-region:

[0012] Determine the first target grid unit in order of the calculation numbers of the grid units in the sub-area from small to large; determine the intermediate increment of the flow field solution of the first target grid unit according to the intermediate increment of the flow field solution of the first assisting grid unit, wherein the first assisting grid unit is adjacent to the first target grid unit and the calculation number of the first assisting grid unit is smaller than the calculation number of the first target grid unit;

[0013] Determine the second target grid unit in order of the calculation numbers of the auxiliary grid units corresponding to the sub-areas from small to large; determine the intermediate increment of the flow field solution of the second target grid unit according to the intermediate increment of the flow field solution of the second auxiliary grid unit; the second auxiliary grid unit is adjacent to the second target grid unit and the calculation number of the second auxiliary grid unit is smaller than the calculation number of the second target grid unit;

[0014] Determine the third target grid unit in descending order of the calculation numbers of the auxiliary grid units corresponding to the sub-areas; determine the update amount of the flow field solution of the third target grid unit according to the intermediate increment of the flow field solution of the third target grid unit and the update amount of the flow field solution of the third assisting grid unit; the third assisting grid unit is adjacent to the third target grid unit and the calculation number of the third assisting grid unit is greater than the calculation number of the third target grid unit;

[0015] Determine the fourth target grid unit in descending order of the calculation numbers of the grid units in the sub-area; determine the update amount of the flow field solution of the fourth target grid unit according to the intermediate increment of the flow field solution of the fourth target grid unit and the update amount of the flow field solution of the fourth assisting grid unit; the fourth assisting grid unit is adjacent to the fourth target grid unit and the calculation number of the fourth assisting grid unit is greater than the calculation number of the fourth target grid unit;

[0016] If the update amount of the flow field solution of the fourth target grid unit is less than a preset update amount threshold, determining the converged flow field solution of the fourth target grid unit according to the previous iterative flow field solution of the fourth target grid unit and the update amount of the flow field solution of the fourth target grid unit;

[0017] The convergent flow field solutions of the grid cells in each sub-region are merged to obtain the convergent flow field solution of the grid to be processed.

[0018] In some possible implementations, dividing the to-be-processed grid into a plurality of non-overlapping sub-regions includes:

[0019] Mapping the to-be-processed grid into a grid undirected graph, wherein the nodes of the grid undirected graph represent grid units;

[0020] According to the connection degree of the nodes in the grid undirected graph, the grid to be processed is divided into a plurality of non-overlapping sub-areas.

[0021] In some possible implementations, the method further includes:

[0022] According to the connection degree of the nodes in the grid undirected graph, the global number of each grid unit in the grid to be processed is determined.

[0023] In some possible implementations, the method further includes:

[0024] For each sub-region, the calculation number of the grid unit in the sub-region is determined according to the global number of the grid unit in the sub-region.

[0025] In some possible implementations, the method further includes:

[0026] Assign a region number to each sub-region;

[0027] For each auxiliary grid unit set, determining a calculation number of each auxiliary grid unit in the auxiliary grid unit set according to an area number of an area where the auxiliary grid unit set is located and a global number of the auxiliary grid units in the auxiliary grid unit set;

[0028] Among them, in terms of arrangement order, the maximum value of the calculation number of the grid unit in the sub-area is less than the minimum value of the calculation number of the auxiliary grid unit corresponding to the sub-area, and the maximum value of the calculation number of the grid unit in the sub-area is adjacent to the minimum value of the calculation number of the auxiliary grid unit corresponding to the sub-area.

[0029] In some possible implementations, determining the global number of each grid unit in the grid to be processed according to the connectivity of the nodes in the grid undirected graph includes:

[0030] Determine a target node with the smallest connection degree in the grid undirected graph;

[0031] Starting from the target node, the nodes in the grid undirected graph are sorted in sequence;

[0032] According to the order of the nodes in the grid undirected graph, the global number of each grid unit in the grid to be processed is determined.

[0033] In some possible implementations, the number of layers of the auxiliary grid unit set is greater than or equal to 3 layers.

[0034] In a second aspect, the present application provides a grid flow field processing device, the device comprising:

[0035] A partitioning module is used to divide the grid to be processed into multiple non-overlapping sub-regions;

[0036] An expansion module, used to expand at least two layers of auxiliary grid unit sets along the boundary of the sub-region to adjacent regions adjacent to the sub-region in sequence, wherein the first layer of auxiliary grid unit sets is adjacent to the boundary of the sub-region and is located outside the sub-region;

[0037] A processing module is used for each sub-region:

[0038] Determine the first target grid unit in the order of the calculation numbers of the grid units in the sub-area from small to large; determine the intermediate increment of the flow field solution of the first target grid unit according to the intermediate increment of the flow field solution of the first assisting grid unit, wherein the first assisting grid unit is adjacent to the first target grid unit and the calculation number of the first assisting grid unit is smaller than the calculation number of the first target grid unit; determine the second target grid unit in the order of the calculation numbers of the auxiliary grid units corresponding to the sub-area from small to large; determine the intermediate increment of the flow field solution of the second target grid unit according to the intermediate increment of the flow field solution of the second assisting grid unit; the second assisting grid unit is adjacent to the second target grid unit and the calculation number of the second assisting grid unit is smaller than the calculation number of the second target grid unit; determine the third target grid unit in the order of the calculation numbers of the auxiliary grid units corresponding to the sub-area from large to small; update the flow field solution of the third target grid unit according to the intermediate increment and the flow field solution of the third assisting grid unit The method comprises the following steps: determining an update amount of the flow field solution of the third target grid unit according to an intermediate increment of the flow field solution of the fourth target grid unit and an update amount of the flow field solution of the fourth assisting grid unit; determining an update amount of the flow field solution of the fourth target grid unit according to an intermediate increment of the flow field solution of the fourth target grid unit and an update amount of the flow field solution of the fourth assisting grid unit; the fourth assisting grid unit is adjacent to the fourth target grid unit and the calculation number of the fourth assisting grid unit is greater than the calculation number of the fourth target grid unit; if the update amount of the flow field solution of the fourth target grid unit is less than a preset update amount threshold, determining a convergent flow field solution of the fourth target grid unit according to a previous iterative flow field solution of the fourth target grid unit and an update amount of the flow field solution of the fourth target grid unit; and merging the convergent flow field solutions of the grid units in each sub-region to obtain a convergent flow field solution of the grid to be processed.

[0039] In a third aspect, the present application provides a computing device, including a memory and a processor;

[0040] One or more computer programs are stored in the memory, and the one or more computer programs include instructions; when the instructions are executed by the processor, the computing device executes the method as described in any one of the first aspects.

[0041] In a fourth aspect, the present application provides a computer-readable storage medium, wherein the computer-readable storage medium is used to store a computer program, and the computer program is used to execute the method as described in any one of the first aspects.

[0042] It can be seen from the above technical solution that the present application has at least the following beneficial effects:

[0043] The present application provides a method for processing a grid flow field, which can be executed by a processing device. The processing device first divides the grid to be processed into multiple non-overlapping sub-regions, and then can process different sub-regions in parallel at the same time, thereby improving the processing efficiency. In addition, in the processing method provided by the present application, additional processing is performed on the grid cells at the boundary. The processing device extends at least 2 layers of auxiliary grid cell sets to the adjacent regions adjacent to the sub-regions along the boundaries of the sub-regions in sequence. In this way, for the grid cells at the boundary, these grid cells are adjacent to the auxiliary grid cells in the auxiliary grid cell set, and the intermediate increments and updates of the flow field solutions of the auxiliary grid cells are updated in real time and are not set to 0 by default. In the process of calculating the grid cells at the boundary, the processing device uses the latest increments of the flow field solutions of the adjacent grid cells (including the auxiliary grid cells and the local grid cells). Therefore, the number of iterations of the calculation process can be reduced, the convergence process can be accelerated, and the processing efficiency can be improved.

[0044] It should be understood that the description of technical features, technical solutions, beneficial effects or similar language in this application does not imply that all features and advantages can be realized in any single embodiment. On the contrary, it is understood that the description of features or beneficial effects means that specific technical features, technical solutions or beneficial effects are included in at least one embodiment. Therefore, the description of technical features, technical solutions or beneficial effects in this specification does not necessarily refer to the same embodiment. Furthermore, the technical features, technical solutions and beneficial effects described in the present embodiment can also be combined in any appropriate manner. Those skilled in the art will understand that the embodiment can be realized without one or more specific technical features, technical solutions or beneficial effects of a specific embodiment. In other embodiments, additional technical features and beneficial effects can also be identified in a specific embodiment that does not embody all embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] Figure 1 A flowchart of a method for processing a grid flow field provided in an embodiment of the present application;

[0046] Figure 2 A schematic diagram of a grid undirected graph provided in an embodiment of the present application;

[0047] Figure 3 A schematic diagram after partitioning provided in an embodiment of the present application;

[0048] Figure 4 A schematic diagram of an auxiliary grid unit set provided in an embodiment of the present application;

[0049] Figure 5 A schematic diagram of the numbering of auxiliary grid units provided in an embodiment of the present application;

[0050] Figure 6 A schematic diagram of a parallel processing process provided in an embodiment of the present application;

[0051] Figure 7 A schematic diagram of a first target grid unit provided in an embodiment of the present application;

[0052] Figure 8 A schematic diagram of a second target grid unit provided in an embodiment of the present application;

[0053] Fig. 9 A schematic diagram of a third target grid unit provided in an embodiment of the present application;

[0054] Fig.10 A schematic diagram of a fourth target grid unit provided in an embodiment of the present application;

[0055] Fig.11 A schematic diagram of a convergence effect provided in an embodiment of the present application;

[0056] Fig.12 A schematic diagram of another convergence effect provided in an embodiment of the present application;

[0057] Fig.13 A schematic diagram of a grid flow field processing device provided in an embodiment of the present application;

[0058] Fig.14 A schematic diagram of a computing device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0059] The terms "first", "second", "third", etc. in the specification of this application and the accompanying drawings are used to distinguish different objects rather than to limit a specific order.

[0060] In the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

[0061] In order to make the description of the following embodiments clear and concise, a brief introduction to the related technology is first given:

[0062] In CFD, the implicit LU-SGS solution method is an iterative algorithm commonly used to solve linear systems. The steps are as follows:

[0063] S1. Discretize the Navier-Stokes equations (basic equations describing fluid motion) into a set of algebraic equations using the finite volume method. The Navier-Stokes equations are shown below:

[0064]

[0065] Where t is time, Q is the conserved variable (also called flow field solution, which may include density, momentum, energy, etc.), F is the convective flux, is the viscous flux, S is the source term, represents the geometric area of ​​calculation, is the boundary of the calculated geometric region, and e represents the boundary area vector of the geometric region.

[0066] S2. After spatially discretizing the convective flux, viscous flux and source term, we obtain the implicit semi-discrete form of the equation.

[0067]

[0068]

[0069] in, is the update amount of the flow field solution of the jth grid unit in the nth iteration, Indicates the round of time iteration; represents the time increment; Represents the right-hand side term of the n+1th iteration, including the following components: represents the convective flux between the j-th grid cell and the k-th grid cell, and the k-th grid cell is adjacent to the j-th grid cell; represents the viscous flux between the jth grid cell and the kth grid cell; represents the boundary area vector between the jth grid cell and the kth grid cell; represents the source term of the jth grid cell;

[0070] S3. For the implicit part After linearization and neglecting the source term, the iterative formula is obtained.

[0071]

[0072] in, represents the numerical flux between the jth grid cell and the kth grid cell; Represents numerical flux The Jacobian matrix for the jth grid cell is, Represents numerical flux The Jacobian matrix for the kth grid cell is, is the update amount of the flow field solution of the kth grid unit in the nth iteration, is the update amount of the flow field solution of the jth grid unit in the nth iteration, represents the flow field solution of the jth grid cell, represents the volume of the jth grid cell, Represents the right-hand side term at the nth iteration.

[0073] The processing device may perform an approximate LU decomposition on the Jacobian matrix using a matrix spectral radius, wherein the Jacobian matrix uses a spectral radius ( ) is expressed as follows:

[0074]

[0075] in, express The unit normal vector of represents the flow field solution of the jth grid cell, represents the flow field solution of the kth grid cell, represents the identity matrix; for the convenience of description, replace ,use replace .

[0076] After substituting into the above iterative formula, we can get:

[0077]

[0078] For the convenience of description, replace ,use replace ,use replace .

[0079] Based on this, the processing device can scan the jth grid unit forward to obtain the intermediate increment of the flow field solution of the jth grid unit:

[0080]

[0081] is the intermediate increment of the flow field solution of the jth grid cell, is the intermediate increment of the flow field solution of the kth grid cell, and N is the number of grid cells.

[0082] The processing device can scan the jth grid unit backward to obtain the update amount of the flow field solution of the jth grid unit:

[0083]

[0084] is the update amount of the flow field solution of the jth grid unit, is the update amount of the flow field solution of the kth grid cell.

[0085] From the above calculation process, it can be seen that this method has strong data dependence. When scanning forward, it depends on the intermediate increment of the flow field solution of the kth grid unit adjacent to the jth grid unit. When scanning backward, it depends on the intermediate increment of the flow field solution of the jth grid unit and the update amount of the flow field solution of the kth grid unit adjacent to the jth grid unit. It is impossible to directly perform data parallel processing. The efficiency of serial processing is low and it is impossible to fully tap the computing potential of high-performance processors.

[0086] In order to achieve parallel processing, the scheme currently adopted is to divide the processed grid into regions and process them separately. However, the increment of the flow field solution of the grid cells at the boundary of adjacent regions is defaulted to 0, and the boundary of adjacent regions becomes Jacobi iteration, which will reduce the implicit acceleration effect and reduce the convergence efficiency.

[0087] In view of this, an embodiment of the present application provides a method for processing a grid flow field, which can be executed by a processing device. In the method, by extending the auxiliary grid unit at the boundary of the sub-area, the processing device can utilize the increment of the flow field solution of the auxiliary grid unit when calculating the increment of the flow field solution of the grid unit at the boundary. Since the increment of the flow field solution of the auxiliary grid unit is also iteratively updated in real time, the increment of the flow field solution of the grid unit at the boundary is determined by using the latest increment of the flow field solution of the auxiliary grid unit, which not only improves the processing efficiency but also improves the accuracy.

[0088] Among them, the processing device can be a terminal or a server. Terminals include but are not limited to smart phones, tablet computers, laptops, personal digital assistants or smart wearable devices. The server can be a cloud server, such as a central server in a central cloud computing cluster, or an edge server in an edge cloud computing cluster. Of course, the server can also be a server in a local data center. A local data center refers to a data center directly controlled by the user. Compared with the traditional template method, the subdivision method proposed in the technical solution of the present application does not need to consider the unit type of the subdivided grid, can be applied to standard units and non-standard units, and has better compatibility.

[0089] In order to make the technical solution of the present application clearer and easier to understand, the technical solution of the present application is introduced below in conjunction with the accompanying drawings. Figure 1 As shown in FIG. 1 , the figure is a flow chart of a method for processing a grid flow field provided in an embodiment of the present application, the method comprising:

[0090] S101: A processing device obtains a grid to be processed.

[0091] In some embodiments, the processing device may simulate the target object to obtain a to-be-processed mesh corresponding to the target object, wherein the target object may refer to an object to be simulated.

[0092] S102: The processing device divides the grid to be processed into a plurality of non-overlapping sub-areas.

[0093] After the processing device determines the grid to be processed, it can divide the grid to be processed into multiple non-overlapping sub-regions, so that the processing device can process the grid units in each sub-region in parallel.

[0094] In some embodiments, the processing device may map the grid to be processed into a grid undirected graph, the nodes of which represent grid units, and then divide the grid to be processed into multiple non-overlapping sub-areas according to the connectivity of the nodes in the grid undirected graph.

[0095] like Figure 2 As shown, the figure is a schematic diagram of a grid undirected graph provided by an embodiment of the present application. The grid to be processed shown in the figure is only partially schematic, including grid units C0-C7, each grid unit corresponds to a node in the grid undirected graph, and the connectivity of a node refers to the number of grid units adjacent to the grid unit corresponding to the node. Taking grid unit C0 as an example, the number of grid units adjacent to grid unit C0 is 7, and thus the connectivity of the node corresponding to grid unit C0 in the grid undirected graph is 7.

[0096] In some embodiments, the processing device may use the connectivity of a node as the weight of the node, and then use a weighted graph partitioning algorithm to partition the grid undirected graph into p non-overlapping sub-regions. , , Represents the geometric area of ​​calculation (the entire area of ​​the grid to be processed), and the subscripts 1, 2, ..., p represent the first sub-area, the second sub-area, ..., the pth sub-area, respectively.

[0097] like Figure 3 As shown, the figure is a schematic diagram of a partition provided by an embodiment of the present application. As can be seen from the figure, the grid to be processed is divided into a first sub-region 301 and a second sub-region 302, wherein the first sub-region 301 is adjacent to the second sub-region 302 through a boundary 303.

[0098] It should be noted that Figure 3 The example in which the grid to be processed is divided into two sub-regions is merely used for illustration. The grid to be processed may also be divided into more sub-regions.

[0099] In some embodiments, the processing device determines the global number of each grid unit in the grid to be processed according to the connectivity of the nodes in the grid undirected graph. Exemplarily, the processing device may first determine the target node with the smallest connectivity in the grid undirected graph, and then, starting from the target node, sort the nodes in the grid undirected graph in sequence, and determine the global number of each grid unit in the grid to be processed according to the order of the nodes in the grid undirected graph. For example, the processing device may use the RCM (Reverse-Cuthill-Mckee) algorithm to number the nodes in the grid undirected graph, and then obtain the global number of each grid unit, which is Gi. In this embodiment, the processing device starts from the nodes with small connectivity, sorts layer by layer to obtain new numbers, thereby reducing bandwidth and column height.

[0100] In some embodiments, after partitioning the grid to be processed and numbering each grid unit, the processing device can also determine the calculation number of the grid unit in each sub-region according to the global number of the grid unit in the sub-region. The global number is different from the calculation number. The global number refers to the global number of the grid unit, and the calculation number refers to the local number of the grid unit, for example, the number of the grid unit in the sub-region.

[0101] Exemplarily, the processing device may first obtain the global numbers of the grid units in the sub-region, and then renumber the grid units in the sub-region in ascending order of the global numbers of the grid units in the sub-region, thereby obtaining the local number of each grid unit in the sub-region, that is, the calculated number, denoted as cj, where the range of cj is 1…Np, where Np is the number of grid units in the sub-region.

[0102] It should be noted that the above only introduces the process of processing one sub-region by the processing device, and the processing process for other sub-regions is similar to the above and will not be repeated.

[0103] S103: The processing device sequentially expands at least two layers of auxiliary grid unit sets to adjacent areas adjacent to the sub-area along the boundary of the sub-area.

[0104] The first layer of auxiliary grid cell sets is adjacent to the boundary of the sub-region and is located outside the sub-region.

[0105] In some embodiments, the processing device may extend three layers of auxiliary grid unit sets to adjacent regions adjacent to the sub-region in sequence along the boundary of the sub-region, thereby improving the accuracy of the calculation results. It should be noted that the number of layers of the auxiliary grid unit set may also be greater than three layers.

[0106] like Figure 4As shown, the figure is a schematic diagram of an auxiliary grid unit set provided by an embodiment of the present application. Following the above embodiment, the processing device expands a three-layer auxiliary grid unit set 3011 along the boundary 303 of the first sub-area 301 to the adjacent area (i.e., the second sub-area 302) adjacent to the first sub-area 301. The grid unit marked "1" in the figure indicates that the grid unit is a first-layer auxiliary grid unit, the grid unit marked "2" in the figure indicates that the grid unit is a second-layer auxiliary grid unit, and the grid unit marked "3" in the figure indicates that the grid unit is a third-layer auxiliary grid unit.

[0107] In some examples, the processing device may further assign an area number to each sub-area, and for each auxiliary grid unit set, determine the calculation number of each auxiliary grid unit in the auxiliary grid unit set according to the area number of the area where the auxiliary grid unit set is located and the global number of the auxiliary grid units in the auxiliary grid unit set. In the arrangement order, the maximum value of the calculation number of the grid unit in the sub-area is less than the minimum value of the calculation number of the auxiliary grid unit corresponding to the sub-area, and the maximum value of the calculation number of the grid unit in the sub-area is adjacent to the minimum value of the calculation number of the auxiliary grid unit corresponding to the sub-area.

[0108] The processing device can determine the area numbers of the first sub-area 301 and the second sub-area 302. Since the first sub-area 301 is adjacent to the second sub-area 302, in the process of expanding the auxiliary grid unit set for the first sub-area 301, the expanded auxiliary grid unit set falls in the second sub-area 302. The processing device needs to first obtain the area numbers of the adjacent areas adjacent to the first sub-area 301, and then determine the target adjacent areas in order of the area numbers of the adjacent areas from small to large, and for the auxiliary grid units in each target adjacent area, determine the calculation number of the auxiliary grid unit according to the global number of the auxiliary grid unit. In other words, the processing device first finds the adjacent area with the smallest area number, and then determines the calculation number of the auxiliary grid units in the adjacent area based on the global numbers of the auxiliary grid units falling in the adjacent area from small to large, and then finds the next smallest adjacent area until all adjacent areas are traversed.

[0109] It should be noted that in the above embodiment, the adjacent area adjacent to the first sub-area 301 is the second sub-area 302, and in other embodiments, the adjacent area adjacent to the first sub-area 301 includes more adjacent areas, and the processing process is similar, which will not be repeated here.

[0110] The following are some examples. Figure 5 As shown, this figure is a schematic diagram of the numbering of auxiliary grid units provided in an embodiment of the present application. Figure 5In the example, the maximum value of the calculated number of the grid unit in the first sub-region 301 is Np, so the minimum value of the calculated number of the auxiliary grid unit in the first sub-region 301 is Np+1, and the processing device sequentially numbers the auxiliary grid units, wherein the maximum value of the calculated number of the auxiliary grid unit in the first layer is Npm1. After the processing device completes the numbering of the auxiliary grid unit set in the first layer, it numbers the auxiliary grid units in the auxiliary grid unit set in the next layer. In this embodiment, the minimum value of the calculated number of the auxiliary grid unit in the second layer is Npm1+1, the maximum value of the calculated number of the auxiliary grid unit in the second layer is Npm2, the minimum value of the calculated number of the auxiliary grid unit in the third layer is Npm2+1, and the maximum value of the calculated number of the auxiliary grid unit in the third layer is Npm3. The calculated number of the auxiliary grid unit can be recorded as hj, the minimum value of hj is Np+1, the maximum value of hj is NpmX, and X is the number of layers of the auxiliary grid unit set. For example, the range of hj is {Np+1, Np+2…Npm1, Npm1+1, Npm1+2…Npm2, Npm2+1, Npm2+2…NpmY, NpmY+1, NpmY+2…NpmX}, where Y=X-1.

[0111] S104: The processing device performs parallel processing on each sub-region to obtain a convergent flow field solution for each grid unit.

[0112] Among them, S104 may include multiple sub-steps, which are described below in conjunction with the accompanying drawings. Figure 6 As shown, this figure is a schematic diagram of a parallel processing process provided by an embodiment of the present application. Specifically, S104 includes:

[0113] S601. The processing device determines the first target grid unit in order of the calculation numbers of the grid units in the sub-area from small to large; and determines the intermediate increment of the flow field solution of the first target grid unit according to the intermediate increment of the flow field solution of the first assisting grid unit.

[0114] The first assisting grid unit is adjacent to the first target grid unit and the calculation number of the first assisting grid unit is smaller than the calculation number of the first target grid unit.

[0115] In an embodiment of the present application, taking the sub-region as the first sub-region as an example, the processing device can sequentially determine the first target grid unit in the first sub-region and the first assisting grid unit of the first target grid unit, and determine the intermediate increment of the flow field solution of the first assisting grid unit based on the intermediate increment of the flow field solution of the first assisting grid unit.

[0116] like Figure 7As shown, this figure is a schematic diagram of a first target grid unit provided in an embodiment of the present application. In the figure, the calculation number of the grid unit M1 is greater than the calculation number of the grid unit X11, and the calculation number of the grid unit X11 is greater than the calculation number of the grid unit X12.

[0117] Taking the first target grid unit determined by the processing device as grid unit M1 as an example, the first assisting grid unit of the first target grid unit, that is, grid unit X11 and grid unit X12, can be determined, and then the processing device determines the intermediate increment of the flow field solution of grid unit M1 based on the intermediate increment of the flow field solution of grid unit X11 and grid unit X12. The specific determination method can refer to the introduction in the above embodiment.

[0118] After completing the processing of the local grid units of the first sub-region, the processing device may continue to process the auxiliary grid units corresponding to the first sub-region.

[0119] S602. The processing device determines the second target grid unit in order from small to large according to the calculation numbers of the auxiliary grid units corresponding to the sub-areas; and determines the intermediate increment of the flow field solution of the second target grid unit according to the intermediate increment of the flow field solution of the second auxiliary grid unit.

[0120] The second assisting grid unit is adjacent to the second target grid unit and the calculation number of the second assisting grid unit is smaller than the calculation number of the second target grid unit.

[0121] In an embodiment of the present application, the processing device can sequentially determine a second target grid unit from the auxiliary grid units corresponding to the first sub-area, and a second assisting grid unit of the second target grid unit, and determine an intermediate increment of the flow field solution of the second target grid unit based on the intermediate increment of the flow field solution of the second assisting grid unit.

[0122] like Figure 8 As shown, the figure is a schematic diagram of a second target grid unit provided in an embodiment of the present application. In the figure, the calculation number of the grid unit M2 is greater than the calculation number of the grid unit X21, the calculation number of the grid unit X21 is greater than the calculation number of the grid unit X23, and the calculation number of the grid unit X23 is greater than the calculation number of the grid unit X22.

[0123] Taking the second target grid unit determined by the processing device as grid unit M2 as an example, the second assisting grid units of the second target grid unit, i.e., grid unit X21, grid unit X22 and grid unit X23, can be determined, and then the processing device determines the intermediate increment of the flow field solution of grid unit M2 based on the intermediate increments of the flow field solutions of grid unit X21, grid unit X22 and grid unit X23. The specific determination method can refer to the introduction in the above embodiment.

[0124] After completing the processing of the auxiliary grid units corresponding to the first sub-region, the processing device may continue to scan backward.

[0125] S603, the processing device determines the third target grid unit in descending order of the calculation numbers of the auxiliary grid units corresponding to the sub-areas; determines the update amount of the flow field solution of the third target grid unit according to the intermediate increment of the flow field solution of the third target grid unit and the update amount of the flow field solution of the third assisting grid unit.

[0126] The third assisting grid unit is adjacent to the third target grid unit and the calculation number of the third assisting grid unit is greater than the calculation number of the third target grid unit.

[0127] In an embodiment of the present application, the processing device can sequentially determine a third target grid unit from the auxiliary grid units corresponding to the first sub-area, and a third assisting grid unit of the third target grid unit, and determine an update amount of the flow field solution of the third target grid unit based on an intermediate increment of the flow field solution of the third target grid unit and an update amount of the flow field solution of the third assisting grid unit.

[0128] like Fig. 9 As shown, this figure is a schematic diagram of a third target grid unit provided in an embodiment of the present application. In the figure, the calculation number of grid unit X32 is greater than the calculation number of grid unit X31, the calculation number of grid unit X31 is greater than the calculation number of grid unit X33, and the calculation number of grid unit X33 is greater than the calculation number of grid unit M3.

[0129] Taking the third target grid unit determined by the processing device as grid unit M3 as an example, the third auxiliary grid units of the third target grid unit, i.e., grid unit X31, grid unit X32, and grid unit X33, can be determined, and then the processing device determines the update amount of the flow field solution of grid unit M3 based on the update amount of the flow field solution of grid unit X31, grid unit X32, and grid unit X33 and the intermediate increment of the flow field solution of grid unit M3. The specific determination method can refer to the introduction in the above embodiment. Among them, the intermediate increment of the flow field solution of grid unit M3 (i.e., the third target grid unit) is the value after the update in S602.

[0130] S604. The processing device determines the fourth target grid unit in descending order of the calculation numbers of the grid units in the sub-area; and determines the update amount of the flow field solution of the fourth target grid unit according to the intermediate increment of the flow field solution of the fourth target grid unit and the update amount of the flow field solution of the fourth assisting grid unit.

[0131] The fourth assisting grid unit is adjacent to the fourth target grid unit and the calculation number of the fourth assisting grid unit is greater than the calculation number of the fourth target grid unit.

[0132] In an embodiment of the present application, the processing device can sequentially determine a fourth target grid unit in the first sub-area and a fourth assisting grid unit of the fourth target grid unit, and determine an update amount of the flow field solution of the fourth target grid unit based on an intermediate increment of the flow field solution of the fourth target grid unit and an update amount of the flow field solution of the fourth assisting grid unit.

[0133] like Fig.10 As shown, this figure is a schematic diagram of a fourth target grid unit provided in an embodiment of the present application. In the figure, the calculation number of grid unit X42 is greater than the calculation number of grid unit X41, the calculation number of grid unit X41 is greater than the calculation number of grid unit X43, and the calculation number of grid unit X43 is greater than the calculation number of grid unit M4.

[0134] Taking the fourth target grid unit determined by the processing device as grid unit M4 as an example, the fourth auxiliary grid unit of the fourth target grid unit can be determined, that is, grid unit X41, grid unit X42 and grid unit X43, and then the processing device determines the update amount of the flow field solution of grid unit M4 based on the update amount of the flow field solution of grid unit X41, grid unit X42 and grid unit X43 and the intermediate increment of the flow field solution of grid unit M4. The specific determination method can refer to the introduction in the above embodiment. Among them, the intermediate increment of the flow field solution of grid unit M4 (that is, the fourth target grid unit) is the value after the update in S601. The update amount of the flow field solution of grid unit X41, grid unit X42 and grid unit X43 (that is, the fourth auxiliary grid unit) is the value after the update in S603.

[0135] In an embodiment of the present application, when processing grid cells at a boundary, the processing device does not default the increment of the flow field solution of the grid cells outside the boundary to 0, but calculates the increment of the flow field solution of the grid cells outside the boundary by extending auxiliary units, and assists in determining the increment of the flow field solution of the grid cells inside the boundary based on the increment of the flow field solution of the grid cells outside the boundary, so that the processing process has data to refer to, rather than directly taking 0, thereby improving the convergence efficiency.

[0136] S605. If the update amount of the flow field solution of the fourth target grid unit is less than the preset update amount threshold, the processing device determines the converged flow field solution of the fourth target grid unit according to the previous iterative flow field solution of the fourth target grid unit and the update amount of the flow field solution of the fourth target grid unit.

[0137] In some embodiments, when the update amount of the flow field solution of the fourth target grid unit is less than a preset update amount threshold, it is characterized that the update amount of the flow field solution of the fourth target grid unit is small, that is, it tends to be stable. At this time, the previous iterative flow field solution of the fourth target grid unit and the update amount of the flow field solution of the fourth target grid unit can be superimposed to obtain the converged flow field solution of the fourth target grid unit.

[0138] It should be noted that the above embodiments are only described by taking the processing device processing a certain sub-region as an example, and the processing device can process grid units of multiple sub-regions in parallel.

[0139] Exemplarily, the processing device may include multiple processes, and different processes process grid units in different sub-regions. The auxiliary grid unit for a sub-region may be processed by the process of the sub-region, or by the process corresponding to the sub-region where the auxiliary grid unit is located. At this time, data interaction between processes is required to obtain corresponding information of the auxiliary grid unit and provide data reference for subsequent calculations.

[0140] S105. The processing device merges the convergent flow field solutions of the grid cells in each sub-region to obtain the convergent flow field solution of the grid to be processed.

[0141] After the processing device obtains the convergent flow field solutions of the grid cells in each sub-region according to the above steps, these convergent flow field solutions can be merged to obtain the convergent flow field solution of the grid to be processed.

[0142] like Fig.11 As shown, this figure is a schematic diagram of a convergence effect provided by an embodiment of the present application. The simulation object is a high-lift device (such as an aircraft), which is a combination of a high-lift wing configuration with flaps and ailerons and a fuselage, wherein the incoming flow Mach number is 0.175, corresponding to a typical scenario of aircraft takeoff and landing. This case uses 1024 calculation processes for calculation. The existing LU-SGS is the calculation result without repeated areas (without auxiliary grid units). The LU-SGS of this application is the result of simulation using the steps of this application. It can be seen from the residual convergence process that the method of this application has a better convergence effect.

[0143] like Fig.12 As shown in FIG. 1 , this figure is a schematic diagram of another convergence effect provided by an embodiment of the present application. The simulation object is a high lift device, which is a wing-body suspension assembly with a Mach number of 0.75. The corresponding scene is a passenger aircraft cruising flight condition. 256 cores are used for parallel computing. It can be seen from the figure that the method of the present application can continue to converge, while the residual of the existing method will continue to oscillate at a high level and is not easy to converge.

[0144] Based on the above description, the present application provides a method for processing a grid flow field, which can be executed by a processing device. The processing device first divides the grid to be processed into multiple non-overlapping sub-regions, and then can process different sub-regions in parallel at the same time, thereby improving the processing efficiency. In addition, in the processing method provided by the present application, additional processing is performed on the grid cells at the boundary. The processing device extends at least 2 layers of auxiliary grid cell sets to the adjacent regions adjacent to the sub-regions along the boundaries of the sub-regions in sequence. In this way, for the grid cells at the boundary, these grid cells are adjacent to the auxiliary grid cells in the auxiliary grid cell set, and the intermediate increments and updates of the flow field solutions of the auxiliary grid cells are updated in real time and are not set to 0 by default. In the process of calculating the grid cells at the boundary, the processing device uses the adjacent grid cells (including auxiliary grid cells and local grid cells) The increments of the flow field solutions are all the latest, therefore, it is possible to reduce the number of iterations of the calculation process, speed up the convergence process, and improve the processing efficiency.

[0145] In the embodiments of the present application, the following technical problems are found: the implicit LU-SGS algorithm is the most widely used, high-precision and high-efficiency solution method in computational aerodynamic flow simulation. When the algorithm is distributed and parallelized on a multi-core processor, it will generate matrix bandwidth and complicate the calculation process when applied to a polyhedral grid, resulting in poor computational efficiency. In addition, this algorithm has strong data dependence, and the convergence is affected by the destruction of data dependence at the boundaries of geometric partitions. Therefore, it is urgent to study the distributed high-performance parallel computing method of the implicit LU-SGS of polyhedral grids to improve the computing efficiency of the algorithm in distributed parallelization.

[0146] In order to solve the technical problem, the technical concept of the present application is: to perform global grid numbering through the RCM algorithm, and then to decompose the tasks into non-overlapping sub-partitions through a weighted grid geometry partitioning algorithm, and to arrange the sub-areas according to the global grid numbers, so as to obtain optimized matrix bandwidth and balanced sub-partition loads, and then to expand the adjacent grid units on multiple levels layer by layer to form sub-partitions with overlapping areas. In the grid sub-partitions with overlapping areas, the computational grid topology structure is used to calculate the increment of the flow field solution including the expanded grid units, and the LU-SGS dependent data of the original sub-partition is explicitly obtained locally, thereby improving the parallel convergence performance, and finally realizing high-performance distributed parallel computing of implicit LU-SGS of polyhedral unstructured grids, further improving the parallel computing efficiency.

[0147] Combination of the above Figures 1 to 12 The grid flow field processing method provided in the embodiment of the present application is introduced in detail. The device and equipment provided in the embodiment of the present application will be introduced in conjunction with the accompanying drawings.

[0148] like Fig.13As shown, this figure is a schematic diagram of a grid flow field processing device provided in an embodiment of the present application, and the device includes:

[0149] A partitioning module 1301 is used to divide the grid to be processed into a plurality of non-overlapping sub-regions;

[0150] An expansion module 1302 is used to expand at least two layers of auxiliary grid unit sets along the boundary of the sub-region to adjacent regions adjacent to the sub-region in sequence, wherein the first layer of auxiliary grid unit sets is adjacent to the boundary of the sub-region and is located outside the sub-region;

[0151] The processing module 1303 is used for each sub-region:

[0152] Determine the first target grid unit in the order of the calculation numbers of the grid units in the sub-area from small to large; determine the intermediate increment of the flow field solution of the first target grid unit according to the intermediate increment of the flow field solution of the first assisting grid unit, wherein the first assisting grid unit is adjacent to the first target grid unit and the calculation number of the first assisting grid unit is smaller than the calculation number of the first target grid unit; determine the second target grid unit in the order of the calculation numbers of the auxiliary grid units corresponding to the sub-area from small to large; determine the intermediate increment of the flow field solution of the second target grid unit according to the intermediate increment of the flow field solution of the second assisting grid unit; the second assisting grid unit is adjacent to the second target grid unit and the calculation number of the second assisting grid unit is smaller than the calculation number of the second target grid unit; determine the third target grid unit in the order of the calculation numbers of the auxiliary grid units corresponding to the sub-area from large to small; update the flow field solution of the third target grid unit according to the intermediate increment and the flow field solution of the third assisting grid unit The method comprises the following steps: determining an update amount of the flow field solution of the third target grid unit according to an intermediate increment of the flow field solution of the fourth target grid unit and an update amount of the flow field solution of the fourth assisting grid unit; determining an update amount of the flow field solution of the fourth target grid unit according to an intermediate increment of the flow field solution of the fourth target grid unit and an update amount of the flow field solution of the fourth assisting grid unit; the fourth assisting grid unit is adjacent to the fourth target grid unit and the calculation number of the fourth assisting grid unit is greater than the calculation number of the fourth target grid unit; if the update amount of the flow field solution of the fourth target grid unit is less than a preset update amount threshold, determining a convergent flow field solution of the fourth target grid unit according to a previous iterative flow field solution of the fourth target grid unit and an update amount of the flow field solution of the fourth target grid unit; and merging the convergent flow field solutions of the grid units in each sub-region to obtain a convergent flow field solution of the grid to be processed.

[0153] Optionally, the partitioning module 1301 is specifically used to map the grid to be processed into a grid undirected graph, the nodes of the grid undirected graph represent grid units; and divide the grid to be processed into multiple non-overlapping sub-areas according to the connectivity of the nodes in the grid undirected graph.

[0154] Optionally, the processing module 1303 is further configured to determine the global number of each grid unit in the grid to be processed according to the connectivity of the nodes in the grid undirected graph.

[0155] Optionally, the processing module 1303 is further configured to determine, for each sub-region, according to the global number of the grid cells in the sub-region, the calculated number of the grid cells in the sub-region.

[0156] Optionally, the processing module 1303 is further used to assign an area number to each sub-area; for each auxiliary grid unit set, determine the calculation number of each auxiliary grid unit in the auxiliary grid unit set according to the area number of the area where the auxiliary grid unit set is located and the global number of the auxiliary grid units in the auxiliary grid unit set; wherein, in terms of arrangement order, the maximum value of the calculation number of the grid unit in the sub-area is less than the minimum value of the calculation number of the auxiliary grid unit corresponding to the sub-area, and the maximum value of the calculation number of the grid unit in the sub-area is adjacent to the minimum value of the calculation number of the auxiliary grid unit corresponding to the sub-area.

[0157] Optionally, the processing module 1303 is specifically used to determine the target node with the smallest connectivity in the grid undirected graph; starting from the target node, sort the nodes in the grid undirected graph in sequence; and determine the global number of each grid unit in the grid to be processed according to the order of the nodes in the grid undirected graph.

[0158] Optionally, the number of layers of the auxiliary grid unit set is greater than or equal to 3 layers.

[0159] The grid flow field processing device according to the embodiment of the present application may correspond to the method described in the embodiment of the present application, and the above-mentioned other operations and / or functions of each module / unit of the grid flow field processing device are respectively to realize Figure 1 , Figure 6 For the sake of brevity, the corresponding processes of each method in the illustrated embodiment are not described in detail here.

[0160] The present application embodiment also provides a computing device, which may be the above-mentioned processing device. Fig.14As shown, this figure is a schematic diagram of a computing device provided in an embodiment of the present application, and the computing device 1400 includes a bus 1401, a processor 1402, a communication interface 1403 and a memory 1404. The processor 1402, the memory 1404 and the communication interface 1403 communicate through the bus 1401.

[0161] The bus 1401 may be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.14 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0162] The processor 1402 may be any one or more of a central processing unit (CPU), a graphics processing unit (GPU), a microprocessor (MP), or a digital signal processor (DSP).

[0163] The communication interface 1403 is used for communicating with the outside.

[0164] The memory 1404 may include a volatile memory, such as a random access memory (RAM). The memory 1404 may also include a non-volatile memory, such as a read-only memory (ROM), a flash memory, a hard disk drive (HDD), or a solid state drive (SSD).

[0165] The memory 1404 stores executable codes, and the processor 1402 executes the executable codes to perform the aforementioned grid flow field processing method.

[0166] Specifically, in implementing Fig.13 In the case of the embodiment shown, and Fig.13 When each module or unit of the grid flow field processing device described in the embodiment is implemented by software, the execution Fig.13The software or program code required for the functions of each module / unit in the system may be partially or completely stored in the memory 1404. The processor 1402 executes the program code corresponding to each unit stored in the memory 1404 to execute the aforementioned grid flow field processing method.

[0167] The embodiment of the present application also provides a computer-readable storage medium. The computer-readable storage medium can be any available medium that can be stored by a computing device or a data storage device such as a data center containing one or more available media. The available medium can be a magnetic medium (such as a floppy disk, a hard disk, a tape), an optical medium (such as a DVD), or a semiconductor medium (such as a solid-state hard disk). The computer-readable storage medium includes instructions that instruct the computing device to execute the above-mentioned grid flow field processing method.

[0168] The embodiment of the present application further provides a computer program product, which includes one or more computer instructions. When the computer instructions are loaded and executed on a computing device, the process or function described in the embodiment of the present application is generated in whole or in part.

[0169] The computer instructions may 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 may be transmitted from one website, computer or data center to another website, computer or data center via wired (e.g., coaxial cable, optical fiber, digital subscriber line) or wireless (e.g., infrared, wireless, microwave, etc.) means.

[0170] When the computer program product is executed by a computer, the computer executes any of the aforementioned methods for processing a grid flow field. The computer program product may be a software installation package, and when any of the aforementioned methods for processing a grid flow field is required, the computer program product may be downloaded and executed on a computer.

[0171] The descriptions of the processes or structures corresponding to the above-mentioned figures have different emphases. For parts that are not described in detail in a certain process or structure, please refer to the relevant descriptions of other processes or structures.

[0172] The above description is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions within the technical scope disclosed in the present application should be included in the protection scope of the present application.

Claims

1. A method for processing a grid flow field, characterized in that: The method comprises: Divide the grid to be processed into multiple non-overlapping sub-areas; Extending at least two layers of auxiliary grid unit sets in sequence along the boundary of the sub-region to adjacent regions adjacent to the sub-region, wherein the first layer of auxiliary grid unit sets is adjacent to the boundary of the sub-region and is located outside the sub-region; For each sub-region: Determine the first target grid unit in order of the calculation numbers of the grid units in the sub-area from small to large; determine the intermediate increment of the flow field solution of the first target grid unit according to the intermediate increment of the flow field solution of the first assisting grid unit, wherein the first assisting grid unit is adjacent to the first target grid unit and the calculation number of the first assisting grid unit is smaller than the calculation number of the first target grid unit; Determine the second target grid unit in order of the calculation numbers of the auxiliary grid units corresponding to the sub-areas from small to large; determine the intermediate increment of the flow field solution of the second target grid unit according to the intermediate increment of the flow field solution of the second auxiliary grid unit; the second auxiliary grid unit is adjacent to the second target grid unit and the calculation number of the second auxiliary grid unit is smaller than the calculation number of the second target grid unit; Determine the third target grid unit in descending order of the calculation numbers of the auxiliary grid units corresponding to the sub-areas; determine the update amount of the flow field solution of the third target grid unit according to the intermediate increment of the flow field solution of the third target grid unit and the update amount of the flow field solution of the third assisting grid unit; the third assisting grid unit is adjacent to the third target grid unit and the calculation number of the third assisting grid unit is greater than the calculation number of the third target grid unit; Determine the fourth target grid unit in descending order of the calculation numbers of the grid units in the sub-area; determine the update amount of the flow field solution of the fourth target grid unit according to the intermediate increment of the flow field solution of the fourth target grid unit and the update amount of the flow field solution of the fourth assisting grid unit; the fourth assisting grid unit is adjacent to the fourth target grid unit and the calculation number of the fourth assisting grid unit is greater than the calculation number of the fourth target grid unit; If the update amount of the flow field solution of the fourth target grid unit is less than a preset update amount threshold, determining the converged flow field solution of the fourth target grid unit according to the previous iterative flow field solution of the fourth target grid unit and the update amount of the flow field solution of the fourth target grid unit; The convergent flow field solutions of the grid cells in each sub-region are merged to obtain the convergent flow field solution of the grid to be processed.

2. The method according to claim 1, characterized in that The grid to be processed is divided into a plurality of non-overlapping sub-areas, including: Mapping the to-be-processed grid into a grid undirected graph, wherein the nodes of the grid undirected graph represent grid units; According to the connection degree of the nodes in the grid undirected graph, the grid to be processed is divided into a plurality of non-overlapping sub-areas.

3. The method according to claim 2, characterized in that The method further comprises: According to the connection degree of the nodes in the grid undirected graph, the global number of each grid unit in the grid to be processed is determined.

4. The method according to claim 3, characterized in that The method further comprises: For each sub-region, the calculation number of the grid unit in the sub-region is determined according to the global number of the grid unit in the sub-region.

5. The method according to claim 4, characterized in that The method further comprises: Assign a region number to each sub-region; For each auxiliary grid unit set, determining a calculation number of each auxiliary grid unit in the auxiliary grid unit set according to an area number of an area where the auxiliary grid unit set is located and a global number of the auxiliary grid units in the auxiliary grid unit set; Among them, in terms of arrangement order, the maximum value of the calculation number of the grid unit in the sub-area is less than the minimum value of the calculation number of the auxiliary grid unit corresponding to the sub-area, and the maximum value of the calculation number of the grid unit in the sub-area is adjacent to the minimum value of the calculation number of the auxiliary grid unit corresponding to the sub-area.

6. The method according to claim 3, characterized in that: Determining the global number of each grid unit in the grid to be processed according to the connection degree of the nodes in the grid undirected graph includes: Determine a target node with the smallest connection degree in the grid undirected graph; Starting from the target node, the nodes in the grid undirected graph are sorted in sequence; According to the order of the nodes in the grid undirected graph, the global number of each grid unit in the grid to be processed is determined.

7. The method according to claim 1, characterized in that The number of layers of the auxiliary grid unit set is greater than or equal to 3 layers.

8. A grid flow field processing device, characterized in that: The device comprises: A partitioning module is used to divide the grid to be processed into multiple non-overlapping sub-regions; An expansion module, used to expand at least two layers of auxiliary grid unit sets along the boundary of the sub-region to adjacent regions adjacent to the sub-region in sequence, wherein the first layer of auxiliary grid unit sets is adjacent to the boundary of the sub-region and is located outside the sub-region; A processing module is used for each sub-region: Determine the first target grid unit in the order of the calculation numbers of the grid units in the sub-area from small to large; determine the intermediate increment of the flow field solution of the first target grid unit according to the intermediate increment of the flow field solution of the first assisting grid unit, wherein the first assisting grid unit is adjacent to the first target grid unit and the calculation number of the first assisting grid unit is smaller than the calculation number of the first target grid unit; determine the second target grid unit in the order of the calculation numbers of the auxiliary grid units corresponding to the sub-area from small to large; determine the intermediate increment of the flow field solution of the second target grid unit according to the intermediate increment of the flow field solution of the second assisting grid unit; the second assisting grid unit is adjacent to the second target grid unit and the calculation number of the second assisting grid unit is smaller than the calculation number of the second target grid unit; determine the third target grid unit in the order of the calculation numbers of the auxiliary grid units corresponding to the sub-area from large to small; update the flow field solution of the third target grid unit according to the intermediate increment and the flow field solution of the third assisting grid unit The method comprises the following steps: determining an update amount of the flow field solution of the third target grid unit according to an intermediate increment of the flow field solution of the fourth target grid unit and an update amount of the flow field solution of the fourth assisting grid unit; determining an update amount of the flow field solution of the fourth target grid unit according to an intermediate increment of the flow field solution of the fourth target grid unit and an update amount of the flow field solution of the fourth assisting grid unit; the fourth assisting grid unit is adjacent to the fourth target grid unit and the calculation number of the fourth assisting grid unit is greater than the calculation number of the fourth target grid unit; if the update amount of the flow field solution of the fourth target grid unit is less than a preset update amount threshold, determining a convergent flow field solution of the fourth target grid unit according to a previous iterative flow field solution of the fourth target grid unit and an update amount of the flow field solution of the fourth target grid unit; and merging the convergent flow field solutions of the grid units in each sub-region to obtain a convergent flow field solution of the grid to be processed.

9. A computing device, characterized in that including memory and processor; One or more computer programs are stored in the memory, and the one or more computer programs include instructions; when the instructions are executed by the processor, the computing device executes the method as claimed in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium is used to store a computer program, and the computer program is used to execute the method according to any one of claims 1 to 7.

Images