2000
DOI: 10.1002/(sici)1098-2760(20000705)26:1<43::aid-mop14>3.0.co;2-8
|Get access via publisher |Summarize |Cite
|
Sign up to set email alerts

Three-dimensional multilevel fast multipole algorithm from static to electrodynamic

Abstract: A normalized three‐dimensional (3‐D) multilevel fast multipole algorithm (MLFMA) with a computational complexity of O(N) for very low‐frequency (LF) problems is developed. This 3‐D LF‐MLFMA can be used not only independently for very low‐frequency cases or very small structures compared to the wavelength, but also to solve large‐scale structures with rapidly varying areas when merged with a general dynamic algorithm. From the LF–MLFMA, a more explicit and succinct representation of the static MLFMA is also der… Show more

Search citation statements

Order By: Relevance

Paper Sections

Select...
78
4
0
0

Citation Types

0
10
0
0

Year Published

2000
2000
2025
2025

Publication Types

Select...
54
25
2

Relationship

6
75

Authors

Journals

citations

Cited by 81 publications

(10 citation statements)
references

References 12 publications

0
10
0
0
Order By: Relevance
How this paper cites the one you are viewing
“…Hence, the classical MLFMA is inefficient or numerically unstable when applied to sub-wavelength problems, where the domain is discretized at a rate higher than to capture the geometric details. These limitations have been reported in detail in [36] and several alternatives have been proposed to overcome them [5], [8]- [10]. In this work we employ the accelerated Cartesian expansion (ACE) [11].…”
Section: A the Fast Multipole Methods For The Helmholtz Potential
mentioning
confidence: 99%
How this paper cites the one you are viewing
“…Hence, the classical MLFMA is inefficient or numerically unstable when applied to sub-wavelength problems, where the domain is discretized at a rate higher than to capture the geometric details. These limitations have been reported in detail in [36] and several alternatives have been proposed to overcome them [5], [8]- [10]. In this work we employ the accelerated Cartesian expansion (ACE) [11].…”
Section: A the Fast Multipole Methods For The Helmholtz Potential
mentioning
confidence: 99%
How this paper cites the one you are viewing
“…
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.
…”
mentioning
confidence: 99%
“…In addition, we know that the floating-point operations for applying the basis rearrangement also scale as O(N R ) [19,21]. Therefore, the computational complexity of the LF-VFMA is clearly O(N R ), which is the same as that of the LF-FMA.…”
Section: Numerical Examples
mentioning
confidence: 99%
How this paper cites the one you are viewing
“…0), numerical instabilities may occur at very low frequency. This procedure is described in [13,14]. See [15] for an application of LF-MLFMA to low-frequency problems.…”
Section: Multipole Expansion
mentioning
confidence: 99%