Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Parallel Method for Domain Decomposition Efficient for Unconditionally Stable Finite-Difference Time-Domain Methods

A finite difference method and domain decomposition technology, applied in the field of large-scale parallel computing, can solve the problems of prolonged simulation time, inability to enlarge the time step, and restrictions on large-scale efficient parallel computing, so as to enlarge the time step and reduce the calculation time Effect

Active Publication Date: 2020-12-04
NANJING UNIV OF SCI & TECH
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although the traditional explicit finite-difference time-domain method satisfies the natural parallelism and can realize large-scale parallel computing, the explicit finite-difference time-domain method is limited by stability conditions and cannot enlarge the time step, resulting in longer simulation time
Implicit scheme finite difference method in time domain, such as leapfrog alternate direction implicit scheme finite difference method in time domain is not limited by stability conditions and can enlarge the time step, but it needs to solve the tridiagonal matrix during the solution process, which limits large-scale efficient parallel computing

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
  • A Parallel Method for Domain Decomposition Efficient for Unconditionally Stable Finite-Difference Time-Domain Methods
  • A Parallel Method for Domain Decomposition Efficient for Unconditionally Stable Finite-Difference Time-Domain Methods
  • A Parallel Method for Domain Decomposition Efficient for Unconditionally Stable Finite-Difference Time-Domain Methods

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0014] The present invention will be described in further detail below in conjunction with the accompanying drawings.

[0015] The present invention is a kind of region decomposition parallel method effective to the unconditional stable time domain finite difference method, and the steps are as follows:

[0016] In the first step, MPI (message passing interface) is initialized, and the three-dimensional computing space is divided into regions according to each direction, the total number of processes is determined, and each process is numbered;

[0017] The second step is to execute the pre-processing of the program, and set the simulation parameters, including the setting of absorbing boundary conditions, the addition of plane waves, etc. attached figure 1 The solid line in is the boundary of the calculation area division in step 1. Each calculation area is expanded outwards to make it intersect with the adjacent calculation area to form a buffer area. For example, the actua...

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 present invention discloses a domain decomposition parallel method effective for an unconditional stable time-domain finite difference method. In the present invention, the causal domain decomposition method is used to realize the height parallelization of the frog jump alternating direction implicit scheme time-domain finite difference method, and height parallel calculation can be carried out while the unconditional stability is maintained. According to the method disclosed by the present invention, the simulating calculation time on the time-domain finite difference method can be effectively saved, and the programming is simple and the method has a strong practical engineering application value.

Description

technical field [0001] The invention belongs to the numerical calculation technology of implicit format time-domain finite difference algorithm, belongs to the field of large-scale parallel computing, and specifically relates to an area decomposition parallel algorithm effective for unconditionally stable time-domain finite difference. Background technique [0002] With the rapid development of computer hardware technology, single-core computing can no longer meet the current needs, and multi-core large-scale parallel computing has become the current mainstream direction. Although the traditional explicit finite-difference time-domain method satisfies the natural parallelism and can realize large-scale parallel computing, the explicit finite-difference time-domain method is limited by stability conditions and cannot enlarge the time step, resulting in longer simulation time. Implicit scheme finite difference method in time domain, such as leapfrog alternate direction implici...

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
Patent Type & Authority Patents(China)
IPC IPC(8): G06F30/23G06F9/54
CPCG06F9/546G06F30/23
Inventor 陈如山陈星光丁大志樊振宏
Owner NANJING UNIV OF SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products