Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
