Grid interface host unit parallel search method and device and storage medium

By partitioning the grid area and determining the coordinates of virtual point in parallel mode, the problem of interruption of the search path of the host unit in the grid interface is solved, and accurate field variable transmission is achieved.

CN118966053AActive Publication Date: 2024-11-15CHINA SHIPBUILDING ORLANDO WUXI SOFTWARE TECH CO LTD
View PDF 7 Cites 0 Cited by

Patent Information

Application Number
CN202410995676.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-24
Publication Date
2024-11-15
Estimated Expiration
2044-07-24

AI Technical Summary

Technical Problem

In parallel mode, the search path of the mesh interface host unit is easily interrupted by the process grid boundary, resulting in inaccurate field variable transmission.

Method used

By partitioning the two grid areas, determine the coordinates of the interface virtual point of each process, and search for the corresponding subgrid areas for approximate host units, and use the center of gravity coordinate method to further determine the host units to ensure the accurate transmission of field variables. .

Benefits of technology

It realizes effective search of the grid interface host unit in parallel mode, ensures the accuracy of field variable transmission and avoids numerical deviation of virtual point values.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118966053A_ABST
    Figure CN118966053A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of computational fluid mechanics, and particularly discloses a grid interface host unit parallel search method and device and a storage medium, and the method comprises the steps: respectively partitioning any two paired first grid regions and second grid regions to obtain first sub-grid regions and second sub-grid regions, the number of which is the same as that of processes; determining a first virtual point coordinate of the first interface subset and a second virtual point coordinate of the second interface subset; searching a first approximate host unit of the first virtual point according to the first virtual point coordinate, and searching a second approximate host unit of the second virtual point according to the second virtual point coordinate; a first host unit of the first interface is determined from the first approximate host unit, and a second host unit is determined from the second approximate host unit. According to the grid interface host unit parallel search method provided by the invention, the search of the grid interface host unit in a parallel mode is realized.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of computational fluid dynamics, and in particular to a grid interface host unit parallel search method, a grid interface host unit parallel search device and a storage medium. Background Art

[0002] At present, in the engineering design of aerospace, shipbuilding, automobile and other fields, the application of simulation calculation is becoming more and more extensive, and the model structure is becoming more and more complex. For complex geometric shapes, especially models containing moving parts, it is necessary to separate the non-moving parts from the moving parts and model them, and couple the moving and non-moving parts in the simulation calculation. In the coupling process, it is necessary to process the interface between the meshes of the two components to realize the transfer of field variables.

[0003] The key to processing the grid interface is to determine the field variables on the interface. The current processing method is: Figure 1 As shown in the figure, a point is extended from the center of the mesh unit celement on the current side to the mesh area on the other side through the interface surface center cface. This point is called the virtual point virtual-point of the interface. By determining the position of the virtual point in the mesh area on the other side, the value of the virtual point is given. The conventional method is to assign a value to the virtual point using the value of the mesh unit where the virtual point is located. After assigning a value to the virtual point, the value on the interface can be determined by the interpolation method, thereby realizing the numerical transfer of the two mesh areas.

[0004] In the above processing methods, the most critical thing is to find the grid unit where the virtual point is located, that is, the host unit of the virtual point or interface. The current conventional methods include the barycentric coordinate method. In the serial mode, the barycentric coordinate method can accurately find the grid unit containing the virtual point because the grid is complete, ensuring the accuracy of the flow field numerical transmission. However, in order to improve the calculation speed, when the parallel mode is used, after the grid is partitioned, the search path will be interrupted by the process grid boundary, such as Figure 2 shown.

[0005] Therefore, how to realize the search of grid interface host units in parallel mode becomes a technical problem that needs to be solved urgently by those skilled in the art. Summary of the invention

[0006] The present invention provides a grid interface host unit parallel search method, a grid interface host unit parallel search device and a storage medium, which solve the problem in the related art that the grid interface host unit parallel search mode cannot be realized.

[0007] As a first aspect of the present invention, a method for parallel searching of grid interface host units is provided, which comprises:

[0008] Partition any two paired first grid areas and second grid areas to obtain first sub-grid areas and second sub-grid areas that are the same number as the number of processes, wherein the first grid area includes a first interface set, the second grid area includes a second interface set, the first grid area and the second grid area are connected with the second interface set through the first interface set, each process includes a first sub-grid area and a second sub-grid area, the first sub-grid area of ​​at least one process includes a first interface subset, the second sub-grid area of ​​at least one process includes a second interface subset, the first interface subsets of all processes form the first interface set, and the second interface subsets of all processes form the second interface set;

[0009] Determine the first virtual point coordinates of each first interface in the first interface subset and the second virtual point coordinates of each second interface in the second interface subset of each process respectively;

[0010] For each process, searching for a first approximate host unit of the first virtual point in the second grid cells corresponding to the second interface subsets of all processes according to the first virtual point coordinates of each first interface, and searching for a second approximate host unit of the second virtual point in the first grid cells corresponding to the first interface subsets of all processes according to the second virtual point coordinates of each second interface;

[0011] For each process, determining a first host unit of each first interface according to a first approximate host unit of a first virtual point of the first interface, and determining a second host unit of each second interface according to a second approximate host unit of a second virtual point of the second interface;

[0012] The flow field value transfer between the first grid area and the second grid area is realized according to the field variables in the first host unit of all processes and the field variables in the second host unit of all processes.

[0013] Further, the first sub-grid area of ​​each process includes a plurality of first grid units, and the second sub-grid area of ​​each process includes a plurality of second grid units, and the first virtual point coordinates of each first interface in the first interface subset of each process and the second virtual point coordinates of each second interface in the second interface subset are determined respectively, including:

[0014] For each process, calculating first body-centered coordinates and first face-centered coordinates of all first grid cells in the first sub-grid area, and calculating second body-centered coordinates and second face-centered coordinates of all second grid cells in the second sub-grid area;

[0015] The first virtual point coordinates of the first interface are calculated based on the first face-center coordinates of each first interface in the first interface subset of the process and the first body-center coordinates of the first grid unit where the first interface is located, and the second virtual point coordinates of the second interface are calculated based on the second face-center coordinates of each second interface in the second interface subset of the process and the second body-center coordinates of the second grid unit where the second interface is located.

