We present a fast iterative solver for scattering problems in 2D,where a penetrable object with compact support is considered.By representing the scattered field as a volume potential in terms of the Green’s function...We present a fast iterative solver for scattering problems in 2D,where a penetrable object with compact support is considered.By representing the scattered field as a volume potential in terms of the Green’s function,we arrive at the Lippmann-Schwinger equation in integral form,which is then discretized using an appropriate quadrature technique.The discretized linear system is then solved using an iterative solver accelerated by Directional Algebraic Fast Multipole Method(DAFMM).The DAFMM presented here relies on the directional admissibility condition of the 2D Helmholtz kernel[1],and the construction of low-rank factorizations of the appropriate low-rank matrix sub-blocks is based on our new Nested Cross Approximation(NCA)[2].The advantage of the NCA described in[2]is that the search space of so-called far-field pivots is smaller than that of the existing NCAs[3,4].Another significant contribution of this work is the use of HODLR based direct solver[5]as a preconditioner to further accelerate the iterative solver.In one of our numerical experiments,the iterative solver does not converge without a preconditioner.We show that the HODLR preconditioner is capable of solving problems that the iterative solver can not.Another noteworthy contribution of this article is that we perform a comparative study of the HODLR based fast direct solver,DAFMMbased fast iterative solver,and HODLR preconditioned DAFMM based fast iterative solver for the discretized Lippmann-Schwinger problem.To the best of our knowledge,this work is one of the first to provide a systematic study and comparison of these different solvers for various problem sizes and contrast functions.In the spirit of reproducible computational science,the implementation of the algorithms developed in this article is made available at https://github.com/vaishna77/Lippmann_Schwinger_Solver.展开更多
基金the support of Women Leading IITM(India)2022 in Mathematics(SB22230053MAIITM008880)the support of Young Scientist Research Award from Board of Research in Nuclear Sciences,Department of Atomic Energy,India(No.34/20/03/2017-BRNS/34278)MATRICS grant from Science and Engineering Research Board,India(Sanction number:MTR/2019/001241).
文摘We present a fast iterative solver for scattering problems in 2D,where a penetrable object with compact support is considered.By representing the scattered field as a volume potential in terms of the Green’s function,we arrive at the Lippmann-Schwinger equation in integral form,which is then discretized using an appropriate quadrature technique.The discretized linear system is then solved using an iterative solver accelerated by Directional Algebraic Fast Multipole Method(DAFMM).The DAFMM presented here relies on the directional admissibility condition of the 2D Helmholtz kernel[1],and the construction of low-rank factorizations of the appropriate low-rank matrix sub-blocks is based on our new Nested Cross Approximation(NCA)[2].The advantage of the NCA described in[2]is that the search space of so-called far-field pivots is smaller than that of the existing NCAs[3,4].Another significant contribution of this work is the use of HODLR based direct solver[5]as a preconditioner to further accelerate the iterative solver.In one of our numerical experiments,the iterative solver does not converge without a preconditioner.We show that the HODLR preconditioner is capable of solving problems that the iterative solver can not.Another noteworthy contribution of this article is that we perform a comparative study of the HODLR based fast direct solver,DAFMMbased fast iterative solver,and HODLR preconditioned DAFMM based fast iterative solver for the discretized Lippmann-Schwinger problem.To the best of our knowledge,this work is one of the first to provide a systematic study and comparison of these different solvers for various problem sizes and contrast functions.In the spirit of reproducible computational science,the implementation of the algorithms developed in this article is made available at https://github.com/vaishna77/Lippmann_Schwinger_Solver.
