Block adaptive type Cartesian grid rapid graph mapping method and system

A technology of Cartesian grid and mapping method, which is applied in the field of block-adaptive Cartesian grid fast map mapping method and system, which can solve the difficulty of integrating adaptive geometry modules and physical field numerical simulators, and the conversion of dynamic geometric data formats Low efficiency and other issues, to avoid complex modification work, reduce the number of queries, and promote the effect of deep integration

Active Publication Date: 2021-11-23
CALCULATION AERODYNAMICS INST CHINA AERODYNAMICS RES & DEV CENT
View PDF5 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In order to overcome the deficiencies of the prior art, the present invention provides a block-adaptive type Cartesian grid rapid map mapping method and system, which solves the difficu

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Block adaptive type Cartesian grid rapid graph mapping method and system
  • Block adaptive type Cartesian grid rapid graph mapping method and system
  • Block adaptive type Cartesian grid rapid graph mapping method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0069] like Figure 1 to Figure 10 As shown, a block-adaptive Cartesian grid fast graph mapping method, including the following steps:

[0070] S1. After the MPI environment is initialized, the geometric data of the distributed block-adaptive Cartesian grid is imported into each processor, so as to reconstruct the multi-tree structure and establish the link relationship of adjacent hierarchical nodes;

[0071] S2, share the node geometry information at the region decomposition boundary across processors, and store it in the corresponding virtual node data container;

[0072] S3, Construct the local geometric topology of each leaf node on the current processor;

[0073] S4, normalize fully coincident geometric elements on each processor;

[0074] S5, establishing a dynamic communication map of docking surface elements at the domain decomposition boundary based on cross-processor query operations;

[0075] S6, exporting the unstructured polyhedron computing grid in parallel o...

Embodiment 2

[0110] like Figure 1 to Figure 10 As shown, as a further optimization of Embodiment 1, this embodiment includes all the technical features of Embodiment 1. In addition, this embodiment also includes the following technical features:

[0111] A block-adaptive Cartesian grid fast graph mapping system, including the following modules:

[0112] The first module is used to import the geometric data of the distributed block adaptive Cartesian grid into each processor after the MPI environment is initialized, so as to reconstruct the multi-fork tree structure and establish the links of adjacent hierarchical nodes relation;

[0113] The second module is used for cross-processor sharing of node geometry information at the region decomposition boundary and storing it in a corresponding virtual node data container;

[0114] The third module is used to construct the local geometric topology of each leaf node on the current processor;

[0115] A fourth module to normalize fully coincid...

Embodiment 3

[0119] like Figure 1 to Figure 10 As shown, this embodiment includes all the technical features of Embodiment 1 and Embodiment 2. On the basis of Embodiment 1 and Embodiment 2, this embodiment provides a more detailed implementation mode.

[0120] The invention belongs to the intersecting fields of computational fluid dynamics, computational geometry and high-performance computing, and specifically relates to a fast graph mapping technology of a distributed block adaptive Cartesian grid based on MPI programming.

[0121] Aiming at the problems pointed out in the background technology, the present invention provides a parallel graph mapping technology, which quickly realizes the conversion of block-adaptive Cartesian grids to general polyhedral unstructured grids on each processor. On the boundary, the complex many-to-one or one-to-many face-to-face relationship is decomposed into an equivalent one-to-one mapping relationship. The graph mapping module established based on thi...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a block adaptive type Cartesian grid rapid graph mapping method and system, and the method comprises the following steps: S1, after an MPI environment is initialized, importing geometric data of a distributed block adaptive type Cartesian grid into each processor so as to reconstruct a multi-way tree structure, and building a link relation of adjacent hierarchical nodes; S2, sharing node geometric information at a region decomposition boundary across processors, and storing the node geometric information in a corresponding virtual node data container; S3, constructing a local geometric topology of each leaf node on the current processor; S4, normalizing the completely overlapped geometric elements on each processor; S5, based on cross-processor query operation, establishing dynamic communication mapping of docking surface elements at the region decomposition boundary; and S6, exporting the non-structural polyhedron computational grids in parallel on each processor. The problems that in the prior art, a self-adaptive geometric module and a physical field numerical simulator are difficult to fuse, and the dynamic geometric data format conversion efficiency is low are solved.

Description

technical field [0001] The invention relates to the technical field of grid processing, in particular to a block-adaptive Cartesian grid fast map mapping method and system. Background technique [0002] Adaptive Cartesian grid technology is one of the most effective methods to capture local flow characteristics in computational fluid dynamics. It can dynamically adjust the spatial distribution of grid scales according to the specified flow criteria, thereby providing a comprehensive analysis for the evolution process of large-scale spatial vortex. Numerical simulations provide support. Cartesian grids can be divided into two types, cell adaptive and block adaptive, according to different adaptive methods. In terms of data structure, the former completes the division of the calculation area with a set of leaf nodes of the multi-fork tree, while the latter generates a finer local grid block structure on the leaf nodes of the multi-fork tree. Compared with the unit adaptive m...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06T17/00G06T17/20G06F30/23G06F30/28
CPCG06T17/005G06T17/205G06F30/23G06F30/28
Inventor 郭永恒何先耀肖中云庞宇飞刘杨
Owner CALCULATION AERODYNAMICS INST CHINA AERODYNAMICS RES & DEV CENT
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap