CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Domain-Decomposition Approach to Krylov Subspace Iteration

Oleg Iupikov (Institutionen för signaler och system, Antennsystem) ; C. Craeye ; Rob Maaskant (Institutionen för signaler och system, Antennsystem) ; Marianna Ivashina (Institutionen för signaler och system, Antennsystem)
Ieee Antennas and Wireless Propagation Letters (1536-1225). Vol. 15 (2016), p. 1414-1417.
[Artikel, refereegranskad vetenskaplig]

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 letter extends this approach to domain-decomposition. 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 multiscaled problems.

Nyckelord: Characteristic Basis Functions Method (CBFM), connected arrays, domain-decomposition, Generalized Minimal Residual Method (GMRES), Krylov subspace iteration, linear-systems, antennas, Engineering, Telecommunications



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2016-05-27. Senast ändrad 2017-03-21.
CPL Pubid: 237027

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)