Abstract: | Preconditioning techniques based on incomplete factorization of matrices are investigated, to solve highly indefinite complex‐symmetric linear systems. A novel preconditioning is introduced. The real part of the matrix is made positive definite, or less indefinite, by adding properly defined perturbations to the diagonal entries, while the imaginary part is unaltered. The resulting preconditioning matrix, which is obtained by applying standard methods to the perturbed complex matrix, turns out to perform significantly better than classical incomplete factorization schemes. For realistic values of the GMRES restart parameter, spectacular reduction of iteration counts is observed. A theoretical spectral analysis is provided, in which the spectrum of the preconditioner applied to indefinite matrix is related to the spectrum of the same preconditioner applied to a Stieltjes matrix extracted from the indefinite matrix. Results of numerical experiments are reported, which display the efficiency of the new preconditioning. Copyright © 2001 John Wiley & Sons, Ltd. |