Total Least Squares With the Tensor Einstein Product: Algorithms and Regularization

This paper extends the classical matrix TLS framework to tensor formulations under the Einstein product, allowing multidimensional data to be handled when both the mapping operator and the observation tensor contain errors. For the single right‐hand‐side case, we extend the Rayleigh quotient iteration preconditioned conjugate gradient (RQI‐PCG) method to tensors, yielding an efficient solver, and incorporate Golub–Kahan bidiagonalization (GKB) and Tikhonov regularization (TR) for ill‐posed problems. Since GKB‐TLS and TR‐TLS are restricted to single right‐hand‐side problems, we further introduce a randomized SVD approach for general multi‐right‐hand‐side tensor TLS in the low‐rank setting, which includes the single right‐hand‐side case as a special case. All methods exploit the tensor operator structure and evaluate the Einstein product directly without forming the large unfolded matrix, leading to significant computational savings, especially for multi‐right‐hand‐side problems where joint processing is more efficient than solving each right‐hand side independently. Numerical experiments on synthetic ill‐posed problems and image processing demonstrate the effectiveness and efficiency of the proposed tensor solvers.

Authors

Institutions

Publication Details

Journal
Numerical Linear Algebra with Applications
Published
2026-11-19
DOI
https://doi.org/10.1002/nla.70129
Primary Topic
Tensor decomposition and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Total Least Squares With the Tensor Einstein Product: Algorithms and Regularization

Yimin Wei, Yimin Yang
Numerical Linear Algebra with Applications
Tensor decomposition and applications
article

Total Least Squares With the Tensor Einstein Product: Algorithms and Regularization

Yimin Wei, Yimin Yang
article en

Abstract

This paper extends the classical matrix TLS framework to tensor formulations under the Einstein product, allowing multidimensional data to be handled when both the mapping operator and the observation tensor contain errors. For the single right‐hand‐side case, we extend the Rayleigh quotient iteration preconditioned conjugate gradient (RQI‐PCG) method to tensors, yielding an efficient solver, and incorporate Golub–Kahan bidiagonalization (GKB) and Tikhonov regularization (TR) for ill‐posed problems. Since GKB‐TLS and TR‐TLS are restricted to single right‐hand‐side problems, we further introduce a randomized SVD approach for general multi‐right‐hand‐side tensor TLS in the low‐rank setting, which includes the single right‐hand‐side case as a special case. All methods exploit the tensor operator structure and evaluate the Einstein product directly without forming the large unfolded matrix, leading to significant computational savings, especially for multi‐right‐hand‐side problems where joint processing is more efficient than solving each right‐hand side independently. Numerical experiments on synthetic ill‐posed problems and image processing demonstrate the effectiveness and efficiency of the proposed tensor solvers.

Numerical Linear Algebra with ApplicationsVol. 33(6)
Fudan University (CN)
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