Orthogonalization of a Direction Cosine Matrix by Iterative Techniques

1 September 1972

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems

Vol. AES-8 (5) , 692-694
https://doi.org/10.1109/taes.1972.309589

Abstract

It is shown that the ¿first inversion, transposition, and averaging¿ technique [1] is, assuming convergence, quadratically convergent, since it can be developed very simply by the use of quasilinearization. Only the three-dimensional case is considered; the art of matrix orthogonalization is practiced in more general settings [2] than considered here.

Keywords

RADAR DETECTION
SIGNAL DESIGN
WIRELESS SENSOR NETWORKS
SILVER
SPRINGS
MULTIDIMENSIONAL SYSTEMS
MAXIMUM LIKELIHOOD DETECTION
MAXIMUM LIKELIHOOD ESTIMATION
WIENER FILTER
ANTENNA ARRAYS

This publication has 2 references indexed in Scilit:

An Iterative Algorithm for Computing the Best Estimate of an Orthogonal Matrix
SIAM Journal on Numerical Analysis, 1971
Orthogonalization Techniques of a Direction Cosine Matrix
IEEE Transactions on Aerospace and Electronic Systems, 1969