@conference {13940,
	title = {Scalable fast multipole methods on distributed heterogeneous architectures},
	booktitle = {High Performance Computing, Networking, Storage and Analysis (SC), 2011 International Conference for},
	year = {2011},
	month = {2011/11//},
	pages = {1 - 12},
	abstract = {We fundamentally reconsider implementation of the Fast Multipole Method (FMM) on a computing node with a heterogeneous CPU-GPU architecture with multicore CPU(s) and one or more GPU accelerators, as well as on an interconnected cluster of such nodes. The FMM is a divide- and-conquer algorithm that performs a fast N-body sum using a spatial decomposition and is often used in a time- stepping or iterative loop. Using the observation that the local summation and the analysis-based translation parts of the FMM are independent, we map these respectively to the GPUs and CPUs. Careful analysis of the FMM is performed to distribute work optimally between the multicore CPUs and the GPU accelerators. We first develop a single node version where the CPU part is parallelized using OpenMP and the GPU version via CUDA. New parallel algorithms for creating FMM data structures are presented together with load balancing strategies for the single node and distributed multiple-node versions. Our implementation can perform the N-body sum for 128M particles on 16 nodes in 4.23 seconds, a performance not achieved by others in the literature on such clusters.},
	keywords = {accelerators;OpenMP;analysis, algorithm;iterative, and, architecture;CUDA;FMM, architectures;, architectures;divide-and-conquer, based, conquer, CPU-GPU, CPU;scalable, data, fast, heterogeneous, loop;data, loop;multicore, methods;graphics, methods;multiprocessing, methods;time, multipole, parts;distributed, PROCESSING, stepping, structures;divide, structures;GPU, systems;parallel, translation, units;iterative},
	author = {Hu,Qi and Gumerov, Nail A. and Duraiswami, Ramani}
}
@conference {13984,
	title = {Efficient Kriging via Fast Matrix-Vector Products},
	booktitle = {Aerospace Conference, 2008 IEEE},
	year = {2008},
	month = {2008/03//},
	pages = {1 - 7},
	abstract = {Interpolating scattered data points is a problem of wide ranging interest. Ordinary kriging is an optimal scattered data estimator, widely used in geosciences and remote sensing. A generalized version of this technique, called cokriging, can be used for image fusion of remotely sensed data. However, it is computationally very expensive for large data sets. We demonstrate the time efficiency and accuracy of approximating ordinary kriging through the use of fast matrix-vector products combined with iterative methods. We used methods based on the fast Multipole methods and nearest neighbor searching techniques for implementations of the fast matrix-vector products.},
	keywords = {cokriging, data, data;scattered, efficiency;geophysical, estimator;remotely, fusion;, fusion;interpolation;iterative, matrix-vector, methods;image, methods;nearest, methods;remote, multipole, neighbor, points;time, products;fast, scattered, searching;optimal, sensed, sensing;sensor, technique;fast, techniques;iterative},
	doi = {10.1109/AERO.2008.4526433},
	author = {Memarsadeghi,N. and Raykar,V.C. and Duraiswami, Ramani and Mount, Dave}
}
@article {13993,
	title = {Numerical Analysis of Plasmon Resonances in Nanoparticles Based on Fast Multipole Method},
	journal = {Magnetics, IEEE Transactions on},
	volume = {43},
	year = {2007},
	month = {2007/04//},
	pages = {1465 - 1468},
	abstract = {A novel technique for the numerical analysis of plasmon resonances by using the fast multipole method (FMM) is presented. This approach is based on the solution of the eigenvalue problem for boundary integral equations, which can be naturally implemented by using the FMM. Numerical examples that highlight the efficiency of the fast multipole implementation are reported},
	keywords = {analysis;boundary, and, boundary, eigenfunctions;nanoparticles;plasmons;, equations;eigenvalue, equations;eigenvalues, integral, method;nanoparticle, multipole, plasmon, problems;fast, resonance;numerical},
	isbn = {0018-9464},
	doi = {10.1109/TMAG.2007.891413},
	author = {Zhang,Zhenyu and Mayergoyz, Issak D and Gumerov, Nail A. and Duraiswami, Ramani}
}
@conference {14010,
	title = {Numerical Analysis of Plasmon Resonances Based on Fast Multipole Method},
	booktitle = {Electromagnetic Field Computation, 2006 12th Biennial IEEE Conference on},
	year = {2006},
	month = {2006///},
	pages = {459 - 459},
	abstract = {A novel technique for the numerical analysis of plasmon resonances by using fast multipole method (FMM) is presented. This approach is based on the solution of eigenvalue problem for boundary integral equations, which can be naturally implemented by using the fast multipole method. Numerical examples that highlight the efficiency of the fast multipole implementation are reported},
	keywords = {analysis;plasmon, and, boundary, eigenfunctions;plasmons;, equations;eigenvalue, equations;eigenvalues, integral, method;numerical, multipole, problem;fast, resonances;boundary},
	doi = {10.1109/CEFC-06.2006.1633249},
	author = {Zhang,Zhenyu and Mayergoyz, Issak D and Gumerov, Nail A. and Duraiswami, Ramani}
}
@conference {14034,
	title = {Computation of Green{\textquoteright}s function for finite-size photonic crystals by boundary element method},
	booktitle = {Antennas and Propagation Society International Symposium, 2004. IEEE},
	volume = {4},
	year = {2004},
	month = {2004/06//},
	pages = {4320 - 4323 Vol.4 - 4320 - 4323 Vol.4},
	abstract = {We have derived a new integral equation method for computing the Green{\textquoteright}s function for 2D electromagnetic wave propagation in a finite size photonic crystal. The method is also used for deriving the multipole expansions for the case of circular cylinders. This derivation is different from the ones in the literature. Our numerical results show an excellent agreement of the two algorithms. In the future we would like to expand the method to the numerical solution of the three-dimensional electromagnetic problem.},
	keywords = {2D, boundary, boundary-elements, circular, crystals;, cylinders;, electromagnetic, element, equation, equations;, expansions;, finite-size, function, function;, Green, Green{\textquoteright}s, integral, method;, methods;, multipole, photonic, propagation;, wave},
	doi = {10.1109/APS.2004.1330307},
	author = {Seydou,F. and Ramahi,O. and Duraiswami, Ramani and Seppdnen,T.}
}
@conference {13209,
	title = {Multi-level fast multipole method for thin plate spline evaluation},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {3},
	year = {2004},
	month = {2004/10//},
	pages = {1683 - 1686 Vol. 3 - 1683 - 1686 Vol. 3},
	abstract = {Image registration is an important problem in image processing and computer vision. Much recent work in image registration is on matching non-rigid deformations. Thin plate splines are an effective image registration method when the deformation between two images can be modeled as the bending of a thin metal plate on point constraints such that the topology is preserved (non-rigid deformation). However, because evaluating the computed TPS model at all the image pixels is computationally expensive, we need to speed it up. We introduce the use of multi-level fast muitipole method (MLFMM) for this purpose. Our contribution lies in the presentation of a clear and concise MLFMM framework for TPS, which will be useful for future application developments. The achieved speedup using MLFMM is an improvement from O(N<sup>2</sup>) to O(N log N). We show that the fast evaluation outperforms the brute force method while maintaining acceptable error bound.},
	keywords = {(mathematics);, Computer, deformation;, evaluation;, fast, image, MATCHING, matching;, metal, method;, multilevel, multipole, nonrigid, pixel;, plate, plate;, processing;, registration;, resolution;, spline, splines, thin, vision;},
	doi = {10.1109/ICIP.2004.1421395},
	author = {Zandifar,A. and Lim,S. and Duraiswami, Ramani and Gumerov, Nail A. and Davis, Larry S.}
}
