Computable error-estimates for Newton's iterations for refining invariant subspaces

Abstract

Chatelin has established, under assumptions on the unknown invariant subspace, the quadratic convergence of Newton's iterative refinements. We modify the procedure in line with Demmel's suggestions and obtain a criterion for quadratic convergence in terms of the known initial approximation. Our procedure enables computable error estimates to be obtained for the iterations.