Frontal Slice Approaches for Tensor Linear Systems
read the original abstract
Inspired by the row and column action methods for solving large-scale linear systems, in this work, we explore the use of frontal slices for solving tensor linear systems. In particular, this paper presents a novel approach for using frontal slices of a tensor $\mathcal{A}$ to solve tensor linear systems $\mathcal{A} * \mathcal{X} = \mathcal{B}$ where $*$ denotes the t-product. In addition, we consider variations of this method, including cyclic, block, and randomized approaches, each designed to optimize performance in different operational contexts. Our primary contribution lies in the development and convergence analysis of these methods. Experimental results on synthetically generated and real-world data, including applications such as image and video deblurring, demonstrate the efficacy of our proposed approaches and validate our theoretical findings.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Linear convergence of Gearhart-Koshy accelerated Kaczmarz methods for tensor linear systems
The Gearhart-Koshy acceleration yields linear convergence to the least-norm solution for tensor linear systems with improved rates over plain Kaczmarz across incremental, shuffle-once, and random-reshuffling schemes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.