Journal
LINEAR & MULTILINEAR ALGEBRA
Volume 69, Issue 1, Pages 104-130Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/03081087.2019.1588848
Keywords
Quaternion tensor; Sylvester tensor equation; iterative algorithm; least squares solution
Categories
Ask authors/readers for more resources
This paper introduces an iterative algorithm based on tensor format to solve the least squares problem of the quaternion Sylvester tensor equation, and examines the convergence properties of this method. The best approximate problem related to the quaternion Sylvester tensor equation is also considered.
This paper is concerned with the solution to the least squares problem for the quaternion Sylvester tensor equation. An iterative algorithm based on tensor format is presented to solve this problem. The convergence properties of the proposed iterative method are studied. We also consider the best approximate problem related to quaternion Sylvester tensor equation. Numerical examples are provided to confirm the theoretical results, which demonstrate that the proposed algorithm is effective and feasible for solving the least squares problem of the quaternion Sylvester tensor equation.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available