2004
DOI: 10.1002/nme.1201
|View full text |Cite
|
Sign up to set email alerts
|

Using spectral low rank preconditioners for large electromagnetic calculations

Abstract: SUMMARYFor solving large dense complex linear systems that arise in electromagnetic calculations, we perform experiments using a general purpose spectral low rank update preconditioner in the context of the GMRES method preconditioned by an approximate inverse preconditioner. The goal of the spectral preconditioner is to improve the convergence properties by shifting by one the smallest eigenvalues of the original preconditioned system. Numerical experiments on parallel distributed memory computers are present… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2006
2006
2017
2017

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 18 publications
(18 citation statements)
references
References 17 publications
0
18
0
Order By: Relevance
“…Similar types of composite preconditioners have been discussed in [23,29,35,36,38,44,45]. Here we mention that the preconditioners based on alternative direction iterations [14,41,46] can also be classified as such kind of composite preconditioners.…”
Section: Fourier Analysis Of the Composite Preconditionermentioning
confidence: 92%
See 1 more Smart Citation
“…Similar types of composite preconditioners have been discussed in [23,29,35,36,38,44,45]. Here we mention that the preconditioners based on alternative direction iterations [14,41,46] can also be classified as such kind of composite preconditioners.…”
Section: Fourier Analysis Of the Composite Preconditionermentioning
confidence: 92%
“…However, these approaches may become ineffective when dealing with general sparse systems of linear equations. Another type of efficient preconditioning techniques are constructed by making use of spectrum information of the preconditioned matrix [23,29,38,44,45]. They are able to get rid of the influence of eigenvalues close to zero, which is generally difficult to handle by conventional incomplete factorization preconditioners.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, the development and practice of efficient preconditioning techniques in iteratively solving dense linear systems have become the subject of growing interest [9,[22][23][24][25][26][27][28][29][30][31][32][33][34][35][36][37]. For sparse matrices, polynomial preconditioners for Krylov subspace methods were popular for some applications in the early stage of preconditioning studies [38,39].…”
Section: Preconditioned Iterative Methodsmentioning
confidence: 99%
“…We should mention that there are other studies in the context of MLFMA that make use of both near-field and far-field information [19], [20]. In those studies, spectral information is explicitly computed via iterative eigensystem solvers and then this information is used to obtain a two-level preconditioner.…”
Section: B Preconditioners Using Far-field Interactionsmentioning
confidence: 99%