Multi-layer rapid multi-pole grouping method and device, storage medium and product
Through multi -layer fast and multi -polar child grouping methods, the multi -layer tree structure and packet mark are used to solve the problem of large memory consumption, low computing efficiency and poor compression effects in electromagnetic simulation, and achieve efficient and accurate electromagnetic simulation.
Patent Information
- Application Number
- CN202411449222.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-10-17
- Publication Date
- 2025-01-28
AI Technical Summary
In electromagnetic simulation, the prior art has problems such as large memory consumption, low computing efficiency and poor compression effect.
Adopt a multi -layer fast and multi -polar child grouping method, obtain the multi -layer tree structure, determine the first tree structure and the second tree structure, and obtain the original node grouping of the first node according to the first tree structure. The group labeling of the tree structure realizes the grouping of the solution area.
In the three -dimensional space, the group expansion of multi -layers of fast and polarizers has been achieved, which significantly accelerates calculation efficiency, saves calculation space, improves the compression effect, and improves the efficiency of the electromagnetic field equation.
Smart Images
Figure CN119377531A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of electromagnetic simulation technology, and in particular to a multi-layer fast multipole grouping method, device, storage medium and product. Background Art
[0002] In electromagnetic simulation, large-scale electromagnetic field equations need to be solved, and when solving large-scale electromagnetic field equations, the construction of linear equations needs to be simplified and compressed, and fast multipole technology is usually used. Multi-layer fast multipole technology (MLFMA) is an efficient and fast algorithm based on integral equations in the field of electromagnetics. Multi-layer fast multipole technology can be used to accelerate the moment method, thereby accelerating the iterative solution of full array equations.
[0003] When using the fast multipole technique, all nodes are first grouped for the solution area to define the interaction between the far and near fields, and then compression calculations are performed based on the interaction between the far and near fields. In this process, the key step is to group the nodes to define the interaction between the far and near fields, which determines the compression effect.
[0004] In the classic planar grouping algorithm, in order to minimize the amount of near-field calculations, only all nodes adjacent to the leaf nodes after grouping are accurately calculated, and other nodes are far-field compressed. In other words, for each node, it is necessary to find all nodes adjacent to the parent node of its own box and the interaction relationship between the leaf nodes of these nodes, which not only leads to large memory consumption, low calculation efficiency, and high calculation cost; but also poor compression effect. Summary of the invention
[0005] Based on this, it is necessary to provide a multi-layer fast multipole grouping method, device, storage medium and product to address the above technical problems, so as to solve the problems of large memory consumption, low computational efficiency and poor compression effect in electromagnetic simulation.
[0006] In a first aspect, the present invention provides a multi-layer fast multipole grouping method, the method comprising: Obtain a multi-layer tree structure of the solution region, and determine a first tree structure and a second tree structure; Obtaining an original node grouping label of the first node according to the first tree structure; obtaining a plurality of original node grouping labels corresponding to a plurality of first nodes, thereby obtaining a grouping label of the first tree structure; Performing a hierarchical traversal on the second tree structure according to the grouping mark of the first tree structure to obtain the grouping mark of the second tree structure; In this way, the grouping mark of each layer of the tree structure is obtained, and the grouping of the solution area is achieved.
[0007] Furthermore, the original node grouping mark of the first node is obtained by: determining the field node and the original node in the first tree structure, traversing and judging the first tree structure, and obtaining the original node grouping mark of the first node.
[0008] Furthermore, the level traversal includes: Compare the first tree structure with the second tree structure, and determine whether the first node exists in the relative position of the target node in the second tree structure in the first tree structure; If so, the mutual relationship of the target nodes is grouped and marked using the original node grouping mark of the first node; If it does not exist, the original node grouping mark of the target node is obtained according to the second tree structure; In this way, the original node grouping labels of all nodes in the second tree structure are obtained, and the grouping labels of the second tree structure are obtained.
[0009] Further, the mutual relationship of the target nodes is grouped and marked using the original node grouping mark of the first node, including: The original node of the target node is marked using the second list and the fourth list in the original node grouping mark of the first node; and the unmarked original node corresponding to the target node is re-marked.
[0010] Furthermore, the method of obtaining the original node grouping mark of the target node includes: grouping and marking the mutual relationship of the target nodes by traversal judgment.
[0011] Furthermore, the traversal judgment includes: When both the field node and the original node are leaf nodes, if the first compression condition is not met, the original node is marked as the first list; When the field node and the original node meet the first compression condition, the original node is directly marked as the second list; When both the field node and the original node are father nodes; if the first compression condition is met, the original node is marked as the second list; if the first compression condition is not met, the leaf node relationship between the field node and the original node is continued to be traversed; When the field node and the original node meet the second compression condition, the original node is directly marked as the third list; When the field node is a leaf node and the radius of the original node is smaller than the radius of the field node; if the second compression condition is met, the original node is marked as the third list; if the second compression condition is not met and the original node is a father node, the leaf node relationship between the field node and the original node continues to be traversed; When the original node is a leaf node and the radius of the original node is greater than the radius of the field node; if the second compression condition is met, the original node is marked as the fourth list; if the second compression condition is not met and the field node is the father node, the relationship between the leaf nodes of the field node and the original node continues to be traversed.
[0012] Furthermore, the method further comprises: The compression result of the node is obtained based on the grouping mark of the original node; Multiple node compression results are obtained for each node, and the compression results of the multiple nodes are cumulatively added together to obtain a compression result of the tree structure.
[0013] In a second aspect, the present invention provides a computer device, comprising a memory, a processor, and a computer program stored in the memory, wherein the processor executes the computer program to implement the steps of any one of the above methods.
[0014] In a third aspect, the present invention provides a computer-readable storage medium having a computer program / instruction stored thereon, which implements the steps of any of the above-mentioned methods when executed by a processor.
[0015] In a fourth aspect, the present invention provides a computer program product, comprising a computer program / instruction, which implements the steps of any of the above methods when executed by a processor.
[0016] In general, the multi-layer fast multipole grouping method, device, storage medium and product provided by the present invention can achieve the following beneficial effects compared with the prior art: The present invention extends the two-dimensional tree structure grouping to a three-dimensional multi-layer tree structure. In the three-dimensional direction, the mutual interaction between tree structures of different layers follows the basic logic of a single tree, and the grouping labels of other tree structures are derived according to the grouping labels of the known tree structure, realizing the grouping expansion of multi-layer fast multipoles in three-dimensional space, which not only speeds up the calculation efficiency to a great extent, but also saves the calculation space, makes the compressible space larger, and has a better compression effect, thereby improving the efficiency of solving electromagnetic field equations, making electromagnetic simulation more efficient and more accurate. The problems of large memory consumption, low calculation efficiency and poor compression effect of electromagnetic simulation are solved.
[0017] In addition, the present invention is based on planar quadtree grouping, and does not use whether nodes are adjacent as a criterion for compression. Instead, it adopts a top-down traversal judgment principle to directly obtain the original node grouping mark of the field node, so that there is no need to find all nodes adjacent to the father node of its own box and the interactive relationship of the leaf nodes of these nodes. Instead, the interactive relationship is obtained by directly judging the compression relationship between the field node and the original node, so that the compressible space is larger and the compression effect is better.
[0018] In addition, the present invention only needs to calculate the interaction relationship of some nodes instead of the interaction relationship of all nodes. By calculating and processing according to different situations, it not only reduces the amount of calculation and releases the calculation space, but also greatly improves the calculation accuracy and flexibility, thereby realizing efficient, fast and accurate electromagnetic modeling. BRIEF DESCRIPTION OF THE DRAWINGS
[0019] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0020] Figure 1 It is a method schematic diagram of a multi-layer fast multipole grouping method, device, storage medium and product provided by the present invention; Figure 2 It is a schematic diagram of the layered physical configuration in a multilayer medium of a multilayer fast multipole grouping method, device, storage medium and product provided by the present invention; Figure 3 It is a schematic diagram of a first tree structure and a second tree structure of a multi-layer fast multipole grouping method, device, storage medium and product provided by the present invention; Figure 4 It is a schematic diagram of the mutual relationship of nodes of a multi-layer fast multipole grouping method, device, storage medium and product provided by the present invention; Figure 5 The present invention provides a multi-layer fast multipole grouping method, device, storage medium and product grouping marking schematic diagram Figure 1 ; Figure 6 The present invention provides a multi-layer fast multipole grouping method, device, storage medium and product grouping marking schematic diagram Figure 2 . DETAILED DESCRIPTION
[0021] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in combination with the drawings and embodiments of the present invention. Obviously, the described embodiments are partial embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work belong to the scope of protection of the present invention.
[0022] It should be noted that in the description of the embodiments of the present invention, the terms "first", "second", etc. are merely synonyms used to distinguish different objects, and are not used to describe a specific order or quantity; the terms "include", "comprise", or any other variants thereof are intended to cover non-exclusive inclusion, so that a method, step, or system including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such method, step, or system. In the absence of further restrictions, the elements defined by the sentence "includes a ..." do not exclude the existence of other identical elements in the method, step, or system including the elements.
[0023] In order to solve the problems of large memory consumption, low computational efficiency and poor compression effect in electromagnetic simulation. In the first aspect, the present invention provides a multi-layer fast multipole grouping method, such as Figure 1 As shown, the method includes: Step 101: Obtain a multi-layer tree structure of a solution region, and determine a first tree structure and a second tree structure.
[0024] It should be noted that, generally in the three-dimensional direction, multiple trees need to interact with each other, and the interaction between different trees at different layers needs to follow the basic logic of a single tree. Figure 2 As shown, this is a schematic diagram of the layered physical configuration in a multilayer medium.
[0025] The multi-layer tree structure of the solution area is obtained by first dividing the solution area box into four parts continuously until the number of elements in each divided box is not greater than the set value s, and a multi-layer quadtree structure is obtained. Figure 3 Shown are a first tree structure (tree A) and a second tree structure (tree B).
[0026] Step 102: Obtain original node grouping labels of first nodes according to the first tree structure; obtain multiple original node grouping labels corresponding to multiple first nodes, thereby obtaining grouping labels of the first tree structure.
[0027] It should be noted that the original node grouping mark of the first node of the first tree structure is searched from top to bottom using the quadtree, and then the relationship between all nodes.
[0028] like Figure 4 As shown, when traversing to the father node U, the grouping mark list2 of the father node U that meets the conditions can be obtained.
[0029] Continue to traverse downward to obtain the original node grouping labels of the first node a except for the grouping label list2 that the father node U has obtained.
[0030] Add all the grouping marks of the first node a and all the grouping marks of the father node U to obtain the original node grouping mark of the first node a, that is, the mutual relationship between the first node a and all the near and far fields. Similarly, traverse to obtain the original node grouping marks of all nodes, and then obtain the mutual relationship of all nodes.
[0031] As an embodiment, the original node grouping mark of the first node is obtained by: determining the field node and the original node in the first tree structure, traversing and judging the first tree structure, and obtaining the following: Figure 5 The original node grouping label of the first node is shown.
[0032] Furthermore, the traversal judgment includes: When both the field node and the original node are leaf nodes, if the first compression condition is not met, the original node is marked as the first list; When the field node and the original node meet the first compression condition, the original node is directly marked as the second list; When both the field node and the original node are father nodes; if the first compression condition is met, the original node is marked as the second list; if the first compression condition is not met, the leaf node relationship between the field node and the original node is continued to be traversed; When the field node and the original node meet the second compression condition, the original node is directly marked as the third list; When the field node is a leaf node and the radius of the original node is smaller than the radius of the field node; if the second compression condition is met, the original node is marked as the third list; if the second compression condition is not met and the original node is a father node, the leaf node relationship between the field node and the original node continues to be traversed; When the original node is a leaf node and the radius of the original node is greater than the radius of the field node; if the second compression condition is met, the original node is marked as the fourth list; if the second compression condition is not met and the field node is the father node, the relationship between the leaf nodes of the field node and the original node continues to be traversed.
[0033] The first list (list1) is defined as: a list of the smallest boxes adjacent to the target node; if the target node has no child nodes, that is, when the target node is the smallest node, it is the first list; Define the second list (list2) as: being in the same layer as the target node, being adjacent to the target node's father, being the child of the target node's father, but not being adjacent to the target node; The third list (list3) is defined as follows: if the target node is a father node, the third list is empty; if the target node is a minimum node, the third list is the father node of the target node, and the distance between each box and the target node is greater than the length of each box itself.
[0034] Define the fourth list (list4) as: adjacent to the parent node of the target node, but without child nodes, and larger than the size of the target node; Define the fifth list (list5) as being not adjacent to the parent node of the target node.
[0035] The first compression condition may be: the distance between the center point of the current field original box and the original node box is twice the radius; if the first compression condition is met, it means that compression is possible.
[0036] The second compression condition may be: the center point distance of the current field original box is less than 2 times the radius of the original node box; that is, the center point distance of the current field original box is 2 times the smaller radius of the original node box; if the second compression condition is met, it means that compression is possible.
[0037] It should be noted that the relationship between the third list and the fourth list is the inverse of each other. For example, if a is the original node and a' is the field node, then a is the third list of a', and a' must be the fourth list of a; conversely, if a' is the original node and a is the field node, then a' is the third list of a, and a must be the fourth list of a'.
[0038] In addition, as another embodiment, the original node grouping mark of the first node can also be obtained by: keeping the original list grouping definition unchanged, taking adjacency as the compression judgment standard, finding all nodes adjacent to the father node of its own box and the interactive relationship of the leaf nodes of these nodes, such as Figure 6 shown.
[0039] For each target node, it is only necessary to calculate the interaction relationship between list1 and list4, where the calculation method includes: If the selected node is a leaf node, that is, the node has no children but only a father, obtain the expansion coefficient ф of the node, and directly calculate the relationship between the node's neighbors and the node, and obtain the relationship between list1 and the elements in the node, recorded as α.
[0040] If the selected node is a parent node, that is, the node has children, the center point of the node's children is transferred to the node through m2m transfer, and the calculation is ignored.
[0041] Use the mutual inductance coefficient (m21) to transfer the expansion coefficient ф to the center of list2, and record the accumulated result as т.
[0042] If the selected node is a leaf node, calculate the error (me) to describe the influence of the expansion coefficient of each box in list3 on each element in the node, denoted by β.
[0043] If the selected node is a leaf node, calculate the effective magnetic path length (le), describe the influence of each element in list4 on the expansion coefficient of the node, and record the result as δ.
[0044] For the transfer center т of list2, perform the le operation and move the center to the child node.
[0045] Finally, the relationship between the node pair list1-list4 is obtained: α, т, β, δ; and α, т, β, δ are added together to obtain the mutual relationship of the target node.
[0046] Step 103: perform hierarchical traversal of the second tree structure according to the grouping mark of the first tree structure to obtain the grouping mark of the second tree structure.
[0047] The shapes of trees are different if their heights in the Z direction are different. However, since the relative positions of the nodes in each tree structure are the same, for example, the node a1 in the first layer of the first tree structure and the node b1 in the first layer of the second tree structure are boxes in the same position on the xy-axis plane. Therefore, the marks of the corresponding positions of the nodes in the first tree structure (tree A) can be reused in the relative positions in the second tree structure (tree B). If they cannot be reused, they can be marked using traversal judgment.
[0048] As an embodiment, the hierarchical traversal includes: comparing the first tree structure and the second tree structure to determine whether the target node in the second tree structure has the first node at a relative position in the first tree structure; if so, grouping and marking the mutual relationships of the target nodes using the original node grouping mark of the first node; if not, obtaining the original node grouping mark of the target node according to the second tree structure; in this way, obtaining the original node grouping marks of all nodes in the second tree structure, and obtaining the grouping marks of the second tree structure.
[0049] For example, Figure 3 As shown, the target node b in tree B exists in the relative position in tree A, which is the first node a. Therefore, the original node grouping mark of the first node a can be used to group and mark the mutual relationship of the target node b. If another target node c in tree B does not exist in the relative position in tree A, the original node grouping mark of the target node c is obtained according to the second tree structure.
[0050] Further, the mutual relationship of the target nodes is grouped and marked using the original node grouping mark of the first node, including: The original node of the target node is marked using the second list and the fourth list in the original node grouping mark of the first node; and the unmarked original node corresponding to the target node is re-marked.
[0051] For example, Figure 3As shown, first traverse list2 and list4 of node a in tree A, and the same applies to node b in the same position in tree B. List2 and list4 are marks 2 and 4 in tree A. The two red boxes are the relative positions in tree A and tree B, respectively. If node b in tree B also has list2 and list4 at the corresponding position, the marks at the corresponding position in tree B can directly adopt the marks 2 and 4 of the corresponding boxes in tree A, and then get list2 and list4 of node b in tree B. For other unmarked nodes in tree B, re-mark them to complete the grouping mark of node b in tree B.
[0052] The method of obtaining the original node grouping mark of the target node b includes: grouping and marking the mutual relationship of the target node b by traversal judgment.
[0053] Step 104: In this way, the grouping mark of each layer of the tree structure is obtained to achieve the grouping of the solution area.
[0054] If there are N layers of trees, the above steps 101-103 need to be repeated N2 times in total to obtain the grouping mark of each layer of the tree structure, and each node in each layer of the tree has N lists (list1234) corresponding to it.
[0055] In addition, the grouping method of the present invention also includes: obtaining a compression result of a node based on the original node grouping mark; obtaining multiple node compression results corresponding to each node, and accumulating and adding the multiple node compression results to obtain a compression result of the tree structure.
[0056] In a second aspect, the present invention provides a computer device, comprising a memory, a processor, and a computer program stored in the memory, wherein the processor executes the computer program to implement the steps of any one of the above methods.
[0057] In a third aspect, the present invention provides a computer-readable storage medium having a computer program / instruction stored thereon, which implements the steps of any of the above-mentioned methods when executed by a processor.
[0058] In a fourth aspect, the present invention provides a computer program product, comprising a computer program / instruction, which implements the steps of any of the above methods when executed by a processor.
[0059] It should be noted that the technical solutions of the device, the readable storage medium and the computer program product are consistent with the technical solutions of the above-mentioned method and will not be described in detail here.
[0060] In summary, the present invention uses a tree structure to decompose the solution area, obtains a multi-layer tree structure, and groups and marks any layer of the tree structure; by determining the field nodes and the original nodes, traversal judgment is performed to obtain the original node grouping marks of the field nodes; the grouping results are compressed in this way, solving the problems of large memory consumption, low computational efficiency and poor compression effect in electromagnetic simulation.
[0061] It should be noted that, for the above-mentioned various embodiments, for the sake of simplicity of description, they are all expressed as a series of action combinations, but those skilled in the art should be aware that the present application is not limited by the described order of actions, and according to the present application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by the present application.
[0062] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, please refer to the relevant description of other embodiments. In the several embodiments provided in this application, it should be understood that the disclosed method or system can be implemented in other ways. For example, the embodiments described above are only schematic, such as the division of the units, which is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed.
[0063] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0064] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
[0065] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable memory. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or the whole or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a memory, including a number of instructions for a computer device (which can be a personal computer, a server or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application.
[0066] Those skilled in the art will appreciate that all or part of the various circuits in the above embodiments may be completed by entering a program to instruct related hardware, and the program may be stored in a computer-readable memory, which may include: a flash drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.
[0067] The above is only an exemplary embodiment of the present disclosure, and the scope of the present disclosure cannot be limited thereto. That is, any equivalent changes and modifications made according to the teachings of the present disclosure are still within the scope of the present disclosure. After considering the specification and practicing the disclosure here, those skilled in the art will easily think of the implementation scheme of the present disclosure. This application is intended to cover any modification, use or adaptation of the present disclosure, which follows the general principles of the present disclosure and includes common knowledge or customary technical means in the technical field not recorded in the present disclosure. The description and examples are regarded as exemplary only, and the scope and spirit of the present disclosure are defined by the claims.
[0068] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0069] It will be easily understood by those skilled in the art that the above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.
Claims
1. A multi-layer fast multipole grouping method, characterized in that: The grouping method comprises: Obtain a multi-layer tree structure of the solution region, and determine a first tree structure and a second tree structure; Obtaining an original node grouping label of the first node according to the first tree structure; obtaining a plurality of original node grouping labels corresponding to a plurality of first nodes, thereby obtaining a grouping label of the first tree structure; Performing a hierarchical traversal on the second tree structure according to the grouping mark of the first tree structure to obtain the grouping mark of the second tree structure; In this way, the grouping mark of each layer of the tree structure is obtained, and the grouping of the solution area is achieved.
2. A multi-layer fast multipole grouping method according to claim 1, characterized in that: The original node grouping mark of the first node is obtained by: determining the field node and the original node in the first tree structure, traversing and judging the first tree structure, and obtaining the original node grouping mark of the first node.
3. A multi-layer fast multipole grouping method according to claim 1, characterized in that: The level traversal includes: Compare the first tree structure with the second tree structure, and determine whether the first node exists in the relative position of the target node in the second tree structure in the first tree structure; If so, the mutual relationship of the target nodes is grouped and marked using the original node grouping mark of the first node; If it does not exist, the original node grouping mark of the target node is obtained according to the second tree structure; In this way, the original node grouping labels of all nodes in the second tree structure are obtained, and the grouping labels of the second tree structure are obtained.
4. A multi-layer fast multipole grouping method according to claim 3, characterized in that: Using the original node grouping mark of the first node to group and mark the mutual relationship of the target nodes includes: The original node of the target node is marked using the second list and the fourth list in the original node grouping mark of the first node; and the unmarked original node corresponding to the target node is re-marked.
5. A multi-layer fast multipole grouping method according to claim 3, characterized in that: The method of obtaining the original node grouping mark of the target node includes: grouping and marking the mutual relationship of the target nodes by traversal judgment.
6. A multi-layer fast multipole grouping method according to any one of claims 1 to 5, characterized in that: The traversal judgment includes: When both the field node and the original node are leaf nodes, if the first compression condition is not met, the original node is marked as the first list; When the field node and the original node meet the first compression condition, the original node is directly marked as the second list; When both the field node and the original node are father nodes; if the first compression condition is met, the original node is marked as the second list; if the first compression condition is not met, the leaf node relationship between the field node and the original node is continued to be traversed; When the field node and the original node meet the second compression condition, the original node is directly marked as the third list; When the field node is a leaf node and the radius of the original node is smaller than the radius of the field node; if the second compression condition is met, the original node is marked as the third list; if the second compression condition is not met and the original node is a father node, the leaf node relationship between the field node and the original node continues to be traversed; When the original node is a leaf node and the radius of the original node is greater than the radius of the field node; if the second compression condition is met, the original node is marked as the fourth list; if the second compression condition is not met and the field node is the father node, the relationship between the leaf nodes of the field node and the original node continues to be traversed.
7. A multi-layer fast multipole grouping method according to claim 1, characterized in that: The method further comprises: The compression result of the node is obtained based on the grouping mark of the original node; Multiple node compression results are obtained for each node, and the compression results of the multiple nodes are cumulatively added together to obtain a compression result of the tree structure.
8. A computer device comprising a memory, a processor and a computer program stored in the memory, characterized in that: The processor executes the computer program to implement the steps of the method according to any one of claims 1 to 7.
9. A computer storage medium having a computer program / instruction stored thereon, characterized in that: When the computer program / instruction is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.
10. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instruction is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.