Choice of coordinates and computational difficulty

Computational difficulty can be significantly reduced when optimal control and estimation problems are formulated in well-chosen coordinate systems. It is shown that every LQG (linear-quadratic-Gaussian) problem can be formulated in coordinates such that principal parts of the solution are either well-posed or ill-posed for numerical solution.