Grid mapping method and device suitable for reactor core
Through multi-level grid strategy and volume weight weighting method, the problem of inefficient calculation accuracy and efficiency in physical-thermal coupling of core of nuclear reactor reactors is solved, and efficient and accurate grid mapping is achieved, ensuring the conservation of parameters.
Patent Information
- Application Number
- CN202311871663.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-12-29
- Publication Date
- 2025-07-01
AI Technical Summary
The calculation results of traditional spatial mapping methods in core physical-thermal coupling of nuclear reactor reactors have decreased accuracy and low efficiency, especially in large-scale grid calculations.
Using a multi-level grid strategy, a multi-level thicker grid is established through physical field fine grid reconstruction. First, quickly search for the correspondence relationship of the advanced coarse grid, then search for the correspondence relationship of the low-level fine grid in the advanced coarse grid, realize parameter mapping through volume weight weighting, and ensure the conservation of parameters before and after mapping through overall conservation repair.
The order of searches is greatly reduced, the efficiency of establishing the correspondence between the target field and the source field fine grid is improved, and the accuracy and consistency of the parameters before and after the mapping is ensured through overall conservation repair.
Smart Images
Figure CN120236033A_ABST
Abstract
Description
Technical Field
[0001] This application belongs to the technical field of nuclear reactors, and particularly relates to a grid mapping method and device applicable to the reactor core. Background Art
[0002] Spatial mapping of physical field parameters is involved in fields such as geographic information science, nuclear engineering, meteorology, and radar. Typical spatial mapping methods can be divided into two categories: interpolation methods and search methods. The search method is to search for one or a group of points closest to a certain grid in another spatial grid field, such as the nearest point method; the interpolation method realizes spatial mapping by establishing the relationship between two sets of grids through various weight coefficients, such as the inverse distance interpolation method and the Kriging interpolation method widely used in the field of geographic information science.
[0003] In order to provide more accurate prediction results, in recent years, there have been great improvements in aspects such as grid scale, simulation algorithms, and computing power. Especially with the rapid development of computer technology, supercomputers provide strong support for large-scale computing problems. However, computing resources are still far from meeting the needs of all walks of life, and it is necessary to improve the accuracy and efficiency of prediction from the algorithm level. Spatial grid mapping is the core of data interaction between different scales and different specialties. The accuracy and efficiency of this algorithm directly affect the accuracy of the mapped physical field. For phenomena such as the physical-thermal coupling of the nuclear engineering reactor core, a more efficient and accurate spatial grid mapping method is required to meet the design and safety analysis of nuclear power and nuclear power engineering. The traditional spatial mapping method has the following two deficiencies: 1) The accuracy of the calculation result after interpolation mapping decreases; 2) Some methods require a large amount of searching or solving large linear matrices, and the calculation efficiency decreases significantly when the grid scale is large. Therefore, it is very necessary to design and propose a more efficient and accurate spatial grid mapping method. Summary of the Invention
[0004] The purpose of this application is to provide a grid mapping method and device applicable to the reactor core, and solve the problems of the decrease in the accuracy of the calculation result and the decrease in the calculation efficiency of the traditional spatial mapping method in the prior art.
[0005] Technical solutions for achieving the purpose of this application:
[0006] In the first aspect of the embodiments of this application, a grid mapping method applicable to the reactor core is provided. The method includes:
[0007] Determine the multi-level grids of the target field T and the multi-level grids of the source field S;
[0008] For each target grid point in the target field T, determine the source grid point in the source field S that is closest to the target grid point, and obtain the closest source grid point corresponding to each target grid point;
[0009] Based on the values of the nearest source grid points and the values of the source grid points around the nearest source grid points that intersect with the corresponding target grid points, obtain the weighted values mapped from the source field S to each target grid point in the target field T.
[0010] Optionally, after obtaining the weighted values mapped from the source field to each target grid point in the target field T, it further includes:
[0011] Obtain the sum T_sum of the weighted values mapped from the source field S to all the target grid points in the target field T, and the sum S_sum of the values of all the source grid points in the source field S;
[0012] Correct the weighted values mapped from the source field S to each target grid point in the target field T based on the ratio of S_sum to T_sum.
[0013] Optionally, determining the multi-level grids of the target field T and the multi-level grids of the source field S specifically includes:
[0014] When the physical field meets the condition for defining multi-level grids, define multi-layer spatial grids using a preset data structure; the physical field is the target field T or the source field S; the data structure includes three layers, the first layer is the overall grid parameters, the second layer is the grid attributes of this level, and the third layer is the correspondence with the next-level grid.
[0015] Optionally, determining the multi-level grids of the target field T and the multi-level grids of the source field S specifically further includes:
[0016] If the physical field does not meet the condition for defining multi-level grids, form multi-level grids using an aggregation mode; the aggregation mode specifically includes any one of an equal-length aggregation mode, an equal-grid-number mode, and an equal-grid-volume mode.
[0017] Optionally, after determining the multi-level grids of the target field T and the multi-level grids of the source field S, it further includes:
[0018] Establish the correspondence between the high-level grid and the low-level grid of the target field T and the correspondence between the high-level grid and the low-level grid of the source field S; the correspondence includes the number of grid points included and the vertex coordinates of each grid point.
[0019] Optionally, for each target grid point in the target field T, determining the source grid point in the source field S that is closest to the target grid point to obtain the nearest source grid point corresponding to each target grid point specifically includes:
[0020] Starting from the high-level grid of the target field T, search for the correspondence between the target field T and the source field S level by level. For each target grid point in the target field T, determine the source grid point in the source field S that is closest to this target grid point, and obtain the closest source grid points corresponding to each of the target grid points.
[0021] Optionally, obtaining the weighted mapped values of each target grid point in the target field T from the source field S according to the values of the closest source grid points and the values of the source grid points around the closest source grid points that intersect with the corresponding target grid points specifically includes:
[0022] Determine whether the target grid point TP in the target field T intersects with the grid points around the corresponding closest source grid point;
[0023] If so, obtain the volume or the distance from the grid center point of the source grid points where the closest source grid point and its surrounding grids intersect with the target grid point TP, and obtain the value of the closest source grid point and the values of the source grid points around the closest source grid point that intersect with the target grid point TP;
[0024] Weight the value of the closest source grid point and the values of the source grid points around the closest source grid point that intersect with the target grid point TP to obtain the weighted mapped value of the target grid point TP from the source field S.
[0025] Optionally, weighting the value of the closest source grid point and the values of the source grid points around the closest source grid point that intersect with the target grid point TP to obtain the weighted mapped value of the target grid point TP from the source field S specifically includes:
[0026] According to the following formula (1), obtain the weighted mapped value TP of the target grid point TP from the source field S value ;
[0027]
[0028] In the formula, SP value is the source field value before mapping, M is the total number of grids in the source field S that intersect with the target grid point TP, α m is the volume fraction occupied by the m-th grid in the source field S that intersects with the target grid point TP, and (mi, mj, mk) is the coordinate of the m-th grid in the source field S that intersects with the target grid point TP.
[0029] The second aspect of the embodiments of the present application provides a grid mapping device applicable to a reactor core. The device includes:
[0030] The first determination module is used to determine the multi-level grids of the target field T and the multi-level grids of the source field S;
[0031] A second determination module, configured to determine, for each target grid point in the target field T, the source grid point in the source field S that is closest to the target grid point, and obtain the closest source grid points corresponding to the respective target grid points;
[0032] A numerical value acquisition module, configured to obtain the numerically weighted values mapped from the source field S to each target grid point in the target field T according to the numerical value of the closest source grid point and the numerical values of the source grid points around the closest source grid point that intersect with the corresponding target grid point.
[0033] A third aspect of the embodiments of the present application provides an electronic device, including a processor and a memory. Instructions are stored in the memory. When the processor executes the instructions, the processor executes any one of the methods provided in the first aspect of the embodiments of the present application.
[0034] A fourth aspect of the embodiments of the present application provides a computer-readable storage medium, characterized in that it is used to store a computer program, and the computer program includes any one of the methods provided in the first aspect of the embodiments of the present application.
[0035] A fifth aspect of the embodiments of the present application provides a computer program product, characterized in that it includes computer program code. When the computer program code is run on an electronic device, the electronic device executes any one of the methods provided in the first aspect of the embodiments of the present application.
[0036] The beneficial technical effects of the present application are as follows:
[0037] A grid mapping method and device applicable to a reactor core provided by the embodiments of the present application establish multi-level grids of each physical field by customizing or reconstructing an aggregation mode, and establish multi-level coarser grids through physical field fine grid reconstruction. First, the corresponding relationship of high-level coarse grids is quickly searched, and then the corresponding relationship of low-level fine grids is searched in the high-level coarse grids. Through this multi-level grid strategy, it is possible to avoid traversing all fine grids to find the grid point closest to the target field, greatly reducing the order of magnitude of the search times, thereby improving the establishment of the corresponding relationship between the fine grids of the target field and the source field, and realizing the mapping of parameters through methods such as volume weight weighting, and ensuring the conservation of parameters before and after mapping through overall conservation repair. Description of the Drawings
[0038] Figure 1 It is a schematic flowchart of a grid mapping method applicable to a reactor core provided by the embodiments of the present application;
[0039] Figure 2 It is a two-dimensional schematic diagram of the multi-level grids of the source field S in a grid mapping method applicable to a reactor core provided by the embodiments of the present application;
[0040] Figure 3 This is a two-dimensional schematic diagram of the multi-level grid of the target field T in a grid mapping method applicable to the reactor core provided by an embodiment of the present application. Detailed implementation manners
[0041] In order to enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the following described embodiments are only a part of the embodiments of the present application, rather than all of them. Based on the embodiments described in the present application, all other embodiments obtained by those skilled in the art without creative efforts are within the scope of protection of the present application.
[0042] To solve the problems of the prior art, a grid mapping method and device applicable to the reactor core provided by an embodiment of the present application are based on a multi-level grid strategy. By reconstructing the fine grid of the physical field, multi-level coarser grids are established. First, the corresponding relationship of the high-level coarse grid is quickly searched, and then the corresponding relationship of the low-level fine grid is searched in the high-level coarse grid. Through this multi-level grid strategy, it is avoided to traverse all the fine grids to find the grid point closest to the target field, greatly reducing the order of magnitude of the search times, improving the establishment of the corresponding relationship between the fine grids of the target field and the source field, and realizing the mapping of parameters through methods such as volume weight weighting, and ensuring the conservation of parameters before and after mapping through the repair of overall conservation.
[0043] The multi-level grid strategy refers to defining multi-layer grids of different scales for a certain physical field. For example, for the physics of the reactor core, component-level grids, nodal-level grids, and fine-mesh differential-level grids can be defined; for the thermal-hydraulics of the reactor core, component-level grids, sub-channel-level grids, and Computational Fluid Dynamics (CFD)-level grids can be defined.
[0044] Based on the above content, in order to clearly and detailedly illustrate the above advantages of the present application, the specific implementation manners of the present application will be described below with reference to the accompanying drawings.
[0045] See Figure 1 , which is a schematic flow chart of a grid mapping method applicable to the reactor core provided by an embodiment of the present application.
[0046] A grid mapping method applicable to the reactor core provided by an embodiment of the present application includes:
[0047] Step S101: Determine the multi-level grids of the target field T and the multi-level grids of the source field S;
[0048] Step S102: For each target grid point in the target field T, determine the source grid point in the source field S that is closest to the target grid point, and obtain the closest source grid point corresponding to each target grid point;
[0049] Step S103: Obtain the weighted values mapped from the source field S to each target grid point in the target field T based on the values of the nearest source grid points and the values of the source grid points that intersect with the corresponding target grid points around the nearest source grid points.
[0050] In the embodiment of the present application, based on the multi-level grid strategy, multi-level coarser grids are established through physical field fine grid reconstruction. First, quickly search for the corresponding relationships of the high-level coarse grids, and then search for the corresponding relationships of the low-level fine grids in the high-level coarse grids. Through this multi-level grid strategy, it is avoided to traverse all the fine grids to find the grid points closest to the target field, greatly reducing the order of the number of searches and improving the establishment of the corresponding relationships between the fine grids of the target field and the source field.
[0051] In some possible implementation manners of the present application, after step S103, it may further include:
[0052] Obtain the sum T_sum of the weighted values mapped from the source field S to all target grid points in the target field T, and the sum S_sum of the values of all source grid points in the source field S;
[0053] Correct the weighted values mapped from the source field S to each target grid point in the target field T based on the ratio of S_sum to T_sum.
[0054] It should be noted that for the conservation repair of the grid mapping parameters of the target field T, calculate the sum S_sum of the values of all grids in the source field, calculate the sum T_sum of the values of all grids in the target field T after mapping, calculate the ratio f = S_sum / T_sum of the two, and multiply the mapped values of all grids in the target field T by the ratio f to obtain the new mapped values of the target field grids.
[0055] In the embodiment of the present application, parameter mapping is achieved through methods such as volume weight weighting, and the conservation of parameters before and after mapping is ensured through overall conservation repair.
[0056] In an example, step S101 may specifically include:
[0057] When the physical field meets the conditions for defining multi-level grids (such as having the software source code for simulating the physical field), a preset data structure is used to define multi-layer spatial grids; the physical field is the target field T or the source field S; the data structure includes three layers, the first layer is the overall grid parameters, the second layer is the grid attributes of this level, and the third layer is the corresponding relationship with the next-level grid.
[0058] As an example, the first layer of the data structure includes: a multi-level spatial grid data structure, the number of grid layers, and the grid type; the second layer includes: grid attributes, the number of grids, the vertex coordinates of each grid, and the grid side length; the third layer includes: the correspondence with the next-level grids, the number of next-level grids included, the eight vertex coordinates of every other next-level grid included, and the relative position of the number of next-level grids in the current-level grid.
[0059] In another example, step S101 may specifically further include:
[0060] If the physical field does not meet the conditions for defining multi-level grids (such as only one layer of grids is defined, there is no software source code for simulating the physical field, and the calculation software only defines one type of grid for calculation), then a multi-level grid is formed using an aggregation mode; the aggregation mode specifically includes any one of an equal-length aggregation mode, an equal-grid-number mode, and an equal-grid-volume mode.
[0061] In specific implementation, a multi-level grid can be formed using an aggregation mode. Generally, 2 to 3 levels of grids are established, and the following aggregation modes can be selected:
[0062] 1) Equal-length aggregation mode: If the physical field uses regular structured grids, multi-level coarse grids with the same length can be formed along the coordinate directions according to a suitable length.
[0063] 2) Equal-grid-number mode: If the physical field uses unstructured grids, multi-level coarse grids with the same number of grids can be formed along the coordinate directions according to a suitable number.
[0064] 3) Equal-grid-volume mode: If the physical field uses regularized structure grids, multi-level coarse grids with the same volume can be formed along the coordinate directions according to a suitable volume. Different from the equal-length aggregation mode, the lengths of the grids in different coordinate directions are different in this mode.
[0065] Generally, the first-level grid is a fine grid, and the higher the level, the coarser the grid. The aggregation mode of the grid and the grid level can be specified by the user.
[0066] In some possible implementation manners of the present application, after step S101, it may further include:
[0067] Establish the correspondence between the high-level grid and the low-level grid of the target field T and the correspondence between the high-level grid and the low-level grid of the source field S; the correspondence includes the number of grid points included and the vertex coordinates of each grid point.
[0068] In some possible implementation manners of the present application, step S102 may specifically include:
[0069] Starting from the high-level grid of the target field T, search for the correspondence between the target field T and the source field S level by level. For each target grid point in the target field T, determine the source grid point in the source field S that is closest to this target grid point, and obtain the closest source grid points corresponding to each target grid point.
[0070] As an example, for the grid point TPn(i, j, k) at the Nth level in the target field T, find the grid point SPn(i, j, z) closest to TPn(i, j, k) in the Nth-level grid of the source field S. For the grid point TPn-1(i, j, k) at the (N - 1)th level included in the grid point TPn(i, j, k) at the Nth level in the target field T, search for the grid point SPn-1(i, j, k) at the (N - 1)th level closest to TPn-1(i, j, k) in the source field SPn(i, j, z). Refer to the above two steps until the first-level grid point SP1(i, j, k) in the source field S closest to the first-level grid point TP1(i, j, k) in the target field T is found in the source field S.
[0071] In the embodiment of the present application, search for the correspondence between the target field and the source field level by level from the high-level grid. First, quickly locate the coordinates of the target field and the source field through the high-level coarse grid, and then implement the mapping of the fine grids of the target field and the source field through the low-level grid. The multi-level grid strategy can greatly reduce the number of direct fine grid searches and improve the efficiency of grid mapping.
[0072] In some possible implementation manners of the present application, step S103 may specifically include:
[0073] Determine whether the target grid point TP in the target field T intersects with the grid points around the corresponding closest source grid point;
[0074] If so, obtain the volume of the source grid points where the closest source grid point and its surrounding grids intersect with the target grid point TP or the distance from the grid center points, and obtain the value of the closest source grid point and the values of the source grid points around the closest source grid point that intersect with the target grid point TP;
[0075] Weight the value of the closest source grid point and the values of the source grid points around the closest source grid point that intersect with the target grid point TP to obtain the weighted value of the target grid point TP mapped from the source field S.
[0076] In an example, weighting the value of the closest source grid point and the values of the source grid points around the closest source grid point that intersect with the target grid point TP to obtain the weighted value of the target grid point TP mapped from the source field S may specifically include:
[0077] According to the following formula (1), obtain the weighted value TP of the target grid point TP mapped from the source field S value ;
[0078]
[0079] In the formula, SP value is the numerical value of the source field before mapping, M is the total number of grids in the source field S that intersect with the target grid point TP, and α m is the volume fraction occupied by the m-th grid in the source field S that intersects with the target grid point TP, and (mi, mj, mk) is the coordinate of the m-th grid in the source field S that intersects with the target grid point TP.
[0080] For ease of understanding, a specific example is given below to illustrate in detail a grid mapping method applicable to a reactor core provided by an embodiment of the present application.
[0081] A grid mapping method applicable to a reactor core provided by an embodiment of the present application includes:
[0082] Step S1, define the physical field, that is, the multi-level grids of the source field S and the target field T. If the physical field meets the condition of defining multi-level grids (such as having the software source code for simulating the physical field), execute step S11. If the physical field does not meet the condition of defining multi-level grids, execute step S12.
[0083] In this embodiment, it is assumed that the condition of defining multi-level grids is met, and a two-level grid is defined, as Figure 2 and Figure 3 shown.
[0084] Step S11, define multi-level spatial grids for the physical field using the following data structure. This data structure includes two layers. The first layer is the grid layer number, and the second layer is the grid attribute.
[0085] Taking the source field S as an example, the multi-level spatial grid data structure defined in this embodiment is as follows:
[0086] The first layer: Overall grid attribute: Grid layer number: 2; Grid type: hexahedron;
[0087] The second layer: Grid attribute: Number of grid points: 9000 for the first-level grid and 90 for the second-level grid; Grid point coordinates: SP1(i, j, k) (i = 1 to 30, j = 1 to 30, k = 1 to 10); SP2(i, j, k) (i = 1 to 3, j = 1 to 3, k = 1 to 10); Grid side length: In this embodiment, the grids are evenly divided along the coordinate axes. The side lengths of the first-level grid along the x, y, and z directions are 1 cm, 1 cm, and 10 cm, respectively, and the side lengths of the second-level grid along the x, y, and z directions are 10 cm, 10 cm, and 10 cm, respectively;
[0088] The third layer: Corresponding relationship with the next-level grid: Establish the corresponding relationship between different-level grids in step S2.
[0089] Step S12, if the physical field does not meet the conditions for defining a multi-level grid and only one level of grid is defined (for example, there is no software source code for simulating the physical field, and the calculation software only defines one type of grid for calculation), then the aggregation mode is adopted to form a multi-level grid.
[0090] In this embodiment, a software is used to generate a multi-level grid, and the multi-level grid is not formed through the aggregation mode.
[0091] Step S2, establish the correspondence between the multi-level grids of the physical fields, and establish the correspondence between the second-level grid and the first-level grid.
[0092] Such as Figure 2 and Figure 3 As shown, each second-level grid contains multiple first-level grids. For the source field S, one second-level grid contains 100 first-level grids. Record the coordinate positions of each first-level grid in the second-level grid. Two-dimensional coordinates such as (ix = 1 to 10, iy = 1 to 10) or one-dimensional serial number coordinates n = 1 to 100 can be used. The relative positions of each second-level grid with respect to the first-level grids are independently numbered. Thus, it can be known which first-level grids are contained in each second-level grid or which second-level grid a first-level grid is located in.
[0093] Step S3, perform spatial grid mapping between different physical fields.
[0094] Step S31, for the N-level grid point TPn(i, j, k) in the target field T, find the grid point SPn(i, j, z) in the N-level grid of the source field S that is closest to TPn(i, j, k).
[0095] Taking the first grid of the second level in the target field T as an example, for TP2(1, 1, 1), the grid closest to TP2(1, 1, 1) in the second-level grid of the source field S is TS2(1, 1, 1). The method for judging whether it is the closest is to sequentially judge whether the distance between the center points of the second-level grids of the two fields is the smallest, and the one with the smallest distance is the closest.
[0096] Step S32, for the (N - 1)-level grid point TPn-1(i, j, k) contained in the N-level grid point TPn(i, j, k) in the target field T, find the (N - 1)-level grid point SPn-1(i, j, k) closest to TPn-1(i, j, k) in the source field at SPn(i, j, z).
[0097] Taking the first grid of the second level in the target field T as an example, TP2(1, 1, 1) contains 5 first-level grids. For TP1(1, 1, 1), among the first-level grids in the second-level grid TS2(1, 1, 1) of the source field S that is closest to TP2(1, 1, 1), the grid closest to TP1(1, 1, 1) is TS1(1, 3, 1). The method for judging whether it is the closest is the same as that for the first-level grid.
[0098] Step S33, referring to Step S31 and Step S32, until the first-level grid point SP1(i, j, k) of the source field S that is closest to the first-level grid point TP1(i, j, k) in the target field T is found in the source field S.
[0099] In this embodiment, only two layers of grids are assumed. Therefore, after Step S32 is executed, the requirements of S33 are met.
[0100] Step S34, determine whether the grid of the first-level grid point TP1(i, j, k) in the physical field T intersects with the grid points around the first-level grid point SP1(i, j, k) in the source field S that is closest to it. If they intersect, calculate the volume of the intersection of SP1(i, j, k) and its surrounding grids with TP1(i, j, k) or the distance from the center point of the grid.
[0101] Taking the first-level grid TP1(1, 1, 1) of the target field T as an example, the grids that intersect with the closest first-level grid point TS1(1, 3, 1) in the source field S to TP1(1, 1, 1) include TS1(1, 1, 1), TS1(1, 2, 1), TS1(1, 3, 1), TS1(1, 4, 1), TS1(1, 5, 1), and the volumes of the intersections are the volumes of TS1(1, 1, 1), TS1(1, 2, 1), TS1(1, 3, 1), TS1(1, 4, 1), TS1(1, 5, 1) respectively.
[0102] Step S35, weight the values of the first-level grid point SP1(i, j, k) in the source field S and its surrounding grids that intersect with the first-level grid point TP1(i, j, k) in the target field T. This value is the value of the first-level grid point TP1(i, j, k) in the mapped target field T.
[0103] Assume that the grid value in the source field S = the x coordinate of this first-level grid.
[0104] Taking the first-level grid TP1(1, 1, 1) of the target field T as an example, the values of the first-level grids in the source field S that intersect with TP1(1, 1, 1) are weighted according to the volume weights respectively, and the value of TP1(1, 1, 1) is calculated using formula (1) = (1 + 2 + 3 + 4 + 5) / 5 = 3.
[0105] Step S36, repeat Steps S31 to S35 to obtain the weighted values mapped from the source field S for all grids in the target field T.
[0106] Repeat Steps S31 to S35 to sequentially obtain the mapping relationships between all the first-level grids in the target field T and the first-level grids in the source field S, and obtain the mapped values.
[0107] Step S4, conservation repair of the grid mapping parameters of the target field T. Calculate the sum S_sum of the values of all grids in the source field multiplied by the grid volume, calculate the sum T_sum of the values of all grids in the target field T after mapping multiplied by the grid volume, calculate the ratio f = S_sum / T_sum, and multiply the values of all grids in the target field T after mapping by the ratio f to obtain the new mapped values of the target field grids.
[0108] Calculate the sum of the values of all grids in the source field S:
[0109] S_sum = 30*(1 + 2 + 3……+ 30)*10*(1*1*10) = 1395000.
[0110] Calculate the sum of the values of all grids in the target field T:
[0111] T_sum = 30*(3 + 8 + 13 + 18 + 23 + 28)*10*(1*5*10) = 1395000.
[0112] f = S_sum / T_sum = 1.0. Then multiply the values of all grids in the target field T after mapping by 1 to obtain the corrected mapped values.
[0113] A grid mapping method applicable to the reactor core provided by an embodiment of the present application is based on a multi-level grid strategy. By reconstructing the fine grids of the physical field, multi-level coarser grids are established. First, quickly search for the corresponding relationships of the high-level coarse grids, and then search for the corresponding relationships of the low-level fine grids in the high-level coarse grids. Through this multi-level grid strategy, it is avoided to traverse all the fine grids to find the grid point closest to the target field, greatly reducing the order of magnitude of the search times, improving the establishment of the corresponding relationship between the fine grids of the target field and the source field, and realizing the mapping of parameters through methods such as volume weight weighting, and ensuring the conservation of parameters before and after mapping through overall conservation repair.
[0114] Based on the grid mapping method applicable to the reactor core provided by the above embodiment, an embodiment of the present application also provides a grid mapping device applicable to the reactor core.
[0115] A grid mapping device applicable to the reactor core provided by an embodiment of the present application includes:
[0116] The first determination module is used to determine the multi-level grids of the target field T and the multi-level grids of the source field S;
[0117] The second determination module is used to determine, for each target grid point in the target field T, the source grid point in the source field S that is closest to the target grid point, and obtain the closest source grid points corresponding to each target grid point;
[0118] A numerical acquisition module, configured to obtain the weighted mapped values of each target grid point in the target field T from the source field S based on the values of the nearest source grid points and the values of the source grid points around the nearest source grid points that intersect with the corresponding target grid points.
[0119] In some possible implementation manners of the embodiments of the present application, the device may further include:
[0120] A second acquisition module, configured to acquire the sum T_sum of the weighted mapped values of all the target grid points in the target field T from the source field S, and the sum S_sum of the values of all the source grid points in the source field S;
[0121] A numerical correction module, configured to correct the weighted mapped values of each target grid point in the target field T from the source field S based on the ratio of S_sum to T_sum.
[0122] In some possible implementation manners of the embodiments of the present application, the first determination module may specifically be configured to:
[0123] When the physical field meets the condition for defining multi-level grids, a multi-layer spatial grid is defined using a preset data structure; the physical field is the target field T or the source field S; the data structure includes three layers, the first layer is the overall grid parameters, the second layer is the grid attributes of the current level, and the third layer is the correspondence with the next-level grid.
[0124] In some possible implementation manners of the embodiments of the present application, the first determination module may specifically further be configured to:
[0125] If the physical field does not meet the condition for defining multi-level grids, a multi-level grid is formed using an aggregation mode; the aggregation mode specifically includes any one of an equal-length aggregation mode, an equal-grid-number mode, and an equal-grid-volume mode.
[0126] In some possible implementation manners of the embodiments of the present application, the device may further include:
[0127] A relationship establishment module, configured to establish the correspondence between the high-level grid and the low-level grid of the target field T and the correspondence between the high-level grid and the low-level grid of the source field S; the correspondence includes the number of grid points included and the vertex coordinates of each grid point.
[0128] In some possible implementation manners of the embodiments of the present application, the second determination module may specifically include:
[0129] Starting from the high-level grid of the target field T, search for the correspondence between the target field T and the source field S level by level. For each target grid point in the target field T, determine the source grid point in the source field S that is closest to this target grid point, and obtain the closest source grid points corresponding to each of the target grid points.
[0130] In some possible implementation manners of the embodiments of the present application, the numerical value acquisition module may specifically include:
[0131] Judge whether the target grid point TP in the target field T intersects with the grid points around the corresponding closest source grid point;
[0132] If so, obtain the volume or the distance from the grid center point of the source grid points where the closest source grid point and its surrounding grids intersect with the target grid point TP, and obtain the numerical value of the closest source grid point and the numerical values of the source grid points around the closest source grid point that intersect with the target grid point TP.
[0133] Weight the numerical value of the closest source grid point and the numerical values of the source grid points around the closest source grid point that intersect with the target grid point TP, and obtain the weighted numerical value after mapping of the target grid point TP from the source field S.
[0134] In some possible implementation manners of the embodiments of the present application, the step of weighting the numerical value of the closest source grid point and the numerical values of the source grid points around the closest source grid point that intersect with the target grid point TP, and obtaining the weighted numerical value after mapping of the target grid point TP from the source field S specifically includes:
[0135] According to the following formula (1), obtain the weighted numerical value TP after mapping of the target grid point TP from the source field S value ;
[0136]
[0137] In the formula, SP value is the numerical value of the source field before mapping, M is the total number of grids in the source field S that intersect with the target grid point TP, α m is the volume share occupied by the m-th grid in the source field S that intersects with the target grid point TP, and (mi, mj, mk) is the coordinate of the m-th grid in the source field S that intersects with the target grid point TP.
[0138] A grid mapping method and device applicable to a reactor core provided by an embodiment of the present application, based on a multi-level grid strategy, establish multi-level coarser grids through physical field fine grid reconstruction, first quickly search for the correspondence of high-level coarse grids, and then search for the correspondence of low-level fine grids in the high-level coarse grids. Through this multi-level grid strategy, it is avoided to traverse all fine grids to find the grid point closest to the target field, greatly reducing the order of magnitude of the search times, improving the establishment of the correspondence between the fine grids of the target field and the source field, and realizing the mapping of parameters through methods such as volume weight weighting, and ensuring the conservation of parameters before and after mapping through overall conservation repair.
[0139] Based on the grid mapping method and device applicable to a reactor core provided by the above embodiment, the embodiment of the present application further provides an electronic device, which is characterized in that it includes a processor and a memory, and instructions are stored in the memory. When the processor executes the instructions, the processor executes any one of the grid mapping methods applicable to the reactor core provided by the above embodiment.
[0140] Based on the grid mapping method and device applicable to a reactor core provided by the above embodiment, the embodiment of the present application further provides a computer-readable storage medium, which is characterized in that it is used to store a computer program, and the computer program includes a program for executing any one of the grid mapping methods applicable to the reactor core provided by the above embodiment.
[0141] Based on the grid mapping method and device applicable to a reactor core provided by the above embodiment, the embodiment of the present application further provides a computer program product, which is characterized in that it includes computer program code. When the computer program code is run on an electronic device, the electronic device executes any one of the grid mapping methods applicable to the reactor core provided by the above embodiment.
[0142] The above has described the present application in detail with reference to the drawings and embodiments. However, the present application is not limited to the above embodiments. Within the scope of knowledge possessed by those of ordinary skill in the art, various changes can be made without departing from the purpose of the present application. The content not described in detail in the present application can all adopt the prior art.
Claims
1. A grid mapping method applicable to a reactor core, characterized in that, The method includes: Determine the multi-level grids of the target field T and the multi-level grids of the source field S; For each target grid point in the target field T, determine the source grid point in the source field S that is closest to this target grid point, and obtain the closest source grid points corresponding to each of the target grid points; Based on the value of the closest source grid point and the values of the source grid points around the closest source grid point that intersect with the corresponding target grid point, obtain the weighted mapped values of each target grid point in the target field T from the source field S.
2. The grid mapping method applicable to the reactor core according to claim 1, characterized in that, After obtaining the weighted mapped values of each target grid point in the target field T from the source field, it further includes: Obtain the sum T_sum of the weighted mapped values of all the target grid points in the target field T from the source field S, and the sum S_sum of the values of all the source grid points in the source field S; Correct the weighted mapped values of each target grid point in the target field T from the source field S based on the ratio of S_sum to T_sum.
3. The grid mapping method applicable to the reactor core according to claim 1, wherein Determine the multi-level grids of the target field T and the multi-level grids of the source field S, specifically including: When the physical field meets the condition for defining multi-level grids, use a preset data structure to define multi-layer spatial grids; the physical field is the target field T or the source field S; the data structure includes three layers, the first layer is the overall grid parameters, the second layer is the grid attributes of this level, and the third layer is the correspondence with the next-level grid.
4. The grid mapping method applicable to the reactor core according to claim 3, wherein Determine the multi-level grids of the target field T and the multi-level grids of the source field S, and specifically it also includes: If the physical field does not meet the condition for defining multi-level grids, use an aggregation mode to form multi-level grids; the aggregation mode specifically includes any one of the equal-length aggregation mode, the equal-grid-number mode, and the equal-grid-volume mode.
5. The grid mapping method applicable to the reactor core according to claim 1, characterized in that, After determining the multi-level grids of the target field T and the multi-level grids of the source field S, it further includes: Establish the correspondence between the high-level grid and the low-level grid of the target field T and the correspondence between the high-level grid and the low-level grid of the source field S; the correspondence includes the number of grid points included and the vertex coordinates of each grid point.
6. The grid mapping method applicable to a reactor core according to claim 1, characterized in that For each target grid point in the target field T, determine the source grid point in the source field S that is closest to this target grid point, and obtain the closest source grid points corresponding to each of the target grid points, specifically including: Start from the high-level grid of the target field T, search the correspondences of the target field T and the source field S level by level, and for each target grid point in the target field T, determine the source grid point in the source field S that is closest to this target grid point, and obtain the closest source grid points corresponding to each of the target grid points.
7. The grid mapping method applicable to a reactor core according to claim 1, characterized in that, Based on the value of the closest source grid point and the values of the source grid points around the closest source grid point that intersect with the corresponding target grid point, obtain the weighted mapped values of each target grid point in the target field T from the source field S, specifically including: Judge whether the target grid point TP in the target field T intersects with the grid points around the corresponding closest source grid point; If so, obtain the volume of the source grid points where the nearest source grid point and its surrounding grids intersect with the target grid point TP or the distances from the grid center points, and obtain the value of the nearest source grid point and the values of the source grid points where the nearest source grid point's surrounding grids intersect with the target grid point TP; Weight the value of the nearest source grid point and the values of the source grid points where the nearest source grid point's surrounding grids intersect with the target grid point TP, and obtain the weighted value mapped from the source field S to the target grid point TP.
8. The grid mapping method applicable to a core according to claim 7, characterized in that, The weighting the value of the nearest source grid point and the values of the source grid points where the nearest source grid point's surrounding grids intersect with the target grid point TP to obtain the weighted value mapped from the source field S to the target grid point TP specifically includes: According to the following formula (1), the weighted value TP of the target grid point TP mapped from the source field S is obtained value ; Where, SP value is the source field value before mapping, M is the total number of grids in the source field S that intersect with the target grid point TP, and α m is the volume fraction occupied by the m-th grid in the source field S that intersects with the target grid point TP, and (mi, mj, mk) are the coordinates of the m-th grid in the source field S that intersects with the target grid point TP.
9. A grid mapping device applicable to a reactor core, characterized in that The device includes: A first determination module, configured to determine the multi-level grids of the target field T and the multi-level grids of the source field S; A second determination module, configured to determine, for each target grid point in the target field T, the source grid point in the source field S that is closest to the target grid point, and obtain the nearest source grid point corresponding to each target grid point; A value acquisition module, configured to obtain the weighted value mapped from the source field S to each target grid point in the target field T according to the value of the nearest source grid point and the values of the source grid points where the nearest source grid point's surrounding grids intersect with the corresponding target grid point; 10. An electronic device, characterized in that, It includes a processor and a memory, and instructions are stored in the memory. When the processor executes the instructions, the processor executes the method according to any one of claims 1-8.
11. A computer-readable storage medium, characterized in that, For storing a computer program, the computer program includes for executing the method according to any one of claims 1-8.
12. A computer program product, characterized in that, It includes computer program code. When the computer program code is run by an electronic device, the electronic device executes the method according to any one of claims 1-8.