Acceleration methods for the iterative solution of electromagnetic scattering problems

Radio Science ◽  
1993 ◽  
Vol 28 (1) ◽  
pp. 1-12 ◽  
Author(s):  
W. D. Murphy ◽  
V. Rokhlin ◽  
M. S. Vassiliou
2014 ◽  
Vol 15 (5) ◽  
pp. 1431-1460 ◽  
Author(s):  
D. Levadoux ◽  
F. Millot ◽  
S. Pernet

AbstractThis paper concerns the electromagnetic scattering by arbitrary shaped three dimensional imperfectly conducting objects modeled with non-constant Leontovitch impedance boundary condition. It has two objectives. Firstly, the intrinsically well-conditioned integral equation (noted GCSIE) proposed in [30] is described focusing on its discretization. Secondly, we highlight the potential of this method by comparison with two other methods, the first being a two currents formulation in which the impedance condition is implicitly imposed and whose the convergence is quasi-optimal for Lipschitz polyhedron, the second being a CFIE-like formulation [14]. In particular, we prove that the new approach is less costly in term of CPU time and gives a more accurate solution than that obtained from the CFIE formulation. Finally, as expected, It is demonstrated that no preconditioner is needed for this formulation.


2015 ◽  
Vol 719-720 ◽  
pp. 881-885
Author(s):  
Jia Qi Chen ◽  
Yue Yuan Zhang

A novel efficient hybrid accelerated method is proposed for the fast analysis of the monostatic electromagnetic scattering problems arising from volume-surface integral equations (VSIE) formulation. In the first step, by utilizing the low rank property, several largest eigenvalues and corresponding eigenvectors of the multiple right hand sides can be computed and saved efficiently by adaptive cross approximation (ACA) algorithm. The iterative solution of linear equations is required at these principle eigenvectors. Compared with solving linear equations at each angle repeatedly, the proposed method is able to greatly reduce the number of equations. In the second step, a disturbed symmetric successive over-relaxation (D-SSOR) preconditioner is constructed to speed up the convergence rate of iterative methods. Numerical results demonstrate that the present method can reduce the computational time significantly for monostatic VSIE calculation with high accuracy.


Author(s):  
Bruno Carpentieri

<div>The Fast Multipole Method was introduced by Greengard and Rokhlin in a seminal paper appeared in 1987 for studying large systems of particle interactions with reduced algorithmic and memory complexity [60]. Developments of the original idea are successfully applied to the analysis of many scientific and engineering problems of practical interest. In scattering analysis, multipole techniques may enable to reduce the computational complexity of iterative solution procedures involving dense matrices arising from the discretization of integral operators from O(n2) to O(n log n) arithmetic operations. In this paper we discuss recent algorithmic developments of algebraic preconditioning techniques for the Fast Multipole Method for 2D and 3D scattering problems. We focus on design aspects, implementation details, numerical scalability, parallel performance on emerging computer systems, and give some minor emphasis to theoretical aspects as well. Thanks to the use of iterative techniques and efficient parallel preconditioners, fast integral solvers involving tens of million unknowns are nowadays feasible and can be integrated in the design processes. Keywords: algebraic preconditioners, Fast Multipole Method, Krylov solvers, electromagnetic scattering applications, Maxwell&#39;s equations.</div>


Sign in / Sign up

Export Citation Format

Share Document