Randomized Kaczmarz methods for t-product tensor linear systems with factorized operators

Abstract Randomized iterative algorithms, such as the randomized Kaczmarz method, have gained considerable popularity due to their efficacy in solving matrix-vector and matrix-matrix regression problems. Our present work leverages the insights gained from studying such algorithms to develop regression methods for tensors, which are the natural setting for many application problems, e.g., image deblurring. In particular, we extend the randomized Kaczmarz method to solve a t-product tensor system where the measurement tensor is given in factorized form. We develop variants of the randomized factorized Kaczmarz method for matrices that approximately solve tensor systems in both the consistent and inconsistent regimes. We provide theoretical guarantees of the exponential convergence rate of our algorithms, accompanied by illustrative numerical simulations. Furthermore, we situate our method within a broader context by linking our novel approaches to earlier randomized Kaczmarz methods.

Authors

Institutions

Publication Details

Journal
BIT Numerical Mathematics
Published
2025-08-16
DOI
https://doi.org/10.1007/s10543-025-01078-5
Citations
1
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
1.50

Funders

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

Randomized Kaczmarz methods for t-product tensor linear systems with factorized operators

Lara Kassab, Deanna Needell, Paulina Hoyos, Karamatou Yacoubou Djima et al.
1 citations
BIT Numerical Mathematics
Matrix Theory and Algorithms
1.50
article

Randomized Kaczmarz methods for t-product tensor linear systems with factorized operators

Lara Kassab, Deanna Needell, Paulina Hoyos, Karamatou Yacoubou Djima, Jamie Haddock, Alona Kryshchenko, Kamila Larripa, Alejandra Castillo, Iryna Hartsock, Shambhavi Suryanarayanan
article en
1 citations

Abstract

Abstract Randomized iterative algorithms, such as the randomized Kaczmarz method, have gained considerable popularity due to their efficacy in solving matrix-vector and matrix-matrix regression problems. Our present work leverages the insights gained from studying such algorithms to develop regression methods for tensors, which are the natural setting for many application problems, e.g., image deblurring. In particular, we extend the randomized Kaczmarz method to solve a t-product tensor system where the measurement tensor is given in factorized form. We develop variants of the randomized factorized Kaczmarz method for matrices that approximately solve tensor systems in both the consistent and inconsistent regimes. We provide theoretical guarantees of the exponential convergence rate of our algorithms, accompanied by illustrative numerical simulations. Furthermore, we situate our method within a broader context by linking our novel approaches to earlier randomized Kaczmarz methods.

BIT Numerical MathematicsVol. 65(3)
Harvey Mudd College (US), University of California, Los Angeles (US), Pomona College (US), Wellesley College (US), Cal Poly Humboldt (US), California State University, Channel Islands (US), Princeton University (US), Moffitt Cancer Center (US), The University of Texas at Austin (US)
National Science Foundation, American Institute of Mathematics, Division of Mathematical Sciences
Openalex Percentile: Top 14%
Matrix Theory and Algorithms
1.50
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.