摘要 : We propose a novel and efficient algorithm to parallelize the finite-difference time-domain method, where the observation period is divided into an arbitrary number of subsections, whose computation is distributed to corresponding... 展开 We propose a novel and efficient algorithm to parallelize the finite-difference time-domain method, where the observation period is divided into an arbitrary number of subsections, whose computation is distributed to corresponding computer nodes. The proposed algorithm roughly reduces the computational time to an<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">${n}$</tex-math></inline-formula>th fraction of the conventional algorithm, where<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">${n}$</tex-math></inline-formula>is the number of nodes for parallel computing, thus verifying its efficiency improvement. 收起