Cubically Convergent Iterations for Invariant Subspace Computation

We propose a Newton-like iteration that evolves on the set of fixed dimensional subspaces of ℝn and converges locally cubically to the invariant subspaces of a symmetric matrix. This iteration is compared in terms of numerical cost and global behavior w