The k‐space formulation of the scattering problem in the time domain: An improved single propagator formulation

The storage allocation requirement and solution speed of the k‐space formulation of the scattering problem in the time domain developed by this author [N. Bojarski, J. Acoust. Soc. Am. 72, 570–584 (1982)] were improved by a factor of 2 and 4, respectively, by the replacement of the earlier two temporal propagators by a single more accurate propagator and the utilization of the special case real to complex FFT algorithm. It is shown that for problems of the size of about one million spatially discretized cells this method is about five times slower than an ideal solution, and requires about five times as much in core storage allocation as an ideal solution. It is shown that for a modern array processor this solution is I/O bound. It is pointed out that this method is ideally suited for parallel array processor implementation, resulting in even greater speed.