Square root and fast algorithms for solving the LQG control problem in discrete time systems

Square-root and fast algorithms for solving the LQG Control problem in discrete-time systems are presented. These algorithms constitute dual forms of existing filtering algorithms. We compare their computational complexity, i.e. number of arithmetic operations and storage requirements.