Abstract
In this paper, we employ matrix LSQR algorithm to deal with quaternionic least squares problem in order to find the minimum norm solutions with kinds of special structures, and propose a strategy to accelerate convergence rate of the algorithm via right–left preconditioning of the coefficient matrices. We mainly focus on analyzing the minimum norm η-Hermitian solution and the minimum norm η-biHermitian solution to the quaternionic least squares problem, η∈{i,j,k}. Other structured solutions also can be obtained using the proposed technique. A number of numerical experiments are performed to show the efficiency of the preconditioned matrix LSQR algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