[0016] Furthermore, the calculation formulas of the first virtual point coordinates and the second virtual point coordinates are both:

[0017] C virtual-Poin =C face +|C face -C element |e,

[0018] Among them, C face represents the coordinates of the center of the first interface or the second interface, C element represents the body center coordinate of the first grid cell where the first interface is located or the second grid cell where the second interface is located, C virtual-Point represents the coordinates of the first virtual point or the second virtual point, |C face -C element | represents the distance from the center of the first interface to the center of the first grid unit, or the distance from the center of the second interface to the center of the second grid unit, and e represents the unit vector in the external normal direction of the first interface or the unit vector in the external normal direction of the second interface.

[0019] Further, for each process, searching for a first approximate host unit of the first virtual point in the second grid units corresponding to the second interface subsets of all processes according to the first virtual point coordinates of each first interface includes:

[0020] The second body-center coordinates of the second grid cells where each second interface in the second interface subsets of all processes is located are collected to form a second body-center coordinate set;

[0021] For each process, searching for the second body-center coordinates closest to the first virtual point in the second body-center coordinate set according to the first virtual point coordinates of each first interface;

[0022] The target second grid unit where the second body center coordinate closest to the first virtual point is located is determined as the first approximate host unit, the process where the target second grid unit is located is determined as the process where the first approximate host unit is located, and the grid number of the target second grid unit is determined as the grid number of the first approximate host unit.

[0023] Further, for each process, searching for a second approximate host unit of the second virtual point in the first grid units corresponding to the first interface subsets of all processes according to the second virtual point coordinates of each second interface includes:

[0024] The first body-center coordinates of the first grid cells where each first interface in the first interface subsets of all processes is located are collected to form a first body-center coordinate set;

[0025] For each process, searching the first body center coordinates closest to the second virtual point in the first body center coordinate set according to the second virtual point coordinates of each second interface;

[0026] Determine the target first grid unit where the first body center coordinates closest to the second virtual point are located as the second approximate host unit, determine the process where the target first grid unit is located as the process where the second approximate host unit is located, and determine the grid number of the target first network unit as the grid number of the second approximate host unit.

[0027] Further, for each process, determining the first host unit of each first interface according to the first approximate host unit of the first virtual point of each first interface includes:

[0028] For each process, taking the first approximate host unit of the first virtual point of each first interface as the starting unit, searching for host units in the second subgrid area of ​​the process where the first approximate host unit is located according to the barycentric coordinate method, and obtaining a first search result;

[0029] Determining whether there is a real first host unit according to the first search result;

[0030] If there is no real first host unit, the first approximate host unit is determined as the first host unit of the first interface.

[0031] Further, for each process, determining the second host unit of each second interface according to the second approximate host unit of the second virtual point of the second interface includes:

[0032] For each process, taking the second approximate host unit of the second virtual point of each second interface as the starting unit, searching for host units in the first subgrid area of ​​the process where the second approximate host unit is located according to the barycentric coordinate method, and obtaining a second search result;

[0033] Determining whether there is a real second host unit according to the second search result;

[0034] If there is no real second host unit, the second approximate host unit is determined as the second host unit of the second interface.

[0035] Further, the flow field value transfer between the first grid area and the second grid area is realized according to the field variables in the first host unit of all processes and the field variables in the second host unit of all processes, including:

[0036] Assigning a value to a first virtual point according to the field variable of the first host unit of each process, and assigning a value to a second virtual point according to the field variable of the second host unit of each process;

[0037] The value assigned to the first virtual point and the value assigned to the second virtual point are both sent to the process where the corresponding interface is located, so as to realize the flow field value transfer between the first grid area and the second grid area.

[0038] As another aspect of the present invention, a grid interface host unit parallel search device is provided, which is used to implement the grid interface host unit parallel search method described above, and includes:

[0039] A partitioning module, used for partitioning any two paired first grid areas and second grid areas to obtain first sub-grid areas and second sub-grid areas that are the same number as the number of processes, wherein the first grid area includes a first interface set, the second grid area includes a second interface set, the first grid area and the second grid area are connected with the second interface set through the first interface set, each process includes a first sub-grid area and a second sub-grid area, the first sub-grid area of ​​at least one process includes a first interface subset, the second sub-grid area of ​​at least one process includes a second interface subset, the first interface subsets of all processes form the first interface set, and the second interface subsets of all processes form the second interface set;

[0040] A virtual point coordinate determination module, used to respectively determine the first virtual point coordinates of each first interface in the first interface subset of each process and the second virtual point coordinates of each second interface in the second interface subset;

[0041] A search module is used to search, for each process, a first approximate host unit of the first virtual point in the second grid units corresponding to the second interface subsets of all processes according to the first virtual point coordinates of each first interface, and to search, for each process, a second approximate host unit of the second virtual point in the first grid units corresponding to the first interface subsets of all processes according to the second virtual point coordinates of each second interface;

[0042] a host unit determination module, configured to determine, for each process, a first host unit of each first interface according to a first approximate host unit of a first virtual point of the first interface, and to determine a second host unit of each second interface according to a second approximate host unit of a second virtual point of the second interface;

[0043] The flow field value transfer module is used to realize the flow field value transfer between the first grid area and the second grid area according to the field variables in the first host unit of all processes and the field variables in the second host unit of all processes.

[0044] As another aspect of the present invention, a storage medium is provided, wherein the storage medium is used to store computer instructions, and when the computer instructions are loaded and executed by a processor, the aforementioned parallel search method for grid interface host units is implemented.

[0045] The grid interface host unit parallel search method provided by the present invention determines the approximate host unit by determining the virtual point in the interface set of the paired grid area, and then determines the host unit based on the approximate host unit, so as to realize the flow field value transfer of the paired grid area under multiple processes, thereby realizing the parallel search of the grid interface host unit. Therefore, the grid interface host unit parallel search method provided by the present invention can realize the search of the grid interface host unit in parallel mode. In addition, the grid interface host unit parallel search method of the present invention can ensure that when the real host unit is not found in the end and the approximate host unit is used as the host unit, the value on the virtual point will not deviate too much. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] The accompanying drawings are used to provide further understanding of the present invention and constitute a part of the specification. Together with the following specific embodiments, they are used to explain the present invention, but do not constitute a limitation of the present invention.

