Fast Multipole Method for the Biharmonic Equation
| dc.contributor.author | Gumerov, Nail A. | |
| dc.contributor.author | Duraiswami, Ramani | |
| dc.date.accessioned | 2005-09-29T20:48:30Z | |
| dc.date.available | 2005-09-29T20:48:30Z | |
| dc.date.issued | 2005-09-29T20:48:30Z | |
| dc.description.abstract | The evaluation of sums (matrix-vector products) of the solutions of the three-dimensional biharmonic equation can be accelerated using the fast multipole method, while memory requirements can also be significantly reduced. We develop a complete translation theory for these equations. It is shown that translations of elementary solutions of the biharmonic equation can be achieved by considering the translation of a pair of elementary solutions of the Laplace equations. Compared to previous methods that required the translation of five Laplace elementary solutions for the biharmonic Green's function, and much larger numbers for higher order multipoles, our method is significantly more efficient. The theory is implemented and numerical tests presented that demonstrate the performance of the method for varying problem sizes and accuracy requirements. In our implementation the FMM\ is faster than direct solution for a matrix size of $550$ for an accuracy of $10^{-3},$ 950 for an accuracy of $10^{-6} and $N=3550$ for an accuracy of $10^{-9}$. | en |
| dc.format.extent | 456462 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/2813 | |
| dc.language.iso | en_US | en |
| dc.relation.ispartofseries | UM Computer Science Department | en |
| dc.relation.ispartofseries | CS-TR-4722 | en |
| dc.relation.ispartofseries | UMIACS | en |
| dc.relation.ispartofseries | UMIACS-TR-2005-29 | en |
| dc.title | Fast Multipole Method for the Biharmonic Equation | en |
| dc.type | Technical Report | en |