dc.contributor |
Barcelona Supercomputing Center |
dc.contributor.author |
Puzyrev, Vladimir |
dc.contributor.author |
Cela, José M. |
dc.date |
2015-08 |
dc.identifier.citation |
Puzyrev, Vladimir; Cela, José M. A review of block Krylov subspace methods for multisource electromagnetic modelling. "Geophysical Journal International", Agost 2015, vol. 202, núm. 2, p. 1241-1252. |
dc.identifier.citation |
0956-540X |
dc.identifier.citation |
10.1093/gji/ggv216 |
dc.identifier.uri |
http://hdl.handle.net/2117/85150 |
dc.language.iso |
eng |
dc.publisher |
Wiley-Blackwell |
dc.relation |
http://gji.oxfordjournals.org/content/202/2/1241.abstract |
dc.relation |
info:eu-repo/grantAgreement/EC/H2020/644202/EU/Geophysical Exploration using Advanced GAlerkin Methods/GEAGAM |
dc.rights |
info:eu-repo/semantics/openAccess |
dc.subject |
Àrees temàtiques de la UPC::Física::Electromagnetisme |
dc.subject |
Electromagnetic measurements |
dc.subject |
Electromagnetic--methods |
dc.subject |
Numerical modeling |
dc.subject |
Marine electromagnetic |
dc.subject |
Iterative solutions |
dc.subject |
Block methods |
dc.subject |
Electromagnetisme--Mesuraments |
dc.title |
A review of block Krylov subspace methods for multisource electromagnetic modelling |
dc.type |
info:eu-repo/semantics/submittedVersion |
dc.type |
info:eu-repo/semantics/article |
dc.description.abstract |
Practical applications of controlled-source electromagnetic modeling require solutions for multiple sources at several frequencies, thus leading to a dramatic increase of the computational cost. In this paper we present an approach using block Krylov subspace solvers that are iterative methods especially designed for problems with multiple right hand-sides. Their main advantage is the shared subspace for approximate solutions, hence, these methods are expected to converge in less iterations than the corresponding standard solver applied to each linear system. Block solvers also share the same preconditioner, which is constructed only once. Simultaneously computed block
operations have better utilization of cache due to the less frequent access to the system matrix. In this paper we implement two different block solvers for sparse matrices resulting from the finitedifference and the finite-element discretizations, discuss the computational cost of the algorithms and study their dependence on the number of right-hand sides given at once. The effectiveness of the proposed methods is demonstrated on two electromagnetic survey scenarios, including a large marine model. As the results of the simulations show, when a powerful preconditioning is employed, block methods are faster than standard iterative techniques in terms of both iterations and time. |
dc.description.abstract |
Funding for this work was provided by the Repsol-BSC Research Center and the RISE
Horizon 2020 European Project GEAGAM (644602). MareNostrum Supercomputer was used for the numerical tests. The authors express their thanks to Rene-Edouard Plessix, Mikhail Zaslavsky and one anonymous reviewer for their valuable comments that significantly helped to improve the paper. |
dc.description.abstract |
Peer Reviewed |