next up previous contents
Next: Fast multipole algorithm Up: Basic framework of FM-BIEM Previous: L2L translation

Fast multipole algorithm and estimation of its computational cost

In this section we describe the fast multipole algorithm in two dimensions for simplicity. The algorithm in three dimensions is obtained by replacing a quad-tree with an oct-tree.



 

Ken-ichi Yoshida
2001-07-28