CN105550384B - A kind of post-processing approach of aerodynamics grid Metis auto-partition - Google Patents

A kind of post-processing approach of aerodynamics grid Metis auto-partition Download PDF

Info

Publication number
CN105550384B
CN105550384B CN201410602345.4A CN201410602345A CN105550384B CN 105550384 B CN105550384 B CN 105550384B CN 201410602345 A CN201410602345 A CN 201410602345A CN 105550384 B CN105550384 B CN 105550384B
Authority
CN
China
Prior art keywords
grid
subregion
aerodynamics
grid cell
metis
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201410602345.4A
Other languages
Chinese (zh)
Other versions
CN105550384A (en
Inventor
龚春叶
陈政
王玲
高鹏
张星
郭灵犀
禹彩辉
方洪
郑昭虎
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Academy of Launch Vehicle Technology CALT
Beijing Institute of Near Space Vehicles System Engineering
Original Assignee
China Academy of Launch Vehicle Technology CALT
Beijing Institute of Near Space Vehicles System Engineering
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Academy of Launch Vehicle Technology CALT, Beijing Institute of Near Space Vehicles System Engineering filed Critical China Academy of Launch Vehicle Technology CALT
Priority to CN201410602345.4A priority Critical patent/CN105550384B/en
Publication of CN105550384A publication Critical patent/CN105550384A/en
Application granted granted Critical
Publication of CN105550384B publication Critical patent/CN105550384B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The invention belongs to data post processing method technical fields, and in particular to the post-processing approach of aerodynamics grid Metis auto-partition.The following steps are included: step 1: deleting redundancy gridden data;Step 2: the non-directed graph TA of aerodynamics grid A is generated according to following methods;Step 3: creation array E [4] [N];Step 4: the boundary element of grid A is determined according to non-directed graph TA and following boundary element method of discrimination;... grid the point set G1, G2 ... ..., GP of each subregion of final output;The grid cell set of each subregion is respectively E1, E2 ... ..., EP, inner boundary set B1, B2 ... ..., BP;Complete post-processing.The requirement that this method can satisfy each multiblock technique unit, mesh point renumbers;It can quickly determine the boundary element of each multiblock technique inner boundary.

Description

A kind of post-processing approach of aerodynamics grid Metis auto-partition
Technical field
The invention belongs to data post processing method technical fields, and in particular to aerodynamics grid Metis auto-partition Post-processing approach.
Background technique
CFD (Fluid Mechanics Computation) is obtained by numerical solution fluid on computers and aerodynamics fundamental equation Take it is various under the conditions of the data that flow and the subject for acting on the power streamed on object, torque, flow image and heat, all kinds of Important function has been played in the Design of Aerodynamic Configuration of Aeronautics and Astronautics aircraft and optimization.CFD calculates general by the way of iteration Carry out, reach the condition of convergence need it is thousands of to tens of thousands of secondary iteration, to need to accelerate calculating speed using parallel computing.
With parallel numerical calculation method be constantly progressive and the rapid development of high-performance computer technology, parallel computation Be more and more obvious in the effect of aerospace field aerodynamics numerical simulation and advantage, relevant item demonstration early period, It plays an increasingly important role in design and analysis optimization.Such as Boeing is considered as high-performance calculation can speed up numerical value Simulation process, enhancing analog capability and improvement simulation precision, obtain more efficient aircraft and less wing and flight is surveyed Examination, keeps lower cost to reach while process is designed and developed in shortening.
METIS is one and divides extensive irregular component, big grid and the software for calculating sparse matrix filling reduction order Packet.The algorithm of METIS is the algorithm divided based on multilayer graph.The principle of Metis be based on multistage figure division, first to figure into Row continuous coarsening is split the figure after roughening, on the area maps to tiny figure after being calculated segmentation.Finally again This division is gradually reverted to the figure that scale constantly increases, and division is finely adjusted with partial approach in reduction process, Division until obtaining original image.
It includes mesh point, grid cell, inner boundary unit that the completeness of aerodynamics grid data, which is defined as the subregion, All data.Inner boundary cell data includes two parts, first is that the grid cell data of itself, second is that the grid that it is relied on Cell data (partition number, itself number).
On the basis of grid cell, after aerodynamics grid is divided using the mpmetis in METIS, NPART output File only includes the information which subregion grid cell belongs to and which subregion mesh point belongs to.It needs to carry out post-processing realization:
1) each multiblock technique unit renumbers;
2) each partition network lattice point renumbers;
3) determination of each multiblock technique subregion inner boundary unit.
Research both at home and abroad is concentrated on the algorithm of multilayer graph division, how to be divided using METIS to particular problem.But For the output data after using METIS mpmetis to divide, due to the difference of problem types, currently without open for pneumatic The post-processing approach of flow field grid dividing.
So needing to develop a kind of post-processing approach for meeting aerodynamics grid Metis auto-partition requirement, to solve The post-processing problem of aerodynamics grid Metis auto-partition.
Summary of the invention
The technical problem to be solved in the present invention is to provide a kind of post-processing sides of aerodynamics grid Metis auto-partition Method meets the completeness demand of each subregion to solve the problems, such as the post-processing of aerodynamics grid Metis auto-partition.
In order to realize the purpose, the technical solution adopted by the present invention is that:
A kind of post-processing approach of aerodynamics grid Metis auto-partition, comprising the following steps:
Setting to the aerodynamics grid A of subregion includes M mesh point, N number of grid cell, number of partitions P;Metis is certainly The data of subregion belonging to N number of grid cell are generated after dynamic subregion;
If the grid point set of each subregion is G1, G2 ... ..., GP;The grid cell set of each subregion is respectively E1, E2 ... ..., EP;The inner boundary set of each subregion distinguishes B1, B2 ... ..., BP;
Either element includes three Data Labels (li, zi, ni) in inner boundary set: li indicates grid cell in this subregion Interior number, zi indicate that the affiliated partition number of adjacent grid cell, ni indicate the number of adjacent grid cell;I=1~P;
Specific step is as follows:
Step 1: deleting the redundancy gridden data in aerodynamics grid A in N number of grid cell according to following methods;
Redundancy mesh point delet method: the mesh point in unit E is set as (e1,e2,…,eK), repeated grid point is found first And it is set to -1, then delete the gridden data that value is -1, so that redundancy mesh point in grid cell be deleted;Specific algorithm is such as Shown in lower:
Step 2: the non-directed graph TA of aerodynamics grid A is generated according to following methods;
The low computation complexity generation method of single partition aerodynamics grid non-directed graph: 1) determine that grid cell a is unduplicated Grid point set G;2) all grid cell set E comprising mesh point in G are obtained;3) a and element in E one by one compared with, obtain a All neighboring grid cells;Wherein the vertex of non-directed graph is grid cell, and side is the adjacent surface of neighboring grid cells;
Step 3: creation array E [4] [N];N represents N number of grid cell, and E [1] [:] represents the net in aerodynamics grid A Whether lattice unit is boundary element, and the value of the item in E [1] [:] is the 0 non-boundary element of expression, and the value of the item in E [1] [:] is 1 It is expressed as boundary element, is defaulted as 0;E [2] [:] indicates which subregion the grid cell of reference numeral belongs to, by Metis subregion Data determine;E [3] [:] indicates the local number of each multiblock technique unit;E [4] [:] is to reuse part;Symbol ": " table Show that whole items of corresponding array, E [1] [:] indicate E [1] [1], E [1] [2] ... ..., E [1] [N];E [2] [:] indicates E [2] [1], [2] [2] E ... ..., E [2] [N];E [3] [:] indicates E [3] [1], E [3] [2] ... ..., E [3] [N];E [4] [:] indicates E [4] [1], E [4] [2] ... ..., E [4] [N];
Step 4: determining the boundary element of grid A according to non-directed graph TA and following boundary element method of discrimination, set corresponding E [1] value of the item in [:] is 1;
Boundary element method of discrimination: if the adjacent unit number of grid cell is less than its face number, it is considered as boundary element;Net The adjacent unit number of lattice unit is the number of edges of corresponding nonoriented graph;
Step 5: the affiliated subregion of grid cell after being divided according to Metis is loaded directly into the every value of E [2] [:];According to Respective grid points, are added corresponding grid point set by the affiliated subregion of mesh point after Metis division;
Step 6: set Ep, local number Ip is added in grid cell n;
Be arranged Ip=0, p=1,2 ..., P;
Step 7:n=1;
Step 8:Ip=Ip+1;Wherein p=E [2] [n]+1;
Step 9:E [3] [n]=Ip by the local number of all grid divisions and is stored in E [3] [:];
Step 10: if n≤N meets, going to step 8, otherwise go to step 11;
Step 11: setting Ip=0, p=1,2 ..., P;
Step 12:m=1;
Step 13:Ip=Ip+1;Wherein the value of p is that the value of the affiliated subregion of mesh point after Metis is divided adds 1;
Step 14: set Gp, local number Ip is added in mesh point m;
Step 15: if m≤M meets, going to step 13, otherwise go to step 16;
Step 16:p=1;
Step 17: setting E [4] [:] is 0;
Step 18: pth is generated according to the low computation complexity generation method of single partition aerodynamics grid non-directed graph in step 2 The non-directed graph of a subregion (Gp, Ep);
Step 19: the boundary element of multiblock technique p is determined according to the boundary element method of discrimination in non-directed graph and step 4, Setting the entry value in corresponding E [4] [:] is 1;
Local grid element number is to the mapping between the grid grid element number of global grid A by E in multiblock technique p [2] [:], E [3] [:] are obtained;
All entry value of step 20:E [4] [:] and E [1] [:] are subtracted each other, and obtained result is 1,0, -1 three kind;It as a result is 1 Grid cell be multiblock technique p inner boundary unit, local number is set as l1, l2 ..., lO, and overall situation number is g1, G2 ..., gO;
Step 21: according to non-directed graph TA adjacent vertex, all adjoining grid cells of gi (1≤i≤O) are obtained, it is adjacent The global number of grid cell is k1, k2 ..., kI;
According to E [2] [:], the adjoining grid cell for belonging to p subregion is deleted, remaining grid cell overall situation number is kj1, Kj2 ..., kjJ;
According to E [2] [:], E [3] [:] obtains partition number zi, the local number ni of corresponding global number, compiles with the overall situation Number correspond;
Then a series of triples (li, zi, ni) is obtained;If (li, zi, ni) is not repeated in set Bp, then Set Bp is added in (li, zi, ni);
Step 22:p=p+1;
Step 23: if p≤P meets, going to step 17, otherwise go to step 24;
Step 24: exporting grid the point set G1, G2 ... ..., GP of each subregion;The grid cell set of each subregion is respectively E1, E2 ... ..., EP, inner boundary set B1, B2 ... ..., BP;
Step 25: post-processing is completed.
Further, a kind of post-processing approach of aerodynamics grid Metis auto-partition as described above, final subregion The data format of the aerodynamics grid of completion is Tecplot data format.
Further, a kind of post-processing approach of aerodynamics grid Metis auto-partition as described above, this method Concrete operations process is realized using lightweight Python scripting language.
Further, a kind of post-processing approach of aerodynamics grid Metis auto-partition as described above, size determine Array E [4] [N] defined with array, set sizes are indefinite to be realized with list () dynamic object.
The invention has the benefit that
(1) each multiblock technique unit, the requirement that mesh point renumbers be can satisfy;
(2) boundary element of each multiblock technique inner boundary can be quickly determined;
Detailed description of the invention
Fig. 1 is grid division schematic diagram;
Fig. 2 is Metis partition data.
Specific embodiment
Technical solution of the present invention is carried out it is further believed that explanation in the following with reference to the drawings and specific embodiments.
Fig. 1 is the aerodynamics containing 1-6 grid cell, and wherein side is adjacent surface, and circle is grid cell, is divided For 3 subregions, number difference 0,1,2.The data format of grid cell part (is named as Metis unit after Metis auto-partition Data) as shown in Fig. 2, only indicating subregion belonging to each grid cell.Mesh point partial data format is similar.
A kind of post-processing approach of aerodynamics grid Metis auto-partition of the present invention, comprising the following steps:
Setting to the aerodynamics grid A of subregion includes M mesh point, N number of grid cell, number of partitions P;Metis is certainly The data of subregion belonging to N number of grid cell are generated after dynamic subregion;
If the grid point set of each subregion is G1, G2 ... ..., GP;The grid cell set of each subregion is respectively E1, E2 ... ..., EP;The inner boundary set of each subregion distinguishes B1, B2 ... ..., BP;
Either element includes three Data Labels (li, zi, ni) in inner boundary set: li indicates grid cell in this subregion Interior number, zi indicate that the affiliated partition number of adjacent grid cell, ni indicate the number of adjacent grid cell;I=1~P;
Specific step is as follows:
Step 1: deleting the redundancy gridden data in aerodynamics grid A in N number of grid cell according to following methods;
Redundancy mesh point delet method: the mesh point in unit E is set as (e1,e2,…,eK), repeated grid point is found first And it is set to -1, then delete the gridden data that value is -1, so that redundancy mesh point in grid cell be deleted;Specific algorithm is such as Shown in lower:
It include (1,2,3,4) four mesh points such as to the tetrahedron element on the left side Fig. 1.And in the actual number of grid cell When according to indicating, may be (1,2,3, Isosorbide-5-Nitrae, 4,4,4).Need to reject the gridden data of redundancy, algorithm is as shown in Figure 2.If single Mesh point in first E is (e1,e2,…,eK), the row 1-4 in Fig. 2 finds repeated grid point and is set to -1, row 5-7 deletion value For -1 gridden data.
Step 2: the non-directed graph TA of aerodynamics grid A is generated according to following methods;
The low computation complexity generation method of single partition aerodynamics grid non-directed graph: 1) determine that grid cell a is unduplicated Grid point set G;2) all grid cell set E comprising mesh point in G are obtained;3) a and element in E one by one compared with, obtain a All neighboring grid cells;Wherein the vertex of non-directed graph is grid cell, and side is the adjacent surface of neighboring grid cells;
Step 3: creation array E [4] [N];N represents N number of grid cell, and E [1] [:] represents the net in aerodynamics grid A Whether lattice unit is boundary element, and the value of the item in E [1] [:] is the 0 non-boundary element of expression, and the value of the item in E [1] [:] is 1 It is expressed as boundary element, is defaulted as 0;E [2] [:] indicates which subregion the grid cell of reference numeral belongs to, by Metis subregion Data determine;E [3] [:] indicates the local number of each multiblock technique unit;E [4] [:] is to reuse part;Symbol ": " table Show that whole items of corresponding array, E [1] [:] indicate E [1] [1], E [1] [2] ... ..., E [1] [N];E [2] [:] indicates E [2] [1], [2] [2] E ... ..., E [2] [N];E [3] [:] indicates E [3] [1], E [3] [2] ... ..., E [3] [N];E [4] [:] indicates E [4] [1], E [4] [2] ... ..., E [4] [N];
Step 4: determining the boundary element of grid A according to non-directed graph TA and following boundary element method of discrimination, set corresponding E [1] value of the item in [:] is 1;
Boundary element method of discrimination: if the adjacent unit number of grid cell is less than its face number, it is considered as boundary element;Net The adjacent unit number of lattice unit is the number of edges of corresponding nonoriented graph;
Step 5: the affiliated subregion of grid cell after being divided according to Metis is loaded directly into the every value of E [2] [:];According to Respective grid points, are added corresponding grid point set by the affiliated subregion of mesh point after Metis division;
Step 6: set Ep, local number Ip is added in grid cell n;
Be arranged Ip=0, p=1,2 ..., P;
Step 7:n=1;
Step 8:Ip=Ip+1;Wherein p=E [2] [n]+1;
Step 9:E [3] [n]=Ip by the local number of all grid divisions and is stored in E [3] [:];
Step 10: if n≤N meets, going to step 8, otherwise go to step 11;
Step 11: setting Ip=0, p=1,2 ..., P;
Step 12:m=1;
Step 13:Ip=Ip+1;Wherein the value of p is that the value of the affiliated subregion of mesh point after Metis is divided adds 1;
Step 14: set Gp, local number Ip is added in mesh point m;
Step 15: if m≤M meets, going to step 13, otherwise go to step 16;
Step 16:p=1;
Step 17: setting E [4] [:] is 0;
Step 18: pth is generated according to the low computation complexity generation method of single partition aerodynamics grid non-directed graph in step 2 The non-directed graph of a subregion (Gp, Ep);
Step 19: the boundary element of multiblock technique p is determined according to the boundary element method of discrimination in non-directed graph and step 4, Setting the entry value in corresponding E [4] [:] is 1;
Local grid element number is to the mapping between the grid grid element number of global grid A by E in multiblock technique p [2] [:], E [3] [:] are obtained;
All entry value of step 20:E [4] [:] and E [1] [:] are subtracted each other, and obtained result is 1,0, -1 three kind;It as a result is 1 Grid cell be multiblock technique p inner boundary unit, local number is set as l1, l2 ..., lO, and overall situation number is g1, G2 ..., gO;
Step 21: according to non-directed graph TA adjacent vertex, all adjoining grid cells of gi (1≤i≤O) are obtained, it is adjacent The global number of grid cell is k1, k2 ..., kI;
According to E [2] [:], the adjoining grid cell for belonging to p subregion is deleted, remaining grid cell overall situation number is kj1, Kj2 ..., kjJ;
According to E [2] [:], E [3] [:] obtains partition number zi, the local number ni of corresponding global number, compiles with the overall situation Number correspond;
Then a series of triples (li, zi, ni) is obtained;If (li, zi, ni) is not repeated in set Bp, then Set Bp is added in (li, zi, ni);
Step 22:p=p+1;
Step 23: if p≤P meets, going to step 17, otherwise go to step 24;
Step 24: exporting grid the point set G1, G2 ... ..., GP of each subregion;The grid cell set of each subregion is respectively E1, E2 ... ..., EP, inner boundary set B1, B2 ... ..., BP;
Step 25: post-processing is completed.
Wherein step 6-10 obtains the local number of all grid divisions and is stored in E [3] [:].Step 11-15 with Step 6-10 is similar, it is therefore an objective to obtain each subregion local area network lattice point number.
In this embodiment, the data format for the aerodynamics grid that final subregion is completed is the data such as Tecplot Format.Concrete operations process of the invention can realize using lightweight Python scripting language, the array E that size determines [4] [N] available array defines, and set sizes are indefinite can be realized using list () dynamic object.

Claims (3)

1. a kind of post-processing approach of aerodynamics grid Metis auto-partition, it is characterised in that: the following steps are included:
Setting to the aerodynamics grid A of subregion includes M mesh point, N number of grid cell, number of partitions P;Metis divides automatically The data of subregion belonging to N number of grid cell are generated behind area;
If the grid point set of each subregion is G1, G2 ... ..., GP;The grid cell set of each subregion is respectively E1, E2 ... ..., EP;The inner boundary set of each subregion distinguishes B1, B2 ... ..., BP;
Either element includes three Data Labels (li, zi, ni) in inner boundary set: li indicates grid cell in this subregion Number, zi indicate that the affiliated partition number of adjacent grid cell, ni indicate the number of adjacent grid cell;I=1~P;
Specific step is as follows:
Step 1: deleting the redundancy gridden data in aerodynamics grid A in N number of grid cell according to following methods;
Redundancy mesh point delet method: the mesh point in grid cell e is set as (e1,e2,Λ,eK), repeated grid point is found first And it is set to -1, then delete the gridden data that value is -1, so that redundancy mesh point in grid cell be deleted;
Step 2: the non-directed graph TA of aerodynamics grid A is generated according to following methods;
The low computation complexity generation method of single partition aerodynamics grid non-directed graph: 1) the unduplicated grid of grid cell a is determined Point set G;2) all grid cell set E comprising mesh point in G are obtained;3) a and element in E one by one compared with, obtain the institute of a There are neighboring grid cells;Wherein the vertex of non-directed graph is grid cell, and side is the adjacent surface of neighboring grid cells;
Step 3: creation array E [4] [N];N represents N number of grid cell, and E [1] [:] represents the grid list in aerodynamics grid A Whether member is boundary element, and the value of the item in E [1] [:] is the 0 non-boundary element of expression, and the value of the item in E [1] [:] is 1 expression For boundary element, it is defaulted as 0;E [2] [:] indicates which subregion the grid cell of reference numeral belongs to, by Metis partition data It determines;E [3] [:] indicates the local number of each multiblock technique unit;E [4] [:] is to reuse part;Symbol ": " indicates phase Whole items of array are answered, E [1] [:] indicates E [1] [1], E [1] [2] ... ..., E [1] [N];E [2] [:] indicates E [2] [1], E [2] [2] ... ..., E [2] [N];E [3] [:] indicates E [3] [1], E [3] [2] ... ..., E [3] [N];E [4] [:] indicates E [4] [1], [4] [2] E ... ..., E [4] [N];
Step 4: determining the boundary element of grid A according to non-directed graph TA and following boundary element method of discrimination, set corresponding E [1] [:] In item value be 1;
Boundary element method of discrimination: if the adjacent unit number of grid cell is less than its face number, it is considered as boundary element;Grid list The adjacent unit number of member is the number of edges of corresponding nonoriented graph;
Step 5: the affiliated subregion of grid cell after being divided according to Metis is loaded directly into the every value of E [2] [:];According to Metis Corresponding grid point set is added in respective grid points by the affiliated subregion of mesh point after division;
Step 6: set Ep, local number Ip is added in grid cell n;
Be arranged Ip=0, p=1,2 ..., P;
Step 7:n=1;
Step 8:Ip=Ip+1;Wherein p=E [2] [n]+1;
Step 9:E [3] [n]=Ip by the local number of all grid divisions and is stored in E [3] [:];
Step 10: if n≤N meets, going to step 8, otherwise go to step 11;
Step 11: setting Ip=0, p=1,2 ..., P;
Step 12:m=1;
Step 13:Ip=Ip+1;Wherein the value of p is that the value of the affiliated subregion of mesh point after Metis is divided adds 1;
Step 14: set Gp, local number Ip is added in mesh point m;
Step 15: if m≤M meets, going to step 13, otherwise go to step 16;
Step 16:p=1;
Step 17: setting E [4] [:] is 0;
Step 18: generating p-th point according to the low computation complexity generation method of single partition aerodynamics grid non-directed graph in step 2 The non-directed graph in area (Gp, Ep);
Step 19: determining the boundary element of p-th of subregion according to the boundary element method of discrimination in non-directed graph and step 4, set phase Answering the entry value in E [4] [:] is 1;
Local grid element number is to the mapping between the grid grid element number of global grid A by E [2] in p-th of subregion [:], E [3] [:] are obtained;
All entry value of step 20:E [4] [:] and E [1] [:] are subtracted each other, and obtained result is 1,0, -1 three kind;It as a result is 1 net Lattice unit is the inner boundary unit of multiblock technique p, and local number is set as l1, l2 ..., lO, and overall situation number is g1, g2 ..., gO;
Step 21: according to non-directed graph TA adjacent vertex, obtaining gi, 1≤i≤O, all adjoining grid cells, adjacent grid The global number of unit is k1, k2 ..., kI;
According to E [2] [:], the adjoining grid cell for belonging to p subregion is deleted, remaining grid cell overall situation number is kj1, Kj2 ..., kjJ;
According to E [2] [:], E [3] [:] obtains partition number zi, the local number ni of corresponding global number, with global number one One is corresponding;
Then a series of triples (li, zi, ni) is obtained;If (li, zi, ni) is not repeated in set Bp, then (li, zi, Ni set Bp) is added;
Step 22:p=p+1;
Step 23: if p≤P meets, going to step 17, otherwise go to step 24;
Step 24: exporting grid the point set G1, G2 ... ..., GP of each subregion;The grid cell set of each subregion is respectively E1, E2 ... ..., EP, inner boundary set B1, B2 ... ..., BP;
Step 25: post-processing is completed.
2. a kind of post-processing approach of aerodynamics grid Metis auto-partition as described in claim 1, it is characterised in that: The data format for the aerodynamics grid that final subregion is completed is Tecplot data format.
3. a kind of post-processing approach of aerodynamics grid Metis auto-partition as described in claim 1, it is characterised in that: The concrete operations process of this method is realized using lightweight Python scripting language.
CN201410602345.4A 2014-10-31 2014-10-31 A kind of post-processing approach of aerodynamics grid Metis auto-partition Active CN105550384B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410602345.4A CN105550384B (en) 2014-10-31 2014-10-31 A kind of post-processing approach of aerodynamics grid Metis auto-partition

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410602345.4A CN105550384B (en) 2014-10-31 2014-10-31 A kind of post-processing approach of aerodynamics grid Metis auto-partition

Publications (2)

Publication Number Publication Date
CN105550384A CN105550384A (en) 2016-05-04
CN105550384B true CN105550384B (en) 2019-05-07

Family

ID=55829573

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410602345.4A Active CN105550384B (en) 2014-10-31 2014-10-31 A kind of post-processing approach of aerodynamics grid Metis auto-partition

Country Status (1)

Country Link
CN (1) CN105550384B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107578020A (en) * 2017-09-13 2018-01-12 明见(厦门)技术有限公司 Mobile object detection method, device, medium and computing device

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1021798A2 (en) * 1997-10-08 2000-07-26 Maria-Cecillia Rivara Longest-edge refinement and derefinement system and method for automatic mesh generation
CN103838852A (en) * 2014-03-13 2014-06-04 北京大学工学院南京研究院 Method for rapidly searching for multi-block structured grid docking relations

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1021798A2 (en) * 1997-10-08 2000-07-26 Maria-Cecillia Rivara Longest-edge refinement and derefinement system and method for automatic mesh generation
CN103838852A (en) * 2014-03-13 2014-06-04 北京大学工学院南京研究院 Method for rapidly searching for multi-block structured grid docking relations

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"气动热数值模拟中壁面热流后处理方法";张胜涛等;《航空动力学报》;20141020;全文
"非结构网格的并行多重网格算法研究";李宗哲;《中国博士学位论文全文数据库 信息科技辑》;20141015;全文
collocated grid implementation in the large scale flow field simulation with complex boundary;WU Wei等;《journal of northwest A & F university(natural science edition)》;20100531;全文

Also Published As

Publication number Publication date
CN105550384A (en) 2016-05-04

Similar Documents

Publication Publication Date Title
Witherden et al. Future directions in computational fluid dynamics
Han et al. A variable-fidelity modeling method for aero-loads prediction
Wang et al. Delaunay graph and radial basis function for fast quality mesh deformation
Ma et al. Hardware implementation and optimization of tiny-YOLO network
CN102490909B (en) Multi-body separating analogy method of aircraft
CN112016167A (en) Aircraft aerodynamic shape design method and system based on simulation and optimization coupling
CN104036095A (en) Regional-decomposition based high-precision coupling fast-calculation method for complex-shape flow field
CN107609141A (en) It is a kind of that quick modelling method of probabilistic is carried out to extensive renewable energy source data
CN112541584B (en) Deep neural network model parallel mode selection method
CN104408773B (en) Method for interpolating structured grid non-matching interface
Chang et al. A parallel implicit hole-cutting method based on background mesh for unstructured Chimera grid
CN104636454B (en) A kind of joint clustering method towards large scale scale heterogeneous data
Rasquin et al. Scalable fully implicit finite element flow solver with application to high-fidelity flow control simulations on a realistic wing design
Peters et al. On the construction of a mode based reduced order model for a moving store
CN105550384B (en) A kind of post-processing approach of aerodynamics grid Metis auto-partition
CN109190328B (en) Multi-parameter structure dynamic response sensitivity analysis method based on mixed finite-complex difference
CN103353910A (en) Circuit partitioning method for parallel circuit simulation
Tesfahunegn et al. Surrogate-based airfoil design with space mapping and adjoint sensitivity
Choi et al. Transonic flow analysis with discontinuous Galerkin method in SU2 DG-FEM solver
CN103218493A (en) Fast isogeometric analysis numerical simulation method based on multiple grids
Yilmaz et al. Surface conformed linear mesh and data subdivision technique for large-scale flow simulation and visualization in variable intensity computational environment
CN106780747A (en) A kind of method that Fast Segmentation CFD calculates grid
CN103336778B (en) A kind of task towards parallel POI simplification splits and distribution method
Becker et al. Max-plus algebra and discrete event simulation on parallel hierarchical heterogeneous platforms
Laroche et al. Development of an aircraft aero-icing suite using chapel programming language

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant