Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

10 results about "Domain decomposition methods" patented technology

In mathematics, numerical analysis, and numerical partial differential equations, domain decomposition methods solve a boundary value problem by splitting it into smaller boundary value problems on subdomains and iterating to coordinate the solution between adjacent subdomains. A coarse problem with one or few unknowns per subdomain is used to further coordinate the solution between the subdomains globally. The problems on the subdomains are independent, which makes domain decomposition methods suitable for parallel computing. Domain decomposition methods are typically used as preconditioners for Krylov space iterative methods, such as the conjugate gradient method or GMRES.

Three-dimensional finite element transient electromagnetic forward modeling calculation method based on iterative solution method

The invention relates to the technical field of geophysical exploration, and particularly provides a three-dimensional finite element transient electromagnetic forward modeling calculation method based on an iterative solution method.The method comprises the steps that tetrahedron space discretization is carried out based on a vector finite element method, and an electric field is given to six edges of a space tetrahedron; constructing a back-pushing Euler finite element equation set, and assembling a linear system formed by a large sparse matrix based on the equation set; performing iterative solution on the linear system based on an FGMRES algorithm to obtain an electric field value corresponding to a spatial tetrahedron unit edge; optimizing a spatial tetrahedral mesh based on a quadratic nesting method, and optimizing a time step length based on a third-order backward Euler difference format; a grid pre-encryption method is adopted, the calculation error of iterative solution is reduced, a region decomposition method is used for achieving parallel calculation, and the calculation efficiency is greatly improved. According to the method, the requirements of high precision and high efficiency in three-dimensional transient electromagnetic forward modeling calculation can be met, and an advanced calculation tool is provided for resource exploration in a complex geological environment.
Owner:CENT SOUTH UNIV

Pile-soil-structure dynamic interaction analysis method

The invention provides a pile-soil-structure dynamic interaction analysis method, which belongs to the technical field of civil engineering, and obtains system data through three-scale physical model experiments: the first scale pays attention to microscopic soil behaviors, the second scale and the third scale are determined based on a multiphase fluid-solid coupling equation, and the third scale is determined based on a multiphase fluid-solid coupling equation; and respectively paying attention to the mesoscopic interface action and the macroscopic overall response. A pile-soil interface control equation and a pile structure coupling equation are established based on experimental data to form a basic equation set, a domain decomposition method is adopted to divide a calculation area into a fine grid near field and a rough grid far field, and a minimum spanning tree algorithm is applied to optimize grid division. Pile body stress distribution and a soil body deformation field are obtained through numerical solution, a pile foundation transverse displacement function is obtained through analysis solution, finally the pile body stress distribution and the soil body deformation field are combined to form a complete pile-soil-structure dynamic interaction model, and the technical problem that the pile-soil-structure dynamic interaction cross-scale effect is difficult to accurately simulate is solved.
Owner:CHINA CONSTR EIGHTH BUREAU DEV & CONSTR CO LTD

Spectral element tearing and splicing region decomposition method for embedding multi-pole perfect matching layer technology

The invention discloses a spectral element tearing and splicing region decomposition method embedded with a multi-pole perfect matching layer technology, and the efficiency and precision of seismic wave forward modeling simulation are improved through the fusion of the multi-pole perfect matching layer technology and a region decomposition strategy. The time domain convolution of the multi-pole perfect matching layer is eliminated through a recursion auxiliary equation, the boundary truncation calculation complexity is reduced, glancing waves and long-distance propagation waves are efficiently absorbed, and false reflection is restrained. According to the regional decomposition strategy, a global three-dimensional problem is converted into a two-dimensional interface problem through implicit interface constraint and explicit angular point continuity execution, meanwhile, the explicit calculation advantage of a spectral element method on an angular mass matrix is kept, and rapid solution is achieved without matrix inversion. A load balancing mechanism dynamically allocates tasks of a computational domain and a perfect matching layer, and parallel computing efficiency is guaranteed. The system supports high-order interpolation and large-scale grid division of a complex geologic model, appropriately increases memory consumption, improves engineering practicability, and provides an efficient and reliable simulation tool for deep ground resource exploration.
Owner:ANHUI UNIV

