Abstract

The method of moments (MoM) discretization of volume integral equation (VIE) results in dense $N \times N$ matrix, $N$ being the number of MoM basis functions. Naive solution of such a system of linear algebraic equations (SLAE) is expensive when problems become large scale. Recently, tensor decomposition has been introduced for solving the SLAE by folding its matrix and its vectors into high-dimensional tensors. In this paper, we present detailed explanations for tensor train (TT) decomposition of the SLAE matrices and vectors resulting from MoM discretization of VIE for scalar 2-D scattering problems under TM-polarization and magneto-quasi-static characterization of multiconductor transmission lines. For Toeplitz matrices resulted from MoM discretization on structured meshes, the extraordinary performance of TT with scaling of $\log (N)$ in CPU time and memory is shown to directly solve SLAE with millions of unknowns within a few minutes and few megabytes of memory. Such $\log (N)$ performance is limited, however, to the SLAE with purely Toeplitz matrices corresponding to the scattering problems on homogeneous dielectric scatterers of the rectangular cross section. To overcome this limitation and solve the problems with arbitrarily shaped inhomogeneous objects, we propose an iterative conjugate gradient-TT (CG-TT) scheme for solving MoM discretized VIE, which utilizes TT decomposition for the fast evaluation of the matrix-vector products. The CG-TT shows CPU and memory scaling in the low- and high-frequency regimes with $O(N)$ and $O(r^{2}~N \log N)$ , respectively, $r$ being the highest rank in the TT carriages. Detailed analysis of memory and CPU time scaling with respect to a number of unknowns and time-harmonic frequency is presented.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.