1994
DOI: 10.1109/8.299597
|View full text |Cite
|
Sign up to set email alerts
|

Iterative solution of a 3-D scattering problem from arbitrary shaped multidielectric and multiconducting bodies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
22
0
1

Year Published

1997
1997
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 28 publications
(23 citation statements)
references
References 14 publications
0
22
0
1
Order By: Relevance
“…Other authors [1], [2], [4], [8] comment that the number of iterations required for convergence is not greatly altered by a "good" initial guess. Soudias [5] uses the solution from one monostatic angle as the initial guess for the next angle and reports a factor of a two to four reduction in solution time for many monostatic angles.…”
Section: Acceleration Via a Better Initial Guessmentioning
confidence: 99%
See 2 more Smart Citations
“…Other authors [1], [2], [4], [8] comment that the number of iterations required for convergence is not greatly altered by a "good" initial guess. Soudias [5] uses the solution from one monostatic angle as the initial guess for the next angle and reports a factor of a two to four reduction in solution time for many monostatic angles.…”
Section: Acceleration Via a Better Initial Guessmentioning
confidence: 99%
“…The iterative method is attempting to find a solution to (5) where is the exact solution to the discretized problem; that is, the solution which a direct approach (in the absence of rounding errors) would obtain.…”
Section: Termination Criteriamentioning
confidence: 99%
See 1 more Smart Citation
“…Most of these advanced preconditioners, however, rely on basic iterative methods, such as the Generalized Minimal RESidual method [7] (GMRES) or the Preconditioned Conjugate Gradient [8] (PCG). Still, numerous new or modified iterative methods have been developed to: pipeline reductions [9], [10], avoid synchronizations [11], [12], decrease the number of iterations by means of multiple search directions [13], [14] or Krylov subspace recycling [15], [16]. Iterative methods tailored to tackle efficiently problems with multiple right-hand sides have also blossomed [17]- [19].…”
Section: Introductionmentioning
confidence: 99%
“…The new set of linear systems (19) is then solved using a block variant of the flexible inner-outer scheme described above. The outer block solver is a block-GCR [26] and the inner solver a block-GMRES [19]. Most of the linear algebra kernels involved in the algorithms of this section (sum of vectors, dot products calculation) are straightforward to implement in a parallel distributed memory environment.…”
mentioning
confidence: 99%