Login| Sign Up| Help| Contact|

Patent Searching and Data


Title:
TOTAL MATRIX COMPUTATION-BASED DISCRETE ELEMENT NEIGHBOR SEARCH AND SOLUTION FINDING METHOD AND SYSTEM
Document Type and Number:
WIPO Patent Application WO/2021/088099
Kind Code:
A1
Abstract:
A total matrix computation-based discrete element neighbor search and solution finding method and system. The method comprises: dividing a space into orthogonal grid cells; establishing, by means of total matrix computation and on the basis of neighbor domain cells of the grid cells, an initial contact search matrix, and selecting, by means of distance determination, contact information and a virtual unit filling method to obtain a neighbor matrix representation of a contact search; and performing solution finding computation of a discrete element program on the basis of a neighbor matrix and a corresponding boolean matrix. The method and the system implement pure matrix computation for discrete element neighbor searches and solution finding computation without using a loop structure, thereby greatly improving three-dimensional discrete element computation efficiency by means of a GPU-based parallel acceleration technique.

Inventors:
LIU CHUN (CN)
LIU HUI (CN)
SHI BIN (CN)
WANG BAOJUN (CN)
LE TIANCHENG (CN)
ZHANG DAN (CN)
TANG CHAOSHENG (CN)
ZHU HONGHU (CN)
GU KAI (CN)
Application Number:
PCT/CN2019/117382
Publication Date:
May 14, 2021
Filing Date:
November 12, 2019
Export Citation:
Click for automatic bibliography generation   Help
Assignee:
UNIV NANJING (CN)
International Classes:
G06F17/16; G06F16/901
Foreign References:
CN104239277A2014-12-24
CN104239414A2014-12-24
US20130297270A12013-11-07
CN103984829A2014-08-13
CN109977505A2019-07-05
Attorney, Agent or Firm:
NANJING RUIHONG PATENT & TRADEMARK AGENCY (ORDINARY PARTNERSHIP) (CN)
Download PDF: