Abstract
A staggered grid scheme is proposed to reduce both the total memory requirement and the CPU time of generating the corrected near matrix in the FFTbased methods. Two sets of Cartesian grids are used to project the source points and the field points, respectively. The proposed method does not lower the efficiency of computing far matrix-vector products, compared with the traditional uniform Cartesian grid scheme. Some numerical experiments are provided to demonstrate both the correctness and the efficiency of the proposed method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.