Abstract
In this paper, an iterative algorithm for the standard quaternionic least squares problem is proposed without using the real (complex) representation. Our algorithm is implemented in the quaternion field and by means of direct quaternion arithmetic and is a natural generalization of the LSQR algorithm for the real least squares problem.
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.
