Higher order convergent algorithms with applications to polynomials and matrices

New stable higher order algorithms for computing matrix nth root are presented. Specifically, a generalization of Denman-Beaver iteration for matrix square and cubic roots are given. The new iterations are obtained by change of variables applied to variations of Newton´s method and higher order methods. Extensions of these methods for orthonormalization of a rectangular matrix with respect to a positive definite matrix are also given