Tensor Train Accelerated Method of Moment Solution of Volume Integral Equations for Arbitrary Objects with Logarithmic Complexity
Bibliographic record
Abstract
This paper presents a computational framework for solution of the full-wave scattering problems and problems of the magneto-quasistatics for objects of arbitrary shapes with polylogarithmic O(log p N) complexity in both CPU time and memory, N being the number of basis and test functions in Method of Moments (MoM) discretization of the pertinent volume integral equations (VIEs). The dramatic reduction in the computational operations and storage is enabled through tensor train (TT) decomposition of the matrices and vectors involved in MoM discretization of the VIE, accompanied by the specialized linear algebra operations performed on these tensorized data sets. Such TT decompositions are performed after MoM matrices and vectors are represented as multidimensional datasets according to recursively subdivided basis functions defined on a regular grid of square boxes of a pixelized object of interest. While such multidimensional representations stemming from the hierarchical partitioning of the geometry as well as pertinent matrices and vectors in principle sufficient for construction of the TT decomposition, the ranks in the cores of the train can be shown to grow as O(N) for most geometries other than canonical cases of an ideal square or a smooth Gaussian object. In this work we show that containment of TT ranks both in compressed object representation and pertinent MoM matrices to polylog O(log p N) scaling can be established through global Gaussian smoothing of the step-function like transitions in the material contrast function throughout the pixelated domain confining the object of interest. Numerical examples conducted on TT-accelerated MoM solutions of the full-wave and quasi-magnetostatic VIEs show that the proposed approach enables overall complexity reduction to polylogarithmic scaling with N for arbitrarily shaped objects and material distributions ranging from simple shapes to complex fractal geometries paving a way for TT accelerated MoM to be used for practically relevant applications.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".