Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

A Time-Segmented SAI-Krylov Subspace Approach for Large-Scale Transient Electromagnetic Forward Modeling

View through CrossRef
After nearly two decades of development, transient electromagnetic (TEM) 3D forward modeling technology has significantly improved both numerical precision and computational efficiency, primarily through advancements in mesh generation and the optimization of linear equation solvers. However, the dominant approach still relies on direct solvers, which require substantial memory and complicate the modeling of electromagnetic responses in large-scale models. This paper proposes a new method for solving large-scale TEM responses, building on previous studies. The TEM response is expressed as a matrix exponential function with an analytic initial field for a step-off source, which can be efficiently solved using the Shift-and-Invert Krylov (SAI-Krylov) subspace method. The Arnoldi algorithm is used to construct the orthogonal basis for the Krylov subspace, and the preconditioned conjugate gradient (PCG) method is applied to solve large-scale linear equations. The paper further explores how dividing the off-time and optimizing parameters for each time interval can enhance computational efficiency. The numerical results show that this parameter optimization strategy reduces the iteration count of the PCG method, improving efficiency by a factor of 5 compared to conventional iterative methods. Additionally, the proposed method outperforms direct solvers for large-scale model calculations. Conventional approaches require numerous matrix factorizations and thousands of back-substitutions, whereas the proposed method only solves about 300 linear equations. The accuracy of the approach is validated using 1D and 3D models, and the propagation characteristics of the TEM field are studied in large-scale models.
Title: A Time-Segmented SAI-Krylov Subspace Approach for Large-Scale Transient Electromagnetic Forward Modeling
Description:
After nearly two decades of development, transient electromagnetic (TEM) 3D forward modeling technology has significantly improved both numerical precision and computational efficiency, primarily through advancements in mesh generation and the optimization of linear equation solvers.
However, the dominant approach still relies on direct solvers, which require substantial memory and complicate the modeling of electromagnetic responses in large-scale models.
This paper proposes a new method for solving large-scale TEM responses, building on previous studies.
The TEM response is expressed as a matrix exponential function with an analytic initial field for a step-off source, which can be efficiently solved using the Shift-and-Invert Krylov (SAI-Krylov) subspace method.
The Arnoldi algorithm is used to construct the orthogonal basis for the Krylov subspace, and the preconditioned conjugate gradient (PCG) method is applied to solve large-scale linear equations.
The paper further explores how dividing the off-time and optimizing parameters for each time interval can enhance computational efficiency.
The numerical results show that this parameter optimization strategy reduces the iteration count of the PCG method, improving efficiency by a factor of 5 compared to conventional iterative methods.
Additionally, the proposed method outperforms direct solvers for large-scale model calculations.
Conventional approaches require numerous matrix factorizations and thousands of back-substitutions, whereas the proposed method only solves about 300 linear equations.
The accuracy of the approach is validated using 1D and 3D models, and the propagation characteristics of the TEM field are studied in large-scale models.

Related Results

Krylov Subspace Solvers and Preconditioners
Krylov Subspace Solvers and Preconditioners
In these lecture notes an introduction to Krylov subspace solvers and preconditioners is presented. After a discretization of partial differential equations large, sparse systems o...
On Subspace-recurrent Operators
On Subspace-recurrent Operators
In this article, subspace-recurrent operators are presented and it is showed that the set of subspace-transitive operators is a strict subset of the set of subspace-recurrent opera...
Tensorized block rational Krylov methods for tensor Sylvester equations
Tensorized block rational Krylov methods for tensor Sylvester equations
Abstract We introduce the definition of tensorized block rational Krylov subspace and its relation with multivariate rational functions, extending the formulation...
I. A. Krylov in the Mirror of Russian-Persian Intercultural Dialogue
I. A. Krylov in the Mirror of Russian-Persian Intercultural Dialogue
In the development of Iranian literary criticism, translations of the works of the great Russian fabulist I. A. Krylov contribute to the interpenetration and mutual enrichment of t...
Optimization algorithm for omic data subspace clustering
Optimization algorithm for omic data subspace clustering
Subspace clustering identifies multiple feature subspaces embedded in a dataset together with the underlying sample clusters. When applied to omic data, subspace clustering is a ch...
C${\cal C}$osmological K${\cal K}$rylov C${\cal C}$omplexity
C${\cal C}$osmological K${\cal K}$rylov C${\cal C}$omplexity
AbstractIn this paper, we study the Krylov complexity (K) from the planar/inflationary patch of the de Sitter space using the two mode squeezed state formalism in the presence of a...
Méthodes itératives pour la résolution d'équations matricielles
Méthodes itératives pour la résolution d'équations matricielles
Nous nous intéressons dans cette thèse, à l’étude des méthodes itératives pour la résolutiond’équations matricielles de grande taille : Lyapunov, Sylvester, Riccati et Riccatinon s...
Subspace Complexity Reduction in Direction-of-Arrival Estimation via the RASA Algorithm
Subspace Complexity Reduction in Direction-of-Arrival Estimation via the RASA Algorithm
The complexity and scale of contemporary datasets are increasing, making the need for reliable and effective subspace processing more pressing. In array signal processing, the qual...

Back to Top