Show simple item record

The Fast Multipole Method for 2D Coulombic Problems: Analysis, Implementation and Visualization

dc.contributor.advisorDuraiswami, Ramanien_US
dc.contributor.authorWang, Yangen_US
dc.date.accessioned2006-02-04T06:42:52Z
dc.date.available2006-02-04T06:42:52Z
dc.date.issued2005-10-10en_US
dc.identifier.urihttp://hdl.handle.net/1903/3074
dc.description.abstractThe author reviews the Fast Multipole Method (FMM) for solving the Coulom- bic potential problem. An implementation of the FMM algorithm based on the Java programming language is presented, and the process of solving the Coulombic prob- lem using the FMM is illustrated in a Java applet. It is hoped that the applet can be of pedagogical value for students new to the FMM algorithm, that the Java code can be easily extended to solve matrix-vector multiplications of other types, and that the code developed in this project can serve as a basis for a full set of Application Programming Interfaces (API) to promote and aide the integration of the FMM algorithm into larger Java-based scienti¯c computing packages. A live demonstration of the applet, the source code of the current developer's build of the Java-FMM package, and other related material including API documentation can be found online at http://www.umiacs.umd.edu/~wpwy/fmm.en_US
dc.format.extent1795411 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.titleThe Fast Multipole Method for 2D Coulombic Problems: Analysis, Implementation and Visualizationen_US
dc.typeThesisen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.contributor.departmentApplied Mathematics and Scientific Computationen_US
dc.subject.pqcontrolledMathematicsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record