Abstract

This paper treats the problem of finding an orthogonal matrix which is the closest, in the Forbenius norm, to a given nonorthogonal matrix. This nonorthogonal matrix is the result of a fast but rather inaccurate computation of the well-known direction cosine matrix (DCM) of a strapdown inertial navigation system. The known closed-form solution to this problem is rederived using the directional derivative method, and the conditions for minimum distance are derived and discussed. A new iterative technique for solving this problem is derived as a result of the application of the gradient projection technique and the directional derivative method. The practical computational problems involved in this technique are discussed. The new technique is demonstrated by three examples. Although particular attention is given to the 3 X 3 direction cosine matrix, the conclusions are nonetheless valid higher order matries.

Full Text
Paper version not known

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 call

Disclaimer: 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.