Sparse symmetric preconditioners for dense linear systems in electromagnetism

ePubs

The open archive for STFC research publications

Persistent URL	http://purl.org/net/epubs/work/29522
Record Status	Checked
Record Id	29522
Title	Sparse symmetric preconditioners for dense linear systems in electromagnetism
Contributors	I S Duff, B Carpentieri, L Giraud, M Magolu monga Made
Abstract	We consider symmetric preconditioning strategies for the iterative solution of dense complex symmetric non-Hermitian systems arising in computational electromagnetics. In particular we report on the numerical behaviour of the classical Incomplete Cholesky factorizationas well as some of its recent variants and consider also well known factorized approximate inverses. We illustrate the difficulties that those techniques encounter on the linear systems under consideration and give some clues to explain their disappointing behaviour. We propose two symmetric preconditioners based on Frobenius-norm minimization that use a prescribed sparsity pattern. The numerical and computational efficiency of the proposed preconditioners are illustrated on a set of model problems arising both from academic and from industrial applications.
Organisation	CCLRC
Keywords
Funding Information
Related Research Object(s):	33012
Licence Information:
Language	English (EN)

Type	Details	URI(s)	Local file(s)	Year
Report	RAL Technical Reports RAL-TR-2002-016. 2002.		raltr-2002016.pdf	2002