Domain Decomposition Methods
In domain decomposition methods (DDM) the idea is to didive a large and complex problem into smaller and simpler subproblems, called blocks. Closely located small objects are grouped together and considered as a single block, while large objects are decomposed into several blocks. This essentially isolates the solution of one region from another and avoids calculation of complex interactions of a large number of small objects, or objects having very different scales.
In order to make the DDM more robust and non-conforming, i.e., allowing that the meshes of the adjacent blocks do not need to necessarily match, the blocks are enclosed with virtual equivalent surfaces. The interactions between the blocks are described with equivalence principle (Huygens's principle) and defined by generalized scattering and translation operators of the blocks. This method is called equivalence principle algorithm.
- Scattering analysis of multiple targets.
- Simulation of large metamaterial structures and frequency selective surfaces.
References
- P. Ylä-Oijala, V. Lancellotti, B. P. de Hon and S. Järvenpää: Domain decomposition methods combining surface equivalence principle and macro basis functions, Applied Computational Electromagnetics Society (ACES) Journal, in press.
- P. Ylä-Oijala and M. Taskinen: Electromagnetic scattering by large and complex structures with surface equivalence principle algorithm, Waves in Random and Complex Media, 19(1), 105-125, 2009.
- P. Ylä-Oijala and M. Taskinen: Solving electromagnetic scattering by multiple targets with surface equivalence principle algorithm, The third European Conference on Antennas and Propagation, EuCAP 2009, March 23-27, Berlin, Germany, pp. 88-92.