pith. sign in

arxiv: 2605.14748 · v1 · pith:AC3VVOU5new · submitted 2026-05-14 · 🧮 math.NA · cs.NA

Iterative Methods for Computing the T-Square Root of Third-Order Tensors

classification 🧮 math.NA cs.NA
keywords convergencemethodsroott-producttensortensorscomputingiteration
0
0 comments X
read the original abstract

We develop and analyze iterative methods for computing the principal square root of third-order tensors under the T-product framework. Tensor extensions of the Newton iteration (quadratic convergence) and the Denman--Beavers iteration (geometric convergence with simultaneous computation of the inverse square root) are proposed, with rigorous convergence guarantees established via the Fourier-domain block-diagonalization of the T-product. We apply these methods to image processing, introducing Tensor Decorrelated Grayscale conversion, T-Whitening, and optimal color transfer under the T-product geometry. We also formulate the Tensor Bures--Wasserstein distance and prove it defines a valid metric on the space of T-positive definite tensors. Numerical experiments confirm rapid convergence and demonstrate that the proposed tensor-based techniques offer improved structural preservation and cross-channel decorrelation compared to classical methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.