Diagonal reduction in a two-variable Newton iteration
ID: diagonal-reduction-in-a-two-variable-newton-iteration
For , the Newton step equations imply . Solving the remaining equation gives the displayed scalar recurrence, defined when . Around its error factors exactly asThus any well-defined sequence converging to has quadratic convergence, or reaches that point exactly in finitely many steps. The scalar asymptotic error constant is ; the Euclidean norm error constant on the diagonal is . Around , replacing by gives the corresponding conclusion.
New to topics? Read the docs here!