Abstract
In the solution of an integral equation using the conjugate gradient (CG) method, the most expensive part is the matrix‐vector multiplication, requiring O(N2) floating‐point operations. The fast multipole method (FMM) reduced the operation to O(N15). In this article we apply a multilevel algorithm to this problem and show that the complexity of a matrix‐vector multiplication is proportional to N (log(N))2. © 1994 John Wiley & Sons, Inc.
Original language | English |
---|---|
Pages (from-to) | 466-470 |
Number of pages | 5 |
Journal | Microwave and Optical Technology Letters |
Volume | 7 |
Issue number | 10 |
DOIs | |
State | Published - Jul 1994 |
Keywords
- Fast multipole algorithm
- boundary integral equation
- multilevel algorithm
- numerical methods
- wave scattering
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Atomic and Molecular Physics, and Optics
- Condensed Matter Physics
- Electrical and Electronic Engineering