Domain-decomposition approach to Krylov-subspace iteration
(2016) IEEE Antennas and Wireless Propagation Letters — Vol. 15, p. 1414-1417 (2016)
Files
Iupikov_Krylov.pdf
Open Access - Adobe PDF
- 2.21 MB
Details
- Authors
- Abstract
- Krylov subspace iterative techniques consist of finding the solution of a scattering problem as a linear combination of “generating vectors” obtained through successive matrix-vector multiplications. This paper extends this approach to domaindecomposition. Here, on each subdomain a subspace is obtained by constructing the segments of each generating vector associated with the subdomain, and by weighting these segments independently, which provides more degrees of freedom. The method is tested for scattering by a sphere and a rectangular plate, as well as radiation from connected arrays with strongly coupled antenna elements. It is shown that substantial computational savings can be obtained for the sphere and the array. This opens up new perspectives for faster solutions of multi-scaled problems.
- Affiliations
Citations
Iupikov, Craeye, C., & Maaskant, R. (2016). Domain-decomposition approach to Krylov-subspace iteration. IEEE Antennas and Wireless Propagation Letters, 15, 1414-1417. https://doi.org/10.1109/LAWP.2015.2511195 (Original work published 2016)