Developing LSQR Method for Sylvester Quaternion Tensor Equations

Qiu-Yi Chen , Yi-Gui Ou , Xin-Fang Zhang

Communications on Applied Mathematics and Computation ›› : 1 -16.

PDF
Communications on Applied Mathematics and Computation ›› : 1 -16. DOI: 10.1007/s42967-024-00408-8
Original Paper

Developing LSQR Method for Sylvester Quaternion Tensor Equations

Author information +
History +
PDF

Abstract

In this paper, we consider solving a least-squares problem to the generalized Sylvester quaternion tensor equation. From the properties of quaternions and the Kronecker product, a tensor form of the LSQR algorithm is proposed for solving this problem, the convergence analysis of which is then established. Numerical results are reported to illustrate the feasibility and validity of the proposed algorithm compared with the tensor form of the CGLS method, including when the algorithm is tested with some randomly generated data and color video restoration problems.

Cite this article

Download citation ▾
Qiu-Yi Chen, Yi-Gui Ou, Xin-Fang Zhang. Developing LSQR Method for Sylvester Quaternion Tensor Equations. Communications on Applied Mathematics and Computation 1-16 DOI:10.1007/s42967-024-00408-8

登录浏览全文

4963

注册一个新账户 忘记密码

References

Funding

National Natural Science Foundation of China(11961018)

Natural Science Foundation of Hainan Province(122MS001)

AI Summary AI Mindmap
PDF

103

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/