Abstract
We report on experiments with a novel family of Krylov subspace methods for solving dense, complex, non-Hermitian systems of linear equations arising from the Galerkin discretization of surface integral equation models in Electromagnetics. By some experiments on realistic radar-cross-section calculation, we illustrate the numerical efficiency of the proposed class of algorithms also against other popular iterative techniques in use today.
| Original language | English |
|---|---|
| Pages (from-to) | 102-111 |
| Number of pages | 10 |
| Journal | Applied Computational Electromagnetics Society Journal |
| Volume | 27 |
| Issue number | 2 |
| Publication status | Published - Feb 2012 |
Keywords
- Krylov subspace methods
- Lanczos biconjugate A-orthonormalization methods
- Multilevel fast multipole method
- Scattering problems
- Sparse approximate inverse preconditioning