Global and extended global Hessenberg processes for solving Sylvester tensor equation with low-rank right-hand side

Iranian Journal of Numerical Analysis and Optimization

مقاله 9، دوره 12، Issue 3 (Special Issue) - شماره پیاپی 23، بهمن 2022، صفحه 658-679   

نوع مقاله: Research Article

شناسه دیجیتال (DOI): 10.22067/ijnao.2022.78966.1186

نویسندگان

T. Cheraghzadeh¹؛ F. Toutounian^{* 2}؛ R. Khoshsiar Ghaziani¹

¹Department of Applied Mathematics, Faculty of Mathematical Science, Shahrekord University, Shahrekord, Iran.

²Department of Applied Mathematics, Faculty of Mathematical Science, The Center of Excellence on Modeling and Control Systems, Ferdowsi University of Mashhad, Iran.

چکیده

In this paper, we introduce two new schemes based on the global Hessen-berg processes for computing approximate solutions to low-rank Sylvester tensor equations. We first construct bases for the matrix and extended matrix Krylov subspaces by applying the global and extended global Hes-senberg processes. Then the initial problem is projected into the matrix or extended matrix Krylov subspaces with small dimensions. The reduced Sylvester tensor equation obtained by the projection methods can be solved by using a recursive blocked algorithm. Furthermore, we present the upper bounds for the residual tensors without requiring the computation of the approximate solutions in any iteration. Finally, we illustrate the perfor-mance of the proposed methods with some numerical examples.
 

کلیدواژه‌ها

Low-rank Sylvester tensor equation؛ Global Hessenberg process؛ Extended Global Hessenberg process؛ CP decomposition

مراجع