## Abstract

We consider the preconditioned iterative solution of large dense linear systems, where the coefficient matrix is a complex valued matrix arising from discretizing the integral equation of electromagnetic scattering. For some scattering structures this matrix can be poorly conditioned. The main purpose of this study is to evaluate the efficiency of a class of incomplete LU (ILU) factorization preconditioners for solving this type of matrices. We solve the electromagnetic wave equations using the BiCG method with an ILU preconditioner in the context of a multilevel fast multipole algorithm (MLFMA). The novelty of this work is that the ILU preconditioner is constructed using the near part block diagonal submatrices generated from the MLFMA. Experimental results show that the ILU preconditioner reduces the number of BiCG iterations substantially, compared to the block diagonal preconditioner. The preconditioned iteration scheme also maintains the computational complexity of the MLFMA, and consequently reduces the total CPU time.

Original language | English |
---|---|

Pages (from-to) | 158-175 |

Number of pages | 18 |

Journal | Journal of Computational Physics |

Volume | 185 |

Issue number | 1 |

DOIs | |

State | Published - Feb 10 2003 |

## Keywords

- Electromagnetic scattering
- ILU preconditioning
- Krylov subspace methods
- Multilevel fast multiple algorithm

## ASJC Scopus subject areas

- Numerical Analysis
- Modeling and Simulation
- Physics and Astronomy (miscellaneous)
- General Physics and Astronomy
- Computer Science Applications
- Computational Mathematics
- Applied Mathematics