[0047] Figure 1 A schematic diagram of a mesh interface processed by the prior art.

[0048] Figure 2 Schematic diagram of the host cell search path of the virtual point being interrupted by the process grid boundary after the grid is partitioned in the prior art.

[0049] Figure 3 The present invention provides a flow chart of a method for parallel searching of grid interface host units.

[0050] Figure 4 A flowchart of the specific implementation process of the grid interface host unit parallel search method provided by the present invention.

[0051] Figure 5A flow chart for determining virtual point coordinates provided by the present invention.

[0052] Figure 6 A flowchart of the first approximate host unit search provided by the present invention.

[0053] Figure 7 A flowchart of the second approximate host unit search provided by the present invention.

[0054] Figure 8 This is a schematic diagram of the principle of the barycentric coordinate method provided by the present invention.

[0055] Figure 9a Schematic diagram of the square cavity flow model driven by the infinitely long cavity top plate provided by the present invention.

[0056] Figure 9b Schematic diagram of the square cavity flow grid driven by the infinitely long cavity top plate provided by the present invention.

[0057] Fig.10a for Figure 9a Schematic diagram of the model after the model is partitioned.

[0058] Fig.10b for Figure 9b Schematic diagram of the grid after the grid is partitioned.

[0059] Fig.11 This is a schematic diagram of the distribution of virtual points on the interface of the inner and outer square areas, approximate host units, and host units provided by the present invention.

[0060] Fig.12 A schematic diagram of a situation in which a host unit search provided by the present invention is blocked by a process boundary.

[0061] Fig.13a This is a schematic diagram of the 10-process parallel computing results provided by the present invention.

[0062] Fig.13b This is a schematic diagram of the results of serial calculation without an interface provided by the present invention.

[0063] Fig.14 This is a schematic diagram of the propeller open water model provided by the present invention.

[0064] Fig.15 A schematic diagram of the propeller open water grid provided by the present invention.

[0065] Fig.16a The pressure cloud map of the propeller blade surface after the partitioning process provided by the present invention.

[0066] Fig.16b This is a pressure cloud diagram of the propeller blade surface that has not been partitioned in the prior art.

[0067] Fig.17 This is a structural block diagram of the grid interface host unit parallel search device provided by the present invention.

[0068] Fig.18 This is a structural block diagram of the electronic device provided by the present invention. DETAILED DESCRIPTION

[0069] It should be noted that, in the absence of conflict, the embodiments of the present invention and the features in the embodiments may be combined with each other. The present invention will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0070] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiment of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiment of the present invention. Obviously, the described embodiment is only a part of the embodiment 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 making creative work should fall within the scope of protection of the present invention.

[0071] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so as to describe the embodiments of the present invention described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0072] In this embodiment, a grid interface host unit parallel search method is provided. Figure 3 is a flow chart of a method for parallel searching of grid interface host units according to an embodiment of the present invention. Figure 3 As shown, including:

[0073] S100, partitioning any two paired first grid areas and second grid areas to obtain first sub-grid areas and second sub-grid areas that are the same number as the number of processes, wherein the first grid area includes a first interface set, the second grid area includes a second interface set, the first grid area and the second grid area are connected to the second interface set through the first interface set, each process includes a first sub-grid area and a second sub-grid area, the first sub-grid area of ​​at least one process includes a first interface subset, the second sub-grid area of ​​at least one process includes a second interface subset, the first interface subsets of all processes form the first interface set, and the second interface subsets of all processes form the second interface set;

[0074] It should be noted that, in the embodiment of the present invention, the set of surface types that are interfaces in the first grid area forms a first interface set, and similarly, the set of surface types that are interfaces in the second grid area forms a second interface set. Since the first grid area and the second grid area are both divided into the same number of first sub-grid areas and second sub-grid areas based on the number of processes, the set of surface types that are interfaces in the first sub-grid area forms a first interface subset set, and the set of surface types that are interfaces in the second sub-grid area forms a second interface subset set. It should also be understood here that the first interface subset set of all processes forms a first interface set, and the second interface subset set of all processes forms a second interface set.

[0075] Specifically, for example, if the number of processes is 10, the paired first grid area and second grid area can be partitioned to obtain 10 first sub-grid areas and 10 second sub-grid areas. The first grid area and the second grid area are connected through interfaces. The first grid area includes a first interface set, and the second grid area includes a second interface set. The first interface set of the first grid area is connected with the second interface set of the second grid area. After the above 10 processes are divided into 10 first sub-grid areas and 10 second sub-grid areas, each process includes a first sub-grid area and a second sub-grid area. When all the first sub-grid areas and second sub-grid areas after partitioning have their respective surface types including interfaces, the first sub-grid areas and second sub-grid areas of all processes include a subset of interfaces; of course, after partitioning, there may be a situation where the surface types of the first sub-grid areas and second sub-grid areas in some processes do not include interfaces. It can be understood that this situation does not affect the subsequent search of host units.

[0076] S200, respectively determining the first virtual point coordinates of each first interface in the first interface subset and the second virtual point coordinates of each second interface in the second interface subset of each process;

[0077] In the embodiment of the present invention, it is necessary to determine the first virtual point coordinates for each first interface in the first interface subset in each process, and similarly determine the second virtual point coordinates for each second interface in the second interface subset in each process.

[0078] It should be understood that, for each process, the first sub-grid area includes multiple first grid units, the second sub-grid area includes multiple second grid units, and for the multiple first interfaces included in the first interface subset, each first interface in the first interface subset belongs to a first grid unit, but not all first grid units have a first interface. Similarly, for the multiple second interfaces included in the second interface subset, each second interface in the second interface subset belongs to a second grid unit, but not all second grid units have a second interface.

[0079] S300, for each process, searching for a first approximate host unit of the first virtual point in the second grid cells corresponding to the second interface subsets of all processes according to the first virtual point coordinates of each first interface, and searching for a second approximate host unit of the second virtual point in the first grid cells corresponding to the first interface subsets of all processes according to the second virtual point coordinates of each second interface;

