SEG Technical Program Expanded Abstracts 2001 2001
DOI: 10.1190/1.1816392
|View full text |Cite
|
Sign up to set email alerts
|

3‐D magnetotelluric inversion for resource exploration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
23
0

Year Published

2005
2005
2021
2021

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 30 publications
(23 citation statements)
references
References 6 publications
0
23
0
Order By: Relevance
“…Alternatively, Newman and Alumbaugh (2000), Rodi and Mackie (2001) and Mackie et al (2001) proposed to solve the 3-D inverse problem using the nonlinear conjugate gradient method (NLCG) by Fletcher and Reeves (1964) and Polak and Ribiere (1969) that requires for computation only the gradient vectors g ¼ @u @m , rather than sensitivities J (see Appendix C for details). The idea of applying gradient vectors to solve nonlinear geophysical inverse problems was first suggested by Tarantola (1987) and is also related to the EM migration technique of Zhdanov (2002; and the references therein).…”
Section: How Is It Commonly Solved?mentioning
confidence: 99%
See 3 more Smart Citations
“…Alternatively, Newman and Alumbaugh (2000), Rodi and Mackie (2001) and Mackie et al (2001) proposed to solve the 3-D inverse problem using the nonlinear conjugate gradient method (NLCG) by Fletcher and Reeves (1964) and Polak and Ribiere (1969) that requires for computation only the gradient vectors g ¼ @u @m , rather than sensitivities J (see Appendix C for details). The idea of applying gradient vectors to solve nonlinear geophysical inverse problems was first suggested by Tarantola (1987) and is also related to the EM migration technique of Zhdanov (2002; and the references therein).…”
Section: How Is It Commonly Solved?mentioning
confidence: 99%
“…Such great acceleration is slightly counterbalanced by the fact that the NLCG approach requires the solution of the 1-D minimization problem (so-called line search) at each iteration. Rodi and Mackie (2001) proposed an algorithm for the line search, equivalent in computational time to only three solutions of the forward problem. In spite of such a dramatic increase in speed, the NLCG approach still has to be implemented either within a massively parallel computing architecture (Newman and Alumbaugh, 2000;Newman and Boggs, 2004) or with the help of message passing interface (MPI) running on PC-clusters (Mackie et al, 2001).…”
Section: How Is It Commonly Solved?mentioning
confidence: 99%
See 2 more Smart Citations
“…It is also planned to apply our inversion scheme to an experimental data set. However, previous examples from other 3-D MT inversion software developers (see [8,10,14,17]) indicate that successful verification of the inversion technique even on a single practical dataset is a complex task and may take some time.…”
Section: Resultsmentioning
confidence: 99%