The Fast Multipole Method and the Radiosity Kernel

some of the research work in Computer Graphics and Vision at ViGIL IITB
(http://www.cse.iitb.ac.in/graphics/).

Later I will talk about our work in FMM: the fast multipole method is
a promising method for achieving fast solutions to many applied
problems in engineering, biology, computer vision, and statistics. It
has been called one of the ten most significant numerical algorithms
discovered in the 20th century. The algorithm enables the product of
restricted dense matrices with a vector to be evaluated in O(N logN)
operations, when direct multiplication requires O(N*N) operations.

Despite these advantages, the FMM has not been widely used in computer
graphics. I will explain what appears to be the first DIRECT
application of FMM to global illumination (GI).