Abstract
Multilevel fast multipole algorithm (MLFMA) has been widely used to solve electromagnetic scattering problems from the electrically large size objects. However, it consumes very large memory to store near the interaction matrix for the object with fine structures because the "low frequency breakdown" phenomenon would happen when the finest level box's size is below 0.2 wavelengths. The matrix decomposition algorithm - singular value decomposition (MDA-SVD) is one remedy to alleviate this pressure because it has no limit of the box's size. However, the matrix assembly time of MDA-SVD is much longer than that of the MLFMA. In this paper, a hybrid method called MDA-SVD-MLFMA is proposed to analyze multi-scale problems, which uses the main framework of MLFMA but adopts the MDA-SVD to deal with the near interaction of MLFMA. This method takes advantage of the virtues of both MLFMA and MDA-SVD and is more efficient than either conventional MLFMA or conventional MDA-SVD. An efficient preconditioning technique is combined into the inner-outer flexible generalized minimal residual (FGMRES) solver to speed up the convergence rate. Numerical results are presented to demonstrate the accuracy and efficiency of the proposed method. © 2010 ACES.
| Original language | English |
|---|---|
| Pages (from-to) | 914-925 |
| Journal | Applied Computational Electromagnetics Society Journal |
| Volume | 25 |
| Issue number | 11 |
| Publication status | Published - Nov 2010 |
| Externally published | Yes |
Research Keywords
- Flexible generalized minimal residual (FGMRES)
- Matrix decomposition algorithm - singular value decomposition (MDA-SVD)
- Multilevel fast multipole algorithm (MLFMA)
Fingerprint
Dive into the research topics of 'Preconditioned MDA-SVD-MLFMA for analysis of multi-scale problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver