Abstract
Multilevel algorithms have been used to generate fast algorithms for Fourier transforms and inversion of matrices in finite element method. These algorithms could invert an integral operator in less than O (N3) operations and expedite a matrix-vector multiply to require O(N log N) or O(N) operations. A multilevel algorithm for expediting matrix vector multiply in an iterative solution of boundary integral equation is described. This algorithm has O(N(log N)2) complexity, and for a large problem, O(N log N) complexity.
| Original language | English |
|---|---|
| Pages (from-to) | 431-434 |
| Number of pages | 4 |
| Journal | IEEE Antennas and Propagation Society, AP-S International Symposium (Digest) |
| Volume | 1 |
| State | Published - 1994 |
| Event | Proceedings of the IEEE Antennas and Propagation International Symposium. Part 3 (of 3) - Seattle, WA, USA Duration: Jun 19 1994 → Jun 24 1994 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering