Loading…
Application of Mosaic-Skeleton Approximations of Matrices in the Physical Optics Method for Electromagnetic Scattering Problems
The paper considers a physical optics model based on the Kirchhoff–MacDonald approximation taking into account re-reflections for solving electromagnetic-wave scattering problems. This model uses an integral representation of the electromagnetic field via surface currents. The paper describes an ite...
Saved in:
Published in: | Computational mathematics and mathematical physics 2022-09, Vol.62 (9), p.1424-1437 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The paper considers a physical optics model based on the Kirchhoff–MacDonald approximation taking into account re-reflections for solving electromagnetic-wave scattering problems. This model uses an integral representation of the electromagnetic field via surface currents. The paper describes an iterative algorithm in which, at each iteration step, the surface currents on the surface partition cells is determined by multiplying the influence matrix by the currents found at the previous iteration. To increase the computational efficiency of the algorithm, the influence matrix is compressed using the method of mosaic-skeleton approximations. In this case, the specificity of the matrix being approximated is taken into account by determining its elements via the matrix of the discrete representation of the integral operator, which contains the matrix of “visibility” of the partition cells. The visibility matrix indicates whether the segment connecting the centers of two cells intersects the illuminated surface at its internal points. The method was tested on model problems, which showed the applicability of the proposed algorithm to solving the problems of scattering by non-convex bodies, as well as the computational efficiency of the algorithm. |
---|---|
ISSN: | 0965-5425 1555-6662 |
DOI: | 10.1134/S0965542522090032 |