Efficient Deterministic Algorithms for Approximating Tensor–Tensor Multiplication
Numerical Linear Algebra with Applications · 2026-12 · 33 (6)
DOI: 10.1002/nla.70128 ↗Kurz gefasst
Fachartikel in der Zeitschrift Numerical Linear Algebra with Applications, online erschienen am 10.11.2026. Verfasst von Ling Tang und 1 weiteren Autor:innen. Die Arbeit nennt 42 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities.
Abstract (Originalsprache)
This article investigates the efficient computation of the tensor–tensor multiplication, that is, t‐product, in streaming settings with limited memory and computational resources. We propose two deterministic sketching algorithms, FD‐ATP and COOD‐ATP. For both methods, we rigorously establish spectral norm error bounds and prove that they achieve a ‐approximation up to a multiplicative factor with respect to the best low‐tubal‐rank approximation of the t‐product. Extensive numerical experiments demonstrate the effectiveness and efficiency of the proposed methods.
Förderung
- National Natural Science Foundation of China
- Fundamental Research Funds for the Central Universities
Zitieren
APA
Tang, L., & Li, H. (2026). Efficient Deterministic Algorithms for Approximating Tensor–Tensor Multiplication. Numerical Linear Algebra with Applications, 33(6). https://doi.org/10.1002/nla.70128
Vancouver
Tang L, Li H. Efficient Deterministic Algorithms for Approximating Tensor–Tensor Multiplication. Numerical Linear Algebra with Applications. 2026;33(6). doi:10.1002/nla.70128
BibTeX
@article{Tang2026,
author = {Tang, Ling and Li, Hanyu},
title = {Efficient Deterministic Algorithms for Approximating Tensor–Tensor Multiplication},
journal = {Numerical Linear Algebra with Applications},
year = {2026},
volume = {33},
number = {6},
doi = {10.1002/nla.70128}
}
EUVIMED