Tensor-Train Accelerated Solution of 3D Vector Volume Integral Equation Solutions with logN Complexity

This study investigates the application of tensor train decomposition to model the matrix, excitation, and solution vectors of the dense matrix equation derived from the Method of Moments (MoM) discretization of the full-wave 3D Volume Integral Equation. These components are represented as a product of O(log(N)) small matrices (tensors). This quantized tensor train (QTT) decomposition demonstrates O(log(N)) efficiency in both CPU time and memory usage. To solve the matrix equation based on the QTT-represented system of linear algebraic equations (SLAE) with matrices and vectors, we implement an iterative GMRES scheme, which enables rapid matrix-vector product evaluations with O(log(N)) CPU time and memory requirements. Currently, this O(log(N)) performance applies only to SLAEs with purely Toeplitz matrices, particularly in scattering problems involving homogeneous dielectric scatterers made of cubic voxels.

Authors

Institutions

Publication Details

Published
2025-05-18
DOI
https://doi.org/10.23919/aces66556.2025.11052583
Primary Topic
Differential Equations and Numerical Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Tensor-Train Accelerated Solution of 3D Vector Volume Integral Equation Solutions with logN Complexity

Vladimir Okhmatovski, Chris Nguyễn
Differential Equations and Numerical Methods
article

Tensor-Train Accelerated Solution of 3D Vector Volume Integral Equation Solutions with logN Complexity

Vladimir Okhmatovski, Chris Nguyễn
article en

Abstract

This study investigates the application of tensor train decomposition to model the matrix, excitation, and solution vectors of the dense matrix equation derived from the Method of Moments (MoM) discretization of the full-wave 3D Volume Integral Equation. These components are represented as a product of O(log(N)) small matrices (tensors). This quantized tensor train (QTT) decomposition demonstrates O(log(N)) efficiency in both CPU time and memory usage. To solve the matrix equation based on the QTT-represented system of linear algebraic equations (SLAE) with matrices and vectors, we implement an iterative GMRES scheme, which enables rapid matrix-vector product evaluations with O(log(N)) CPU time and memory requirements. Currently, this O(log(N)) performance applies only to SLAEs with purely Toeplitz matrices, particularly in scattering problems involving homogeneous dielectric scatterers made of cubic voxels.

University of Manitoba (CA)
Openalex Percentile: Top 76%
Differential Equations and Numerical Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Tensor-Train Accelerated Solution of 3D Vector Volume Integral Equation Solutions with logN Complexity — Vladimir Okhmatovski, Chris Nguyễn · (2025) | TGRS Research Map | TGRS