Parallel preconditioners for solutions of dense linear systems with tens of millions of unknowns


Creative Commons License

Malas T., Ergul O., Gurel L.

22nd International Symposium on Computer and Information Sciences, Ankara, Turkey, 7 - 09 November 2007, pp.399-402 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1109/iscis.2007.4456895
  • City: Ankara
  • Country: Turkey
  • Page Numbers: pp.399-402

Abstract

We propose novel parallel preconditioning schemes for the iterative solution of integral equation methods. In particular, we try to improve convergence rate of the ill-conditioned linear systems formulated by the electric-field integral equation, which is the only integral-equation formulation for targets having open surfaces. For moderate-size problems, iterative solution of the neat-field system enables much faster convergence compared to the widely used sparse approximate inverse preconditioner. For larger systems, we propose an approximation strategy to the multilevel fast multipole algorithm (MLFMA) to be used as a preconditioner. Our numerical experiments reveal that this scheme significantly outperforms other preconditioners. With the combined effort of effective preconditioners and an efficiently parallelized MLFMA, we are able to solve targets with tens of millions of unknowns, which are the largest problems ever reported in computational electromagnetics.