Today : Sat, Oct 21 2017 .


Fast Multipole Methods (CTP)


  • Gu, Ming; Eisenstat, Stanley C. Efficient algorithms for computing a strong rank-revealing QR factorization. SIAM J. Sci. Comput. 17 (1996), no. 4, 848--869.
  • Cheng, H.; Gimbutas, Z.; Martinsson, P. G.; Rokhlin, V. On the compression of low rank matrices. SIAM J. Sci. Comput. 26 (2005), no. 4, 1389--1404 (*)
  • Per-Gunnar Martinsson, Vladimir Rokhlin, and Mark Tygert, "A randomized algorithm for the approximation of matrices," Technical Report 1361, Yale University, Department of Computer Science, June 2006.
  • Franco Woolfe, Edo Liberty, Vladimir Rokhlin, and Mark Tygert, "A fast randomized algorithm for the approximation of matrices," Technical Report 1386, Yale University, Department of Computer Science, July 2007.

This site has been visited 4203 times. Page: Main.T-lowrank - Last Modified : Tue, Oct 28 2008

NSF-National Science Foundation DOE-US Dept of Energy

Maintained by Jun Jia, Bo Zhang, and Jingfang Huang
Copyright 2008 FastMultipole.org