Tensor‐Train Compression of a Volume Integral Eddy Current Problem in Discontinuous Galerkin

ABSTRACT The paper presents a low‐rank tensor compression strategy based on the tensor‐train (TT) format for the integral operator arising in eddy current problems. Unlike classical matrix compression techniques such as the fast multipole method (FMM) or hierarchical matrices (‐matrices), which typically compress only far‐field interactions, the proposed approach compresses the entire operator, leading to significantly reduced memory requirements. The method relies on a tensorization step that transforms the discretized integral operator into a higher‐order tensor represented in TT format. A major challenge of tensor‐based compression for integral operators is the limited flexibility of tensorization, as it imposes strong constraints on the number of degrees of freedom. These constraints are particularly restrictive for conforming discretizations, where degrees of freedom are associated with mesh facets, as commonly encountered in eddy current formulations. To overcome this limitation, a discontinuous Galerkin discretization is employed, allowing the degrees of freedom to be defined at the cell level and enabling tensorization on more general meshes. The TT representation further allows the definition of an efficient matrix–vector product, which can be combined with an iterative solver to compute the solution of the resulting linear system. Numerical results for a thin plate, a torus with square cross‐section, and the COMPUMAG Team 7 benchmark demonstrate a significant reduction in memory consumption compared to an FMM‐based conforming discretization. While the solver performance is slightly lower, more advanced TT algebraic tools offer promising perspectives for further improvements.

Authors

Institutions

Publication Details

Journal
International Journal for Numerical Methods in Engineering
Published
2026-10-30
DOI
https://doi.org/10.1002/nme.70456
Primary Topic
Tensor decomposition and applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Tensor‐Train Compression of a Volume Integral Eddy Current Problem in Discontinuous Galerkin

Gérard Meunier, Jean-René Poirier, Anthony Torosyan, Olivier Chadebec et al.
3 links
International Journal for Numerical Methods in Engineering
Tensor decomposition and applications
article

Tensor‐Train Compression of a Volume Integral Eddy Current Problem in Discontinuous Galerkin

Gérard Meunier, Jean-René Poirier, Anthony Torosyan, Olivier Chadebec, Jean‐Michel Guichon, Bertrand Bannwarth
article en

Abstract

ABSTRACT The paper presents a low‐rank tensor compression strategy based on the tensor‐train (TT) format for the integral operator arising in eddy current problems. Unlike classical matrix compression techniques such as the fast multipole method (FMM) or hierarchical matrices (‐matrices), which typically compress only far‐field interactions, the proposed approach compresses the entire operator, leading to significantly reduced memory requirements. The method relies on a tensorization step that transforms the discretized integral operator into a higher‐order tensor represented in TT format. A major challenge of tensor‐based compression for integral operators is the limited flexibility of tensorization, as it imposes strong constraints on the number of degrees of freedom. These constraints are particularly restrictive for conforming discretizations, where degrees of freedom are associated with mesh facets, as commonly encountered in eddy current formulations. To overcome this limitation, a discontinuous Galerkin discretization is employed, allowing the degrees of freedom to be defined at the cell level and enabling tensorization on more general meshes. The TT representation further allows the definition of an efficient matrix–vector product, which can be combined with an iterative solver to compute the solution of the resulting linear system. Numerical results for a thin plate, a torus with square cross‐section, and the COMPUMAG Team 7 benchmark demonstrate a significant reduction in memory consumption compared to an FMM‐based conforming discretization. While the solver performance is slightly lower, more advanced TT algebraic tools offer promising perspectives for further improvements.

International Journal for Numerical Methods in EngineeringVol. 127(21)
Institut polytechnique de Grenoble (FR), Centre National de la Recherche Scientifique (FR), Université Toulouse III - Paul Sabatier (FR), Institut National Polytechnique de Toulouse (FR), Laboratoire Plasma et Conversion d'Energie (FR), Laboratoire de Génie Électrique de Grenoble (FR), Université de Toulouse (FR), Université Grenoble Alpes (FR)
Agence Nationale de la Recherche
Openalex Percentile: Top 74%
Tensor decomposition and applications
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.

Laika access coming soon