Fast Poisson solvers for problems with sparsity

Fast Poisson solvers, which provide the numerical solution of Poisson’s equation on regions that permit the separation of variables, have proven very useful in many applications. In certain of these applications the data is sparse and the solution is only required at relatively few mesh points. For such problems this paper develops algorithms that allow considerable savings in computer storage as well as execution speed. Results of numerical experiments are given.