[0080] In an embodiment of the present invention, for each process, after determining the coordinates of the first virtual point of each first interface, the first approximate host unit of the first virtual point is searched in the second grid cells corresponding to the second interface subsets of all processes. Specifically, it can be understood that, for example, there are 10 processes in total, and each process has a second interface subset. Therefore, the 10 processes correspond to 10 second interface subsets, and each second interface subset corresponds to multiple second grid cells. Therefore, the first approximate host unit of the first virtual point is determined by searching all the second grid cells corresponding to the 10 second interface subsets; similarly, the second approximate host unit of the second virtual point can be determined by searching the multiple first grid cells corresponding to the 10 first interface subsets of the 10 processes.

[0081] S400, for each process, determining a first host unit of each first interface according to a first approximate host unit of a first virtual point of each first interface, and determining a second host unit of each second interface according to a second approximate host unit of a second virtual point of each second interface;

[0082] In an embodiment of the present invention, for each process, the first approximate host unit of the first virtual point of each first interface is further determined to determine whether the first approximate host unit is the first host unit of the first interface. Similarly, the second approximate host unit of the second virtual point of each second interface is further determined to determine whether the second approximate host unit is the second host unit of the second interface.

[0083] S500: Implement flow field value transfer between the first grid area and the second grid area according to the field variables in the first host unit of all processes and the field variables in the second host unit of all processes.

[0084] After the first host unit and the second host unit of each process are determined as above, the field variables of the first host unit are sent to the corresponding first interface, and the field variables of the second host unit are sent to the corresponding second interface, thereby realizing the flow field value transfer between the first grid area and the second grid area.

[0085] In summary, the grid interface host unit parallel search method provided by the present invention determines the approximate host unit by determining the virtual point in the interface set of the paired grid area, and then determines the host unit based on the approximate host unit, thereby realizing the multi-process flow field value transfer of the paired grid area, thereby realizing the parallel search of the grid interface host unit. Therefore, the grid interface host unit parallel search method provided by the present invention can realize the search of the grid interface host unit in parallel mode. In addition, the grid interface host unit parallel search method of the present invention can ensure that when the real host unit is not found in the end and the approximate host unit is used as the host unit, the value on the virtual point will not deviate too much.

[0086] In the embodiment of the present invention, Figure 4 As shown, for the two grid areas G1 and G2, the first interface set of the first grid area G1 is If1, the second interface set of the second grid area G2 is If2, If1 and If1 are connected to each other to achieve the connection between the G1 and G2 grid blocks, and the subscripts 1 and 2 are the grid area numbers.

[0087] Use MPI (Message Passing Interface) for parallel computing, and use a hierarchical partitioning algorithm (such as the Metis partitioning algorithm) to partition G1 and the grid G2 according to the number of processes. After partitioning, each process contains a first sub-grid area G of G1 s1 And a second sub-grid area G of G2 s1 . G s1 The first interface subset included is If s1 , Gs2 The second interface subset included is If s2 .

[0088] In the embodiment of the present invention, the first sub-grid area of ​​each process includes a plurality of first grid units, and the second sub-grid area of ​​each process includes a plurality of second grid units, and the first virtual point coordinates of each first interface in the first interface subset of each process and the second virtual point coordinates of each second interface in the second interface subset are determined respectively, such as Figure 5 As shown, including:

[0089] S210, for each process, calculating first body-centered coordinates and first face-centered coordinates of all first grid cells in the first sub-grid area, and calculating second body-centered coordinates and second face-centered coordinates of all second grid cells in the second sub-grid area;

[0090] In the embodiment of the present invention, for each process, G is calculated. s1 and G s2 The body-centered coordinates of all mesh volume units and the face-centered coordinates of all face units. s1 The body-centered coordinates of all grids constitute the first body-centered coordinates of the first sub-grid and the first face-centered coordinates of the first sub-grid. s2 The body-centered coordinates of all grids constitute the second body-centered coordinates of the second sub-grid and the second face-centered coordinates of the second sub-grid. The calculation of the specific body-centered coordinates can be understood as the average of the sum of the face-centered coordinates of all faces constituting the body, and the calculation of the face-centered coordinates can be understood as the average of the sum of the coordinates of all points constituting the face. The specific calculation methods are well known to those skilled in the art and will not be repeated here.

[0091] S220. Calculate the first virtual point coordinates of the first interface according to the first face-center coordinates of each first interface in the first interface subset of the process and the first body-center coordinates of the first grid unit where the first interface is located, and calculate the second virtual point coordinates of the second interface according to the second face-center coordinates of each second interface in the second interface subset of the process and the second body-center coordinates of the second grid unit where the second interface is located.

[0092] In an embodiment of the present invention, the first virtual point coordinates of the first interface are calculated based on the first body-center coordinates and the first face-center coordinates of the first grid unit where each first interface in the first interface subset determined above is located. Similarly, the second virtual point coordinates of the second interface are calculated based on the second body-center coordinates and the second face-center coordinates of the second grid unit where each second interface in the second interface subset is located.

[0093] Specifically, the calculation formulas of the first virtual point coordinates and the second virtual point coordinates are both:

[0094] C virtual-Point =C face +|C face -C element |e,

[0095] Among them, C face represents the coordinates of the center of the first interface or the second interface, C element represents the body center coordinate of the first grid cell where the first interface is located or the second grid cell where the second interface is located, C virtual-P represents the coordinates of the first virtual point or the second virtual point, |C face -C element | represents the distance from the center of the first interface to the center of the first grid unit, or the distance from the center of the second interface to the center of the second grid unit, and e represents the unit vector in the external normal direction of the first interface or the unit vector in the external normal direction of the second interface.

[0096] In the embodiment of the present invention, for each process, according to the coordinates of the first virtual point of each first interface, the first approximate host unit of the first virtual point is searched in the second grid units corresponding to the second interface subsets of all processes, such as Figure 6 As shown, including:

[0097] S310, collecting the second body-center coordinates of the second grid cells where each second interface in the second interface subsets of all processes is located to form a second body-center coordinate set;

[0098] In the embodiment of the present invention, it should be understood that in order to realize the search of the first approximate host unit, the second body-center coordinates of the second grid unit where each second interface is located in the second interface subset of all processes are collected to form a second body-center coordinate set. For example, if there are 10 processes in total, the second body-center coordinates of the second grid unit where each second interface is located in the second interface subset within the 10 processes are collected.

[0099] S320, for each process, searching for a second body-center coordinate closest to the first virtual point in the second body-center coordinate set according to the first virtual point coordinate of each first interface;

