A parallel algorithm for the two-dimensional time fractional diffusion equation with implicit difference method.
It is very time consuming to solve fractional differential equations. The computational complexity of two-dimensional fractional differential equation (2D-TFDE) with iterative implicit finite difference method is O(M(x)M(y)N(2)). In this paper, we present a parallel algorithm for 2D-TFDE and give an...
| Publicado en: | Scientific World Journal pp. 219580 - 219581 |
|---|---|
| Autores principales: | , , , , |
| Formato: | research Journal Article |
| Publicado: |
Wiley-Blackwell
2014
|
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=103818938&site=ehost-live header: @attributes: shortDbName: ccm uiTerm: 103818938 longDbName: CINAHL Complete uiTag: AN controlInfo: bkinfo: dissinfo: jinfo: jid: 1537744X 1BX5 jtl: Scientific World Journal issn: 1537744X maglogo: N pubinfo: dt: 2014 pid: 480 pub: Wiley-Blackwell place: Malden, Massachusetts artinfo: ui: 103818938 103818938 NLM24744680 2012554072 10.1155/2014/219580 NLM24744680 PMC3972955 103818938 ppf: 219580 ppct: 1 formats: tig: atl: A parallel algorithm for the two-dimensional time fractional diffusion equation with implicit difference method. aug: au: Gong, Chunye Bao, Weimin Tang, Guojian Jiang, Yuewen Liu, Jie affil: College of Aerospace Science and Engineering, National University of Defense Technology, Changsha 410073, China ; Science and Technology on Space Physics Laboratory, Beijing 100076, China ; School of Computer Science, National University of Defense Technology, Changsha 410073, China. sug: subj: Algorithms Diffusion Models, Theoretical Computing Methodologies Computer Simulation ab: It is very time consuming to solve fractional differential equations. The computational complexity of two-dimensional fractional differential equation (2D-TFDE) with iterative implicit finite difference method is O(M(x)M(y)N(2)). In this paper, we present a parallel algorithm for 2D-TFDE and give an in-depth discussion about this algorithm. A task distribution model and data layout with virtual boundary are designed for this parallel algorithm. The experimental results show that the parallel algorithm compares well with the exact solution. The parallel algorithm on single Intel Xeon X5540 CPU runs 3.16-4.17 times faster than the serial algorithm on single CPU core. The parallel efficiency of 81 processes is up to 88.24% compared with 9 processes on a distributed memory cluster system. We do think that the parallel computing technology will become a very basic method for the computational intensive fractional applications in the near future. pubtype: Academic Journal doctype: research Journal Article ougenre: Article language: English refInfo: holdings: @attributes: islocal: N |
|---|