TY - GEN

T1 - Frequency interpolation methods for accelerating parallel EMC analysis

AU - Homma, K.

AU - Nagase, K.

AU - Noro, M.

AU - Strazdins, P. E.

AU - Yamagajo, T.

N1 - Publisher Copyright:
© 2001 IEEE.

PY - 2001

Y1 - 2001

N2 - Electro-magnetic field analysis applications based on the Method of Moments can be used to simulate the emissions for electrical devices such as a printed circuit board, a combination of circuit boards and wire connecting boards, or even a cabinet. At the heart of such applications is a solver, which solves a symmetric indefinite dense linear system of size N assembled from the model of the electrical device. The main computational challenges lie in the solver stage, where an O(N3) computation is required for the direct solution of the linear system about a central frequency ωc. For the direct solution we use a general symmetric matrix factorization algorithm, requiring N3/3 + O(N2) FLOPs. This algorithm's efficiency is demonstrated by its parallel speedup of 5 for moderate sized matrices on an 8 node AP3000. Some of this cost can be amortized using the fast frequency stepping method, where the system can be solved for nearby frequencies ω by O(N2) iterative methods, using the solution at ωc as a preconditioner. Due to the high parallel efficiency of the direct method, the frequency stepping method reduced parallel solution time by a factor of 2 for moderate-sized matrices, with larger improvements expected for large matrices.

AB - Electro-magnetic field analysis applications based on the Method of Moments can be used to simulate the emissions for electrical devices such as a printed circuit board, a combination of circuit boards and wire connecting boards, or even a cabinet. At the heart of such applications is a solver, which solves a symmetric indefinite dense linear system of size N assembled from the model of the electrical device. The main computational challenges lie in the solver stage, where an O(N3) computation is required for the direct solution of the linear system about a central frequency ωc. For the direct solution we use a general symmetric matrix factorization algorithm, requiring N3/3 + O(N2) FLOPs. This algorithm's efficiency is demonstrated by its parallel speedup of 5 for moderate sized matrices on an 8 node AP3000. Some of this cost can be amortized using the fast frequency stepping method, where the system can be solved for nearby frequencies ω by O(N2) iterative methods, using the solution at ωc as a preconditioner. Due to the high parallel efficiency of the direct method, the frequency stepping method reduced parallel solution time by a factor of 2 for moderate-sized matrices, with larger improvements expected for large matrices.

UR - http://www.scopus.com/inward/record.url?scp=84981164337&partnerID=8YFLogxK

U2 - 10.1109/IPDPS.2001.925177

DO - 10.1109/IPDPS.2001.925177

M3 - Conference contribution

T3 - Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

SP - 1865

EP - 1871

BT - Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Y2 - 23 April 2001 through 27 April 2001

ER -