A fast methodology for large-scale focusing inversion of gravity and magnetic data using the structured model matrix and the 2D fast Fourier transform

04/29/2020
by   Rosemary A. Renaut, et al.
0

Focusing inversion of potential field data for the recovery of sparse subsurface structures from surface measurement data on a uniform grid is discussed. For the uniform grid the model sensitivity matrices exhibit block Toeplitz Toeplitz block structure, by blocks for each depth layer of the subsurface. Then, through embedding in circulant matrices, all forward operations with the sensitivity matrix, or its transpose, are realized using the fast two dimensional Fourier transform. Simulations demonstrate that this fast inversion algorithm can be implemented on standard desktop computers with sufficient memory for storage of volumes up to size n ≈ 1M. The linear systems of equations arising in the focusing inversion algorithm are solved using either Golub Kahan bidiagonalization or randomized singular value decomposition algorithms in which all matrix operations with the sensitivity matrix are implemented using the fast Fourier transform. These two algorithms are contrasted for efficiency for large-scale problems with respect to the sizes of the projected subspaces adopted for the solutions of the linear systems. The presented results confirm earlier studies that the randomized algorithms are to be preferred for the inversion of gravity data, and that it is sufficient to use projected spaces of size approximately m/8, for data sets of size m. In contrast, the Golub Kahan bidiagonalization leads to more efficient implementations for the inversion of magnetic data sets, and it is again sufficient to use projected spaces of size approximately m/8. Moreover, it is sufficient to use projected spaces of size m/20 when m is large, m ≈ 50000, to reconstruct volumes with n ≈ 1M. Simulations support the presented conclusions and are verified on the inversion of a practical magnetic data set that is obtained over the Wuskwatim Lake region in Manitoba, Canada.

READ FULL TEXT

page 17

page 24

page 25

page 26

page 27

page 28

page 30

research
12/31/2021

Large-scale focusing joint inversion of gravity and magnetic data with Gramian constraint

A fast algorithm for the large-scale joint inversion of gravity and magn...
research
12/15/2019

A Tutorial and Open Source Software for the Efficient Evaluation of Gravity and Magnetic Kernels

Fast computation of three-dimensional gravity and magnetic forward model...
research
12/12/2019

Fast non-convex low-rank matrix decomposition for separation of potential field data using minimal memory

A fast non-convex low-rank matrix decomposition method for potential fie...
research
05/18/2023

Blockwise inversion and algorithms for inverting large partitioned matrices

Using the blockwise matrix inversion, inversions of large matrices with ...
research
03/10/2017

On matrices with displacement structure: generalized operators and faster algorithms

For matrices with displacement structure, basic operations like multipli...
research
01/10/2020

Generalized L_p-norm joint inversion of gravity and magnetic data using cross-gradient constraint

A generalized unifying approach for L_p-norm joint inversion of gravity ...
research
01/04/2023

Learning Decorrelated Representations Efficiently Using Fast Fourier Transform

Barlow Twins and VICReg are self-supervised representation learning mode...

Please sign up or login with your details

Forgot password? Click here to reset