Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

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

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年8月16日

查看全文
  • Alejandra Castillo,
  • Jamie Haddock,
  • Iryna Hartsock,
  • Paulina Hoyos,
  • Lara Kassab,
  • Alona Kryshchenko,
  • Kamila Larripa,
  • Deanna Needell,
  • Shambhavi Suryanarayanan,
  • Karamatou Yacoubou Djima

摘要

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.