[0100] The second body-center coordinate closest to the first virtual point is found in the second body-center coordinate set according to the closest distance method.

[0101] S330, determining the target second grid unit where the second body center coordinates closest to the first virtual point are located as the first approximate host unit, determining the process where the target second grid unit is located as the process where the first approximate host unit is located, and determining the grid number of the target second grid unit as the grid number of the first approximate host unit.

[0102] The target second grid unit where the second body center coordinates closest to the first virtual point are located is used as the first approximate host unit.

[0103] In the embodiment of the present invention, for each process, according to the coordinates of the second virtual point of each second interface, the first grid cells corresponding to the first interface subset of all processes are searched for the second approximate host cell of the second virtual point, such as Figure 7 As shown, including:

[0104] S340, collecting the first body-center coordinates of the first grid cells where each first interface in the first interface subsets of all processes is located to form a first body-center coordinate set;

[0105] S350, for each process, searching for the first body center coordinate closest to the second virtual point in the first body center coordinate set according to the second virtual point coordinate of each second interface;

[0106] S360, determine the target first grid unit where the first body center coordinates closest to the second virtual point are located as the second approximate host unit, determine the process where the target first grid unit is located as the process where the second approximate host unit is located, and determine the grid number of the target first network unit as the grid number of the second approximate host unit.

[0107] Similarly, similar to finding the first approximate host unit, when finding the second approximate host unit, the first body-centered coordinate set is also formed first, and the nearest distance method is used to find the first body-centered coordinate closest to the second virtual point in the first body-centered coordinate set, and the target first grid unit where the first body-centered coordinate closest to the second virtual point is found is used as the second approximate host unit.

[0108] It should be understood that each process searches for If s1 and If s2 The approximate host unit for each virtual point in s1 Virtual point approximate host unit search: collect all in-process If s2 The body center coordinates of the volume mesh where the collected body center coordinates are If2Vc, and then If2Vc is sent to each process. s1 For each virtual point of the interface, find the body center coordinates closest to the virtual point in If2Vc. The process and grid unit number of the grid represented by the body center coordinates are the process and grid number of the approximate host unit. Similarly: for If s2 Virtual point approximate host unit search: collect all in-process If s1The body center coordinates of the volume mesh where the collected body center coordinates are If1Vc, and then If1Vc is sent to each process. s2 For each virtual point, find the body center coordinates closest to the virtual point in If1Vc. The process and grid unit number of the unit represented by the body center coordinates are the process and grid number of the approximate host unit.

[0109] In the embodiment of the present invention, for each process, determining the first host unit of each first interface according to the first approximate host unit of the first virtual point of each first interface includes:

[0110] For each process, taking the first approximate host unit of the first virtual point of each first interface as the starting unit, searching for host units in the second subgrid area of ​​the process where the first approximate host unit is located according to the barycentric coordinate method, and obtaining a first search result;

[0111] Determining whether there is a real first host unit according to the first search result;

[0112] If there is no real first host unit, the first approximate host unit is determined as the first host unit of the first interface.

[0113] In the embodiment of the present invention, for each process, determining the second host unit of the second interface according to the second approximate host unit of the second virtual point of each second interface includes:

[0114] For each process, taking the second approximate host unit of the second virtual point of each second interface as the starting unit, searching for host units in the first subgrid area of ​​the process where the second approximate host unit is located according to the barycentric coordinate method, and obtaining a second search result;

[0115] Determining whether there is a real second host unit according to the second search result;

[0116] If there is no real second host unit, the second approximate host unit is determined as the second host unit of the second interface.

[0117] It should be understood that in each process, based on the virtual point coordinates and the corresponding approximate host unit, the approximate host unit is used as the starting unit, and the barycentric coordinate method is used to search for the host unit in the subgrid of the process where the approximate host unit is located. If the real host unit is not found at the grid boundary and the process boundary, the approximate host unit is used as the host unit.

[0118] In the embodiment of the present invention, the principle of the barycentric coordinate method is as follows Figure 8 As shown: For the surface composed of n1, n2, and n3, the vector from n1 to n2 is The vector from n1 to n3 is The vector from n1 to the virtual point virtual-point is The vector from n1 to the center of the unit body is Calculate the position of the point and the polyhedron temp:

[0119]

[0120] If for all faces of a certain grid, the point and polyhedron position judgment quantity temp is greater than or equal to 0, it means that the virtual point is inside the unit, and the unit is the host unit of the virtual point on the interface; if for one or more of the faces, the point and polyhedron position judgment quantity temp is less than 0, it means that the virtual point is outside these faces, and a face is randomly selected from such faces as the next search unit until the grid cell containing the virtual point is found. This cycle of operation forms the search path of the host unit.

[0121] It should be understood that in the embodiment of the present invention, by using the closest distance as a judgment scheme, the probability that the approximate host unit and the real host unit (the virtual point is in the unit) are in the same process (the same sub-grid) is increased. After the approximate host unit is found, in the sub-grid where the approximate host unit is located, according to the virtual point coordinates, the approximate host unit is used as the starting search unit, and the barycentric coordinate method is used to find the real host unit in the current sub-grid. When the real host unit is found or the search path reaches the grid boundary or the process boundary, the search is stopped. When the real host unit is still not found after the search is stopped, the approximate host unit is used as the host unit. At this time, the host unit finally determined is either an approximate host unit or a real host unit.

[0122] In an embodiment of the present invention, the flow field value transfer between the first grid area and the second grid area is realized according to the field variables in the first host unit of all processes and the field variables in the second host unit of all processes, including:

[0123] Assigning a value to a first virtual point according to the field variable of the first host unit of each process, and assigning a value to a second virtual point according to the field variable of the second host unit of each process;

[0124] The value assigned to the first virtual point and the value assigned to the second virtual point are both sent to the process where the corresponding interface is located, so as to realize the flow field value transfer between the first grid area and the second grid area.

[0125] It should be understood that the virtual point is assigned a value using the field variable in the host unit, and the value on the virtual point is sent to the process where the interface is located, so as to realize the flow field value transfer between G1 and G2.

