In previous work several algorithms for orthogonalizing the direction cosine matrix were introduced and their convergence rate and range were theoretically investigated. Three of the most promising algorithms are examined in this paper. lt is shown that the so-called Dual Algorithm is by far superior to the other two from the point of view of speed, computer memory, accuracy, and convergence rate. lt is therefore recommended that whenever the direction cosine matrix is computed by simple numerical integration of a matrix differential equation, the Dual Algorithm be used to orthogonalize the resultant matrix.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Practical Comparison of Iterative Matrix Orthogonalization Algorithms


    Contributors:

    Published in:

    Publication date :

    1977-05-01


    Size :

    1541425 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Strapdown Matrix Orthogonalization: The Dual Iterative Algorithm

    Bar-Itzhackmber, L.y. / Meyer, J. / Fuhrmann, P. A. | IEEE | 1976




    On the Convergence of Iterative Orthogonalization Processes

    Bar-itzhack, Itzhack Y. / Meyer, Jeffrey | IEEE | 1976