Cart (Loading....) | Create Account
Close category search window
 

A parallel FDTD algorithm based on domain decomposition method using the MPI library

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Dan Yang ; Electromagn. Inst., Southwest Jiaotong Univ., Chengdu, China ; Cheng Liao ; Lang Jen ; Jie Xiong

We present parallel algorithm for FDTD method. The algorithm is based on DDM (domain decomposition method). We use the MPI (message passing interface) library to implement the parallel DD-FDTD method. The original domain is decomposed into several subdomains according to the features of the problem, which are treated as the processes to computation nodes. The FDTD computation is carried out independently in local meshes in each process. The data are exchanged by communication between adjacent subdomains or with overlapped meshes and the interpolation scheme is applied to the data exchanged. The example of its application is given.

Published in:

Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on

Date of Conference:

27-29 Aug. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.