For a map on a Banach space, define wherever the bounded derivative is invertible. It solves the local affine approximation to . Every zero is a fixed point of . Near a zero with invertible derivative, bounded inverses and a locally Lipschitz derivative give the quadratic Newton error bound in a Banach space.
// Target: numerical-analysis.bigb
The finite-dimensional Newton root-finding iteration for a vector equation . At a point with invertible Jacobian matrix, solve the displayed linear system. For , its Jacobian matrix is the Hessian matrix, giving Newton's method in optimization. The update solves the affine first-order approximation ; it can converge to any nondegenerate critical point, including a saddle point.
A multivariable Newton iteration correction must solve the linear system . It exists exactly when the right-hand side is in the image of the Jacobian matrix, and is unique when that Jacobian matrix is invertible. At a singular matrix, there may be either no corrections or several; singularity alone does not decide which. For finding a critical point of a scalar function , use , so the Jacobian matrix is the Hessian matrix. Equal rows of the Hessian matrix with unequal corresponding gradient entries immediately make the correction equations inconsistent.
To solve , let be a bounded approximation to and set . Its derivative is . Every fixed point of is fixed by ; the converse holds when is injective. A good inverse approximation makes a contraction mapping even if itself has an expanding direction.
// Target: analysis.bigb
Let , and near . The integral Taylor remainder gives
A small ball with is invariant under . Iteration there converges at least quadratically, with for .
// Target: numerical-analysis.bigb

Articles by others on the same topic (0)

There are currently no matching articles.