Newton iteration for a scalar root
Newton iteration uses xₖ₊₁=xₖ−f(xₖ)/f′(xₖ).
Key knowledge
Newton iteration uses xₖ₊₁=xₖ−f(xₖ)/f′(xₖ). Near a simple root of a C² real function, sufficiently close starting values yield at least quadratic local convergence.
Conditions and scope
- f′ must be nonzero at each evaluated step and at the root.
- Distant starts, multiple roots or roundoff can cause failure; this is not a global guarantee.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Section 4.3 Newton update and local convergence argument.
2026-10-10 · Independent AI editorial review: All241 compact claims, hypotheses, displayed equations/conventions and all596 origin semantic links read; entire241-entry author exact-source inspection matrix and declared limitations reviewed. Prior105 actual inherited Mathematics/Information records read for whole-inventory breadth. Targeted independent primary sections are listed below; this does NOT claim every cited source body or every proof was independently re-read. This is AI reference-content review, not human disciplinary certification, exhaustive textbook reproduction or experimental replication. Receipt: mathematics-information-independent-content-review.1.
Entry details
Permanent link to this entry ↗- Record identity
- math-newton-root-method
- Revision
- university-core.1
- Structured reference record
- University core expansion