Premium
Cost‐efficient numerical algorithm for solving the linear inverse problem of finding a variable magnetization
Author(s) -
Akimova Ele.,
Martyshko Petr S.,
Misilov Vladimir E.,
Miftakhov Valeriy O.
Publication year - 2019
Publication title -
mathematical methods in the applied sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.719
H-Index - 65
eISSN - 1099-1476
pISSN - 0170-4214
DOI - 10.1002/mma.6024
Subject(s) - toeplitz matrix , mathematics , discretization , parallelepiped , algorithm , algebraic equation , integral equation , matrix (chemical analysis) , mathematical analysis , nonlinear system , geometry , physics , materials science , quantum mechanics , pure mathematics , composite material
The paper is devoted to developing an original cost‐efficient algorithm for solving the inverse problem of finding a variable magnetization in a rectangular parallelepiped. The problem is ill‐posed and is described by the integral Fredholm equation. It is shown that after discretization of the area and approximation of the integral operator, this problem is reduced to solving a system of linear algebraic equations with the Toeplitz‐block‐Toeplitz matrix. We have constructed the memory efficient variant of the stabilized biconjugate gradient method BiCGSTABmem. This optimized algorithm exploits the special structure of the matrix to reduce the memory requirements and computing time. The efficient implementation is developed for multicore CPU and GPU. A series of the model problems with synthetic and real magnetic data are solved. Investigation of efficiency and speedup of parallel algorithm is performed.