Least squares solution of the quaternion Sylvester tensor equation

2019/03/11 by Qing-Wen Wang, Qing‐Wen Wang, Xiangjian Xu +1 · 1 citation
Mathematics · Computer Science · Engineering · #Tensor decomposition and applications #Matrix Theory and Algorithms #Elasticity and Material Modeling

paper · doi:10.1080/03081087.2019.1588848

Abstract

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.

Cited by

• Formulae for the Drazin inverse of modified tensors via the Einstein product

Related

• Algebraic conditions and general solution to a system of quaternion tensor equations with applications
• Preconditioned TBiCOR and TCORS Algorithms for Solving the Sylvester Tensor Equation
• Tensor decompositions and tensor equations over quaternion algebra
• The general solutions to some systems of Sylvester-type quaternion matrix equations with an application
• Gradient-based iterative algorithms for solving Sylvester tensor equations and the associated tensor nearness problems