[0126] In summary, the grid interface host unit parallel search method provided by the present invention, first, in the interface grid of the paired grid, the grid unit closest to the virtual point is found as the approximate host unit, which can ensure that when the real host unit is not found in the end and the approximate host unit is used as the host unit, the value on the virtual point will not deviate too much. Secondly, using the closest distance as the judgment scheme increases the probability that the approximate host unit and the real host unit are in the same process (the same sub-grid). After the approximate host unit is found, in each process, according to the virtual point coordinates, the approximate host unit is used as the starting search unit, and the barycentric coordinate method is used to find the real host unit in the sub-grid where the approximate host unit is located. When the real host unit is found or the search path reaches the grid boundary or the process boundary, the search is stopped. When the real host unit is still not found after the search stops, the approximate host unit is used as the host unit. At this time, the host unit finally determined is either an approximate host unit or a real host unit. Therefore, the grid interface host unit parallel search method of the present invention realizes cross-process search in parallel mode.

[0127] Combine the following Figures 9a to 13b The specific implementation process of the grid interface host unit parallel search method according to an embodiment of the present invention is described.

[0128] like Figure 9a and Figure 9b As shown in the figure, the infinitely long top plate drives the numerical calculation of the square cavity flow. The grid is a three-dimensional mesh. There is only one layer of grid in the z direction and the surface in the z direction is set as the symmetry surface (Symmetry) to represent the infinitely long square cavity. The whole model is a nested square. The inner and outer square areas are connected by the interface (Interface). The top surface type is velocity inlet (Velocity-In), and the surrounding surface types are wall (Wall).

[0129] In this embodiment, 10 processes are used for parallel partitioning. Fig.10a and Fig.10b As shown in the figure, the model and grid after partitioning, when parallel partitioning, the inner and outer square computational domains are divided into 10 blocks, and each process has one block of the inner and outer domains. Fig.10a It can be seen that the interface between the inner and outer square areas, and the partition boundary Process-Boundary after the inner and outer square areas are partitioned in parallel.

[0130] According to the method of calculating virtual point coordinates mentioned above, the virtual point coordinates of the interface of each grid unit in each sub-grid area after partitioning are calculated, and the approximate host unit of each virtual point is found. After the approximate host unit is found, the approximate host unit is used as the starting search unit, and the barycentric coordinate method is used to find the real host unit.

[0131] like Fig.11 As shown, the distribution of virtual point coordinates (red dots), approximate host unit body center coordinates (blank boxes), and host unit body center coordinates (blue triangles). It can be understood here that Fig.11 If the virtual point in the image and the host unit are in the same grid unit, the real host unit is found. That is, the red dot and the blue triangle in the same grid unit indicate that the real host unit is found. If there is a blank box, it indicates the approximate location of the host unit.

[0132] exist Fig.11 In , there is a situation where the initial host unit (i.e., the approximate host unit) and the final host unit (i.e., the real host unit) of Grid1 are different, which indicates that it is necessary to use the barycentric coordinate method to search for the host unit after obtaining the approximate host unit in the embodiment of the present invention. Fig.12 In the green dotted circle, we can see that the search path of the virtual point is blocked by the process boundary. At this time, the approximate host unit is used as the final host unit. Since the approximate host unit is adjacent to the unit where the virtual point is located, it will not affect the calculation results. Fig.13a and Fig.13b When the Reynolds number (Re) is 1000, the calculation result under the process of Example 10 of the present invention is used ( Fig.13a ) and the calculation results under the serial condition without interface ( Fig.13b )contrast, Fig.13a and Fig.13b The figure in the middle is the velocity cloud in the x direction.

[0133] Combine the following Figure 14 to Figure 16b The feasibility of the parallel search method for grid interface host units according to an embodiment of the present invention is illustrated.

[0134] In this embodiment, the propeller is calculated in open water, that is, the propeller rotates alone in a uniform water flow. The model and mesh are as follows Fig.14 and Fig.15 As shown in the figure, the outer domain grid is the water area, the inner domain grid contains the propeller, the outer domain grid does not move, the inner domain grid rotates, and the inner and outer domain grids are connected by the interface. The relevant parameters are set as follows: the water flow velocity is 1.8m / s, the propeller speed n=18rad / s, and the water density ρ=996.76kg / m 3 , dynamic viscosity coefficient μ=0.000868N·s / m 2 .

[0135] In this embodiment, the calculation adopts 8 processes, and the grid interface host unit parallel search method of the embodiment of the present invention is used to process the interface, and the calculation result is compared with the processing method without partitioning in the prior art. Fig.16a and Fig.16b is a schematic diagram comparing the propeller surface pressure cloud map with the processing method without partitioning in the prior art. Table 1 and Table 2 are the propeller thrust coefficient k T and torque coefficient K Q Comparison of model test results with the prior art treatment method without partitioning.

[0136] Table 1 Comparison of thrust coefficient and existing technology model test results

[0137] Calculation results Model test error 0.214 0.210 1.9%

[0138] Table 2 Comparison of torque coefficient and existing technology model test results

[0139] Calculation results Model test error 0.026 0.02599 0.038%

[0140] According to the comparison of this embodiment, the grid interface host unit parallel search method of the present invention realizes the search of grid interface host units in parallel mode, and the results are similar to those obtained by model testing in the prior art, which proves that the grid interface host unit parallel search method of the present invention is not only feasible, but also can obtain accurate search results.

[0141] As another embodiment of the present invention, a grid interface host unit parallel search device 10 is provided for implementing the grid interface host unit parallel search method described above, wherein: Fig.17 As shown, including:

[0142] A partitioning module 100 is used to partition any two paired first grid areas and second grid areas to obtain first sub-grid areas and second sub-grid areas that are the same number as the number of processes, wherein the first grid area includes a first interface set, the second grid area includes a second interface set, the first grid area and the second grid area are connected to the second interface set through the first interface set, each process includes a first sub-grid area and a second sub-grid area, the first sub-grid area of ​​at least one process includes a first interface subset, the second sub-grid area of ​​at least one process includes a second interface subset, the first interface subsets of all processes form the first interface set, and the second interface subsets of all processes form the second interface set;

[0143] A virtual point coordinate determination module 200, for respectively determining the first virtual point coordinates of each first interface in the first interface subset and the second virtual point coordinates of each second interface in the second interface subset of each process;

