ISSN:
1572-9265
Keywords:
dense linear systems
;
preconditioning
;
sparse approximate inverses
;
complex symmetric matrices
;
scattering calculations
;
Krylov subspace methods
;
parallel computing
;
65F10
;
65F50
;
65R20
;
65N38
;
78-08
;
78A50
;
78A55
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract We investigate the use of sparse approximate inverse preconditioners for the iterative solution of linear systems with dense complex coefficient matrices arising in industrial electromagnetic problems. An approximate inverse is computed via a Frobenius norm approach with a prescribed nonzero pattern. Some strategies for determining the nonzero pattern of an approximate inverse are described. The results of numerical experiments suggest that sparse approximate inverse preconditioning is a viable approach for the solution of large-scale dense linear systems on parallel computers.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1019170609950
Permalink