An electromagnetic scattering simulation method for coated aircraft based on multi-resolution preprocessing

The present invention belongs to the field of electromagnetic simulation technology, and specifically provides an electromagnetic scattering simulation method for coated aircraft based on multi-resolution preconditioning, which is used to complete the electromagnetic scattering simulation calculation of coated targets, accelerate iterative convergence while ensuring the simulation calculation accuracy, and effectively reduce the memory requirement. The present invention introduces multi-resolution (MR) preconditioning on the basis of the locally coupled multiple unknowns domain decomposition method. First, new Robin transmission conditions are set, and the LCMT-DDM equation is constructed based on them; then symmetry is carried out, and the MR-LCMT-DDM equation is further constructed; finally, the equation is solved to obtain the unknown coefficient vector, and then the electromagnetic scattering of the coated target is calculated. The symmetry method proposed by the present invention can reduce the memory requirement by nearly half, and the matrix property can be further improved through multi-resolution preconditioning, significantly accelerating the iterative convergence without affecting the numerical accuracy.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA

A Three-Level Coarse Mesh Finite Difference Acceleration Method under a Domestic DCU Architecture

The present invention proposes a three - level coarse - mesh finite - difference acceleration method for domestic DCU architecture, belonging to the cross - technical field of neutron physics and high - performance computing. The method includes: in the three - dimensional characteristic - line transport scanning stage, according to the domain - decomposition method, the computing tasks are sent to the device side (domestic DCU). Inside the DCU, according to the coarse - mesh vertices, edges and faces to which the trajectory segments belong, the neutron flux on the coarse - mesh surfaces to which the trajectory segments belong is stored, and the neutron flux that needs data transfer at the communication - domain boundary is stored; in the three - level coarse - mesh finite - difference method, the calculation results of the characteristic - line three - dimensional characteristic - line transport solution are transferred to the three - level coarse - mesh finite - difference solution module. Among them, the three - level coarse - mesh finite - difference performs multiple coarsening acceleration calculations in terms of energy groups and geometric structures, that is, a coarser mesh with a higher coarsening degree is used to accelerate the iterative calculation of the previous - level coarse mesh. The coarsening degrees of the three - level meshes from small to large are represented as the multi - energy - group cell - level mesh, the single - energy - group cell - level mesh and the single - energy - group assembly - level mesh. Then, the finite - difference equations of each level of the coarse mesh are constructed and solved using the successive over - relaxation iteration method. Finally, the fluxes in each flat - source region are updated according to the calculation results, and the effective neutron multiplication factor in the current iteration is calculated. The present invention relates to the cross - technical field of neutron physics and high - performance computing.
Owner:UNIV OF SCI & TECH BEIJING

Spatial data spectral domain decomposition method and apparatus applying laplace operator

The application discloses a spatial data spectral domain decomposition method and device applying Laplace operator, and belongs to the technical field of three-dimensional spatial perception data. In view of the three-dimensional space field model construction widely existing in the coal mine scene, the space model coordinate transformation has the invariance representation, the space model is not dependent on the specific coordinate and is decomposed, and the decomposition quantity is used for coding and decoding; the Laplace operator calculation based on cotangent and Hodge dual area is carried out on the original characteristic spectrum, so that the calculation of the characteristic value and the characteristic equation of the original model is realized, and the original model is smoothed and spectrally decomposed and visualized by using the characteristic value and the characteristic equation. The space occupation is low, the model calculation time is low, the fine part is convenient to express, the number of features k can be selected according to the selected precision requirement, the original model is restored, and details of the original model are selected and reserved according to the number of k.
Owner:CHINA COAL RES INST +1

A Fast Algorithm for Two-Dimensional Nonlinear Steady-State Temperature Fields Based on an Improved Domain Decomposition Method

