2006
DOI: 10.1002/mop.21758
|View full text |Cite
|
Sign up to set email alerts
|

The SSOR‐preconditioned inner outer flexible GMRES method for the FEM analysis of EM problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2007
2007
2012
2012

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 16 publications
(17 reference statements)
0
9
0
Order By: Relevance
“…To accelerate the convergence rate of iterative methods, preconditioning techniques are usually employed [17,21,22,[27][28][29][30][31][32][33]. One widely used preconditioner is the incomplete LU (ILU) decomposition of the coefficient matrix and its block variants [21,28].…”
Section: Gmresr Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…To accelerate the convergence rate of iterative methods, preconditioning techniques are usually employed [17,21,22,[27][28][29][30][31][32][33]. One widely used preconditioner is the incomplete LU (ILU) decomposition of the coefficient matrix and its block variants [21,28].…”
Section: Gmresr Algorithmmentioning
confidence: 99%
“…The multigrid preconditioned CG method was used to analyze the scattering of electromagnetic wave but the improvement is limited since the problem is of time-harmonic [32,33]. Like diagonal or block diagonal matrix preconditioner, the symmetric successive overrelaxation (SSOR) preconditioner can also directly be derived from the coefficient matrix without additional cost and can lead to convergence improvement for sparse linear systems [17,[29][30][31]. But FFT technique cannot be applied into Krylov subspace algorithms if SSOR preconditioner is used.…”
Section: Gmresr Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…This preconditioning strategy is combined with both the sparse approximate inverse (SAI) [9,10] and the symmetric successive over-relaxation (SSOR) [11,12] preconditioning techniques in two successive steps to obtain a better preconditioner for the original matrix equations. The newly constructed preconditioner combines the advantages of both the SAI and SSOR preconditioners with less computational complexity without the breakdowns of incomplete factorization technique.…”
Section: Introductionmentioning
confidence: 99%
“…It is desirable to be able to switch within the outer iteration instead of restarting. For the generalized minimum residual method (GMRES) algorithm, this can be easily accomplished with the help of a rather simple modification of the standard algorithm, referred to as the flexible GMRES (FGMRES) [18][19][20][21]. An important property of FGMRES is that it satisfies the residual norm minimization property over the preconditioned Krylov subspace just as in the standard GMRES algorithm.…”
Section: Introductionmentioning
confidence: 99%