2006
DOI: 10.1080/17455030600675830
|View full text |Cite
|
Sign up to set email alerts
|

A frequency-domain formulation of the Fréchet derivative to exploit the inherent parallelism of the distorted Born iterative method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2006
2006
2018
2018

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 15 publications
(11 citation statements)
references
References 30 publications
0
8
0
Order By: Relevance
“…The resulting reduction in computation time makes the method better-suited for a multi-frequency approach. This approach is discussed more thoroughly in [6].…”
Section: Formulationmentioning
confidence: 99%
“…The resulting reduction in computation time makes the method better-suited for a multi-frequency approach. This approach is discussed more thoroughly in [6].…”
Section: Formulationmentioning
confidence: 99%
“…In analogy with the frequency hopping employed to solve multiple-frequency imaging problems, 8,9,15,20,30,38,39 the round-robin technique attempts to avoid local minima associated with the solution of a single, restricted inverse problem ͑e.g., involving a single imaging frequency and a limited set of transmit angles͒ by using a previously obtained solution as a starting guess for a subsequent inversion. If local minima associated with distinct transmit angles do not coincide, a solution stagnating in a local minimum for one transmit angle may move away from the local minimum and toward the global minimum when the transmit angle is shifted.…”
Section: F a Kaczmarz-like Methodsmentioning
confidence: 99%
“…͑13͒. As detailed for two-dimensional problems, 30 the distorted Born iterative method distributed in this fashion scales almost ideally up to T processors when there are T unique transmit angles in an inverse scattering experiment. However, the algorithm does not scale above T processors.…”
Section: B Application Of the Multilevel Fast Multipole Algorithmmentioning
confidence: 99%
See 2 more Smart Citations