### Abstract

In the low-frequency fast multipole algorithm (LF-FMA) [19, 20], scalar addition theorem has been used to factorize the scalar Green's function. Instead of this traditional factorization of the scalar Green's function by using scalar addition theorem, we adopt the vector addition theorem for the factorization of the dyadic Green's function to realize memory savings. We are to validate this factorization and use it to develop a low-frequency vector fast multipole algorithm (LF-VFMA) for lowfrequency problems. In the calculation of non-near neighbor interactions, the storage of translators in the method is larger than that in the LF-FMA with scalar addition theorem. Fortunately it is independent of the number of unknowns. Meanwhile, the storage of radiation and receiving patterns is linearly dependent on the number of unknowns. Therefore it is worthwhile for large scale problems to reduce the storage of this part. In thismethod, the storage of radiation and receiving patterns can be reduced by 25 percent compared with the LF-FMA.

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

Pages (from-to) | 1183-1207 |

Number of pages | 25 |

Journal | Communications in Computational Physics |

Volume | 8 |

Issue number | 5 |

DOIs | |

State | Published - Nov 2010 |

### Keywords

- Electromagnetics
- LF-VFMA
- Loop-tree basis
- Low frequency
- Memory saving
- Surface integral equation
- Vector addition theorem

### ASJC Scopus subject areas

- Physics and Astronomy (miscellaneous)

## Fingerprint Dive into the research topics of 'A low frequency vector fast multipole algorithm with vector addition theorem'. Together they form a unique fingerprint.

## Cite this

*Communications in Computational Physics*,

*8*(5), 1183-1207. https://doi.org/10.4208/cicp.071209.240310a