Multiplication-free iterative algorithm for LS problem

Many iterative techniques are available to solve normal equations appearing in the linear least-squares (LS) problem. However. because of multiplications and divisions they cannot be effectively implemented in real time. A novel multiplication-free and division-free iterative technique, the dichotomous co-ordinate descent algorithm, which guarantees convergence to the true solution under realistic assumptions, is proposed.