A fast evanescent wave algorithm

Many fast algorithms have been introduced in the past to accelerate the solution of integral equations in both the frequency and the time domain. These algorithms perform it matrix-vector product resulting from an integral equation in O(NlogN) or more operations. They are error controllable. but they require the use of a buffer box to control the error. We discuss a fast evanescent wave algorithm that avoids the use of the buffer boxes. Not having to have buffer boxes will speed up the algorithm. However, it will increase the memory usage of the algorithm. Hence, it is a way to trade off between speed and memory efficiency of the algorithm.