[0144] The search module 300 is used to search, for each process, a first approximate host unit of the first virtual point in the second grid units corresponding to the second interface subsets of all processes according to the first virtual point coordinates of each first interface, and to search, for each process, a second approximate host unit of the second virtual point in the first grid units corresponding to the first interface subsets of all processes according to the second virtual point coordinates of each second interface;

[0145] A host unit determination module 400 is used to determine, for each process, a first host unit of each first interface according to a first approximate host unit of a first virtual point of the first interface, and to determine a second host unit of each second interface according to a second approximate host unit of a second virtual point of the second interface;

[0146] The flow field value transfer module 500 is used to realize the flow field value transfer between the first grid area and the second grid area according to the field variables in the first host unit of all processes and the field variables in the second host unit of all processes.

[0147] The grid interface host unit parallel search device provided by the present invention determines the approximate host unit by determining the virtual point in the interface set of the paired grid area, and then determines the host unit based on the approximate host unit, thereby realizing the multi-process flow field value transfer of the paired grid area, thereby realizing the parallel search of the grid interface host unit. Therefore, the grid interface host unit parallel search device provided by the present invention can realize the search of the grid interface host unit in the parallel mode. In addition, the grid interface host unit parallel search device of the present invention can ensure that when the real host unit is not found in the end and the approximate host unit is used as the host unit, the value on the virtual point will not deviate too much.

[0148] The specific working process of the grid interface host unit parallel search device provided by the present invention can refer to the description of the grid interface host unit parallel search method above, which will not be repeated here.

[0149] As another embodiment of the present invention, a storage medium is provided, wherein the storage medium is used to store computer instructions, and when the computer instructions are loaded and executed by a processor, the aforementioned parallel search method for grid interface host units is implemented.

[0150] In an embodiment of the present invention, a non-transitory computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions can execute the grid interface host unit parallel search method in any of the above method embodiments. The storage medium can be a disk, an optical disk, a read-only memory (ROM), a random access memory (RAM), a flash memory, a hard disk (HDD) or a solid-state drive (SSD), etc.; the storage medium can also include a combination of the above types of memory.

[0151] As another embodiment of the present invention, an electronic device is provided, which includes a memory and a processor, the memory and the processor are communicatively connected, the memory is used to store computer instructions, and the processor is used to load and execute the computer instructions to implement the parallel search method for grid interface host units mentioned above.

[0152] like Fig.18 As shown, the electronic device 80 may include: at least one processor 81, such as a CPU (Central Processing Unit), at least one communication interface 83, a memory 84, and at least one communication bus 82. The communication bus 82 is used to realize the connection and communication between these components. The communication interface 83 may include a display screen (Display) and a keyboard (Keyboard), and the optional communication interface 83 may also include a standard wired interface and a wireless interface. The memory 84 may be a high-speed RAM memory (Random Access Memory, volatile random access memory) or a non-volatile memory (non-volatile memory), such as at least one disk storage. The memory 84 may optionally be at least one storage device located away from the aforementioned processor 81. The memory 84 stores an application program, and the processor 81 calls the program code stored in the memory 84 to execute any of the above method steps.

[0153] The communication bus 82 may be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus. The communication bus 82 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.18Only 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.

[0154] Among them, the memory 84 may include a volatile memory (English: volatile memory), such as a random access memory (English: random-access memory, abbreviated: RAM); the memory may also include a non-volatile memory (English: non-volatile memory), such as a flash memory (English: flash memory), a hard disk drive (English: hard disk drive, abbreviated: HDD) or a solid-state drive (English: solid-state drive, abbreviated: SSD); the memory 84 may also include a combination of the above types of memory.

[0155] The processor 81 may be a central processing unit (CPU), a network processor (NP), or a combination of a CPU and a NP.

[0156] The processor 81 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof. The PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL), or any combination thereof.

[0157] Optionally, the memory 84 is also used to store program instructions. The processor 81 can call the program instructions to implement the present invention. Figure 3 The grid interface host unit parallel search method shown in the embodiment.

[0158] It is to be understood that the above embodiments are merely exemplary embodiments used to illustrate the principles of the present invention, but the present invention is not limited thereto. For those of ordinary skill in the art, various modifications and improvements can be made without departing from the spirit and essence of the present invention, and these modifications and improvements are also considered to be within the scope of protection of the present invention.

Claims

1. A parallel search method for host units at grid interfaces, It is characterized in that include: Partition any two paired first grid areas and second grid areas to obtain first sub-grid areas and second sub-grid areas that are the same number as the number of processes, wherein the first grid area includes a first interface set, the second grid area includes a second interface set, the first grid area and the second grid area are connected with the second interface set through the first interface set, each process includes a first sub-grid area and a second sub-grid area, the first sub-grid area of ​​at least one process includes a first interface subset, the second sub-grid area of ​​at least one process includes a second interface subset, the first interface subsets of all processes form the first interface set, and the second interface subsets of all processes form the second interface set; Determine the first virtual point coordinates of each first interface in the first interface subset and the second virtual point coordinates of each second interface in the second interface subset of each process respectively; For each process, searching for a first approximate host unit of the first virtual point in the second grid cells corresponding to the second interface subsets of all processes according to the first virtual point coordinates of each first interface, and searching for a second approximate host unit of the second virtual point in the first grid cells corresponding to the first interface subsets of all processes according to the second virtual point coordinates of each second interface; For each process, determining a first host unit of each first interface according to a first approximate host unit of a first virtual point of the first interface, and determining a second host unit of each second interface according to a second approximate host unit of a second virtual point of the second interface; The flow field value transfer between the first grid area and the second grid area is realized according to the field variables in the first host unit of all processes and the field variables in the second host unit of all processes.

2. The grid interface host unit parallel search method according to claim 1, It is characterized in that The first sub-grid area of ​​each process includes a plurality of first grid units, and the second sub-grid area of ​​each process includes a plurality of second grid units. The first virtual point coordinates of each first interface in the first interface subset of each process and the second virtual point coordinates of each second interface in the second interface subset are determined respectively, including: For each process, calculating first body-centered coordinates and first face-centered coordinates of all first grid cells in the first sub-grid area, and calculating second body-centered coordinates and second face-centered coordinates of all second grid cells in the second sub-grid area; The first virtual point coordinates of the first interface are calculated based on the first face-center coordinates of each first interface in the first interface subset of the process and the first body-center coordinates of the first grid unit where the first interface is located, and the second virtual point coordinates of the second interface are calculated based on the second face-center coordinates of each second interface in the second interface subset of the process and the second body-center coordinates of the second grid unit where the second interface is located.

3. The grid interface host unit parallel search method according to claim 2, It is characterized in that The calculation formulas for the first virtual point coordinates and the second virtual point coordinates are both: C virtual-Point =C face +|C face -C element |e, Among them, C face represents the coordinates of the center of the first interface or the second interface, C element represents the body center coordinate of the first grid cell where the first interface is located or the second grid cell where the second interface is located, C virtual-Poin represents the coordinates of the first virtual point or the second virtual point, |C face -C element | represents the distance from the center of the first interface to the center of the first grid unit, or the distance from the center of the second interface to the center of the second grid unit, and e represents the unit vector in the external normal direction of the first interface or the unit vector in the external normal direction of the second interface.

4. The grid interface host unit parallel search method according to claim 1, It is characterized in that For each process, searching for a first approximate host unit of the first virtual point in the second grid units corresponding to the second interface subsets of all processes according to the first virtual point coordinates of each first interface includes: The second body-center coordinates of the second grid cells where each second interface in the second interface subsets of all processes is located are collected to form a second body-center coordinate set; For each process, searching for the second body-center coordinates closest to the first virtual point in the second body-center coordinate set according to the first virtual point coordinates of each first interface; The target second grid unit where the second body center coordinate closest to the first virtual point is located is determined as the first approximate host unit, the process where the target second grid unit is located is determined as the process where the first approximate host unit is located, and the grid number of the target second grid unit is determined as the grid number of the first approximate host unit.

5. The grid interface host unit parallel search method according to claim 1, It is characterized in that For each process, searching for a second approximate host unit of the second virtual point in the first grid units corresponding to the first interface subsets of all processes according to the second virtual point coordinates of each second interface includes: The first body-center coordinates of the first grid cells where each first interface in the first interface subsets of all processes is located are collected to form a first body-center coordinate set; For each process, searching the first body center coordinates closest to the second virtual point in the first body center coordinate set according to the second virtual point coordinates of each second interface; Determine the target first grid unit where the first body center coordinates closest to the second virtual point are located as the second approximate host unit, determine the process where the target first grid unit is located as the process where the second approximate host unit is located, and determine the grid number of the target first network unit as the grid number of the second approximate host unit.

6. The grid interface host unit parallel search method according to claim 1, It is characterized in that For each process, determining the first host unit of each first interface according to the first approximate host unit of the first virtual point of each first interface includes: For each process, taking the first approximate host unit of the first virtual point of each first interface as the starting unit, searching for host units in the second subgrid area of ​​the process where the first approximate host unit is located according to the barycentric coordinate method, and obtaining a first search result; Determining whether there is a real first host unit according to the first search result; If there is no real first host unit, the first approximate host unit is determined as the first host unit of the first interface.

7. The grid interface host unit parallel search method according to claim 1, It is characterized in that For each process, determining the second host unit of each second interface according to the second approximate host unit of the second virtual point of the second interface includes: For each process, taking the second approximate host unit of the second virtual point of each second interface as the starting unit, searching for host units in the first subgrid area of ​​the process where the second approximate host unit is located according to the barycentric coordinate method, and obtaining a second search result; Determining whether there is a real second host unit according to the second search result; If there is no real second host unit, the second approximate host unit is determined as the second host unit of the second interface.

8. The grid interface host unit parallel search method according to claim 1, It is characterized in that Implementing flow field value transfer between the first grid area and the second grid area according to the field variables in the first host unit of all processes and the field variables in the second host unit of all processes, including: Assigning a value to a first virtual point according to the field variable of the first host unit of each process, and assigning a value to a second virtual point according to the field variable of the second host unit of each process; The assignment result of the first virtual point and the assignment result of the second virtual point are both sent to the process where the corresponding interface is located, so as to realize the flow field value transfer between the first grid area and the second grid area.

9. A parallel search device for host units at a grid interface, used to implement the parallel search method for host units at a grid interface as claimed in any one of claims 1 to 8, It is characterized in that include: A partitioning module, used for partitioning any two paired first grid areas and second grid areas to obtain first sub-grid areas and second sub-grid areas that are the same number as the number of processes, wherein the first grid area includes a first interface set, the second grid area includes a second interface set, the first grid area and the second grid area are connected with the second interface set through the first interface set, each process includes a first sub-grid area and a second sub-grid area, the first sub-grid area of ​​at least one process includes a first interface subset, the second sub-grid area of ​​at least one process includes a second interface subset, the first interface subsets of all processes form the first interface set, and the second interface subsets of all processes form the second interface set; A virtual point coordinate determination module, used to respectively determine the first virtual point coordinates of each first interface in the first interface subset of each process and the second virtual point coordinates of each second interface in the second interface subset; A search module is used to search, for each process, a first approximate host unit of the first virtual point in the second grid units corresponding to the second interface subsets of all processes according to the first virtual point coordinates of each first interface, and to search, for each process, a second approximate host unit of the second virtual point in the first grid units corresponding to the first interface subsets of all processes according to the second virtual point coordinates of each second interface; a host unit determination module, configured to determine, for each process, a first host unit of each first interface according to a first approximate host unit of a first virtual point of the first interface, and to determine a second host unit of each second interface according to a second approximate host unit of a second virtual point of the second interface; The flow field value transfer module is used to realize the flow field value transfer between the first grid area and the second grid area according to the field variables in the first host unit of all processes and the field variables in the second host unit of all processes.

10. A storage medium, It is characterized in that Used to store computer instructions, which, when loaded and executed by a processor, implement the grid interface host unit parallel search method described in any one of claims 1 to 8.

Citation Information

Patent Citations

  • Method for interpolating structured grid non-matching interface

    CN104408773A

  • Method and device for processing helicopter flow field data

    CN112016165A

  • Efficient host unit searching method applicable to coupling CFD calculation of multiple sets of complex grids

    CN114004174A

  • Efficient nested grid host unit searching method in aircraft dynamic flow field analysis

    CN114119882A

  • Simulation method and device based on structured grid, terminal equipment and storage medium

    CN116151084A