Newton's method revisited: How accurate do we have to be?

Summary: We analyze the convergence of quasi‐Newton methods in exact and finite precision arithmetic using three different techniques. We derive an upper bound for the stagnation level and we show that any sufficiently exact quasi‐Newton method will converge quadratically until stagnation. In the absence of sufficient accuracy, we are likely to retain rapid linear convergence. We confirm our analysis by computing square roots and solving bond constraint equations in the context of molecular dynamics. In particular, we apply both a symmetric variant and Forsgren's variant of the simplified Newton method. This work has implications for the implementation of quasi‐Newton methods regardless of the scale of the calculation or the machine. [ABSTRACT FROM AUTHOR]