## Abstract

This Letter, proposes an algebraic domain decomposition algorithm (ADDA) to solve large sparse linear systems derived from the vector finite-element method (FEM) for 3D electromagnetic field problems. The proposed method segments the problem into several smaller pieces, solves each subproblem by direct methods, and then reassembles the subproblem solutions together to get the global result. Block LU factorization and multifrontal method are applied to solve each subproblem for the generation of the reduced system, and iterative methods are applied to solve the reduced system. It is shown that if combined with ADDA, biconjugate gradient method (BCG) converges more rapidly than the conjugate gradient method (CG), and both of them are faster than the conventional CG method. The simulation results demonstrate that the proposed algorithm can efficiently solve large and sparse linear equations arising from the finite-element method for the electromagnetic problems involving complex media such as perfectly matched layers (PMLs), which often make the linear equation ill-conditioned.

Original language | English (US) |
---|---|

Pages (from-to) | 414-417 |

Number of pages | 4 |

Journal | Microwave and Optical Technology Letters |

Volume | 34 |

Issue number | 6 |

DOIs | |

State | Published - Sep 20 2002 |

## Keywords

- Algebraic domain decomposition
- BCG
- CG
- Vector finite-element method

## ASJC Scopus subject areas

- Electronic, Optical and Magnetic Materials
- Atomic and Molecular Physics, and Optics
- Condensed Matter Physics
- Electrical and Electronic Engineering