MétaCan
Menu
Back to cohort

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

2025· article· en· W4411950426 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicDifferential Equations and Numerical Methods
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsTensor (intrinsic definition)Integral equationVolume (thermodynamics)Volume integralComputer scienceApplied mathematicsMathematical analysisMathematicsPhysicsPure mathematicsThermodynamics

Abstract

fetched live from OpenAlex

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.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.661
Threshold uncertainty score0.769

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.253
GPT teacher head0.386
Teacher spread0.133 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it