1996
DOI: 10.1109/8.496263
|View full text |Cite
|
Sign up to set email alerts
|

Forward-backward: a new method for computing low-grazing angle scattering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
99
0
1

Year Published

1998
1998
2015
2015

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 208 publications
(100 citation statements)
references
References 5 publications
0
99
0
1
Order By: Relevance
“…(4) and (5). The detailed algorithm can referred to [1,2,4]. it converges extremely fast for moderately rough surfaces, e.g., less than six iterations.…”
Section: Efie and Mfiementioning
confidence: 99%
See 2 more Smart Citations
“…(4) and (5). The detailed algorithm can referred to [1,2,4]. it converges extremely fast for moderately rough surfaces, e.g., less than six iterations.…”
Section: Efie and Mfiementioning
confidence: 99%
“…If both two parts are only singlevalue function of abscissa x rather then multi-value function of x, for example, a conducting Six-Side Polygon Object (SSPO) (see Region 2 and 3 in Fig. 1), the aforementioned FBM(/SAA) [1][2][3][4][5][6][7][8][9][10][11][12] can't be simple used to solve the kind of composite rough surface problem, although the FBM (or equivalent MOMI) can be used to calculate scattering from closed contour of conducting object, for examples, 2-dimensional infinite elliptical cylinders ( [24] and [25]). So the FBM/SAA need be further developed by introduced new calculation technique to solve this kind of inhomogeneous composite rough surface problem.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently we have developed a highly efficient and robust numerical method for the analysis of scattering from randomly rough surfaces. In this method, a generalized minimal residual procedure which is right preconditioned (GMRES-RP) [14] with the forward-backward method (FBM) [15], in combination with the spectral acceleration (SA) [16,17] technique to expedite the computation of matrix-vector product. The applied preconditioning is found to transform the original linear system from near singular to stable with a good condition number; specifically, the spectrum of the preconditioned matrix is found condensed in the vicinity of the point 1 in the complex plane, an indicator of the good approximation quality of the preconditioner to the original matrix.…”
Section: Introductionmentioning
confidence: 99%
“…The third approach involves use of the forwardbackward method (FBM) [Holliday et al, 1996;Holliday et al, 1998] (also known as the method of ordered multiple interactions (MOMI) [Kapp and Brown, 1996;Toporkov et al, 1998]), which has been shown in many cases to provide a more rapid convergence than a standard conjugate gradient iterative algorithm. In this method, fields at each current element on the surface are divided in terms of two contributions: (1) forward propagating field contributions due to the incident field and the radiation of surface currents preceding the receiving element and (2) backward propagating field contributions (or corrections) due to surface currents following the receiving element.…”
mentioning
confidence: 99%