02-04-2020 | Original Paper | Issue 4/2020
Golub–Kahan bidiagonalization for ill-conditioned tensor equations with applications
- Journal:
- Numerical Algorithms > Issue 4/2020
Important notes
Dedicated to Gérard Meurant on the occasion of his 70th birthday.
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Abstract
This paper is concerned with the solution of severely ill-conditioned linear tensor equations. These kinds of equations may arise when discretizing partial differential equations in many space-dimensions by finite difference or spectral methods. The deblurring of color images is another application. We describe the tensor Golub–Kahan bidiagonalization (GKB) algorithm and apply it in conjunction with Tikhonov regularization. The conditioning of the Stein tensor equation is examined. These results suggest how the tensor GKB process can be used to solve general linear tensor equations. Computed examples illustrate the feasibility of the proposed algorithm.