This invention discloses a fast algorithm for solving two-dimensional nonlinear steady-state temperature fields using an improved domain decomposition method. This algorithm divides the solution domain into multiple non-overlapping sub-regions, enabling parallel computation of the nonlinear physical field distribution in each sub-region, thus avoiding the need to construct and store large global matrices in traditional finite element methods. Compared to overlapping domain decomposition methods, this invention simplifies the sub-domain partitioning process and only considers the sub-domain boundary nodes as overlapping parts, reducing the computational scale. Compared to non-overlapping domain decomposition methods, this invention relies on Dirichlet boundary condition interaction information, resulting in faster iterative convergence. This invention uses the improved domain decomposition method to solve the finite element model of the nonlinear steady-state temperature field. The steady-state temperature field distribution in each sub-region can be computed in parallel using the multi-threaded processor of the computing platform. Compared to finite element software, this invention can improve the computational speed for solving the nonlinear steady-state temperature field distribution of a contactor by up to 3.38 times.
Owner:HARBIN INST OF TECH

Two-dimensional nonlinear steady-state temperature field fast algorithm of improved region decomposition method

The invention discloses a two-dimensional nonlinear steady-state temperature field fast algorithm of an improved regional decomposition method, which is characterized in that a solution domain is divided into a plurality of non-overlapped sub-regions, the nonlinear physical field distribution of each sub-region can be calculated in parallel, and the problem that a large global matrix needs to be constructed and stored in a traditional finite element method is avoided. Compared with an overlapping type region decomposition method, the method has the advantages that the sub-domain division process is simple, only sub-domain boundary nodes serve as overlapping parts, and the calculation scale is reduced. Compared with a non-overlapping region decomposition method, the method depends on Dirichlet boundary condition interaction information, and the iteration convergence speed is higher. According to the method, the finite element model of the nonlinear steady-state temperature field is solved by using an improved region decomposition method, the steady-state temperature field distribution of each sub-region can be calculated in parallel through a multi-thread processor of a calculation platform, and compared with finite element software, the calculation speed for solving the nonlinear steady-state temperature field distribution of the contactor can be increased by 3.38 times at most.
Owner:HARBIN INST OF TECH

Storage and calculation integrated architecture simulator acceleration method based on dynamic domain decomposition

ActiveCN119781993AResource allocationBiological modelsAlgorithmDomain decomposition methods
The invention discloses a storage and calculation integrated architecture simulator acceleration method based on dynamic domain decomposition, and the method is based on a dynamic domain decomposition technology, and is especially suitable for a discrete event driven type simulation environment. An existing system structure simulator can utilize the advantages of a modern multi-core CPU to divide a simulation task into a plurality of relatively independent parts through a domain decomposition strategy so as to achieve parallel processing. However, in a storage and calculation integrated framework, due to the fact that the number of calculation cores is large and complex connection topology exists between the cores, a traditional domain decomposition method is difficult to effectively apply, and the simulation efficiency is greatly limited. According to the method provided by the invention, the problem is solved, and dynamic domain decomposition is carried out on the simulation model through a specially designed algorithm by utilizing a mapping file provided by a compiler. According to the method, domain division can be adjusted and optimized in real time according to specific requirements of the simulation architecture during execution of different tasks, and the working efficiency and the simulation speed of the storage and calculation integrated architecture simulator are remarkably improved.
Owner:ZHEJIANG LAB

An Accelerating Method for In-Memory Computing Architecture Simulator Based on Dynamic Domain Decomposition

ActiveCN119781993BResource allocationBiological modelsDomain decomposition methodsParallel processing
The present invention discloses an acceleration method for a memory-computation integrated architecture simulator based on dynamic domain decomposition. This method is based on the dynamic domain decomposition technology and is particularly suitable for discrete event-driven simulation environments. Existing architecture simulators will utilize the advantages of modern multi-core CPUs and divide simulation tasks into multiple relatively independent parts through domain decomposition strategies to achieve parallel processing. However, in a memory-computation integrated architecture, due to the large number of computing cores and the complex connection topologies among the cores, traditional domain decomposition methods are difficult to be effectively applied, which greatly limits the simulation efficiency. The method proposed by the present invention solves the above problems. It utilizes the mapping file provided by the compiler and performs dynamic domain decomposition on the simulation model through a specially designed algorithm. This method can adjust and optimize the division of domains in real time according to the specific requirements of the simulation architecture when executing different tasks, significantly improving the working efficiency and simulation speed of the memory-computation integrated architecture simulator.
Owner:ZHEJIANG LAB