On the duality between the fast transversal and the fast rotors adaptive least squares algorithms

The duality between the fast transversal and the fast rotors adaptive least squares algorithms is established. It is shown that these two algorithmic families are related via a time-varying state transformation. The state transformation method is then applied to both the fast Kalman as well as the FAEST (FTF) algorithm, to derive fast rotors counterparts.