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.