Newton Iteration: Reconstructing Its Construction and Convergence Mechanism

Authors

  • Huiqin Chen School of Artificial Intelligence, Jianghan University, Wuhan, 430056, China

DOI:

https://doi.org/10.54097/c46z7j09

Keywords:

Newton's Method, Single-Variable Nonlinear Equation, Quadratic Convergence, Truncation Precision, Teaching Logic

Abstract

For the single-variable nonlinear equation f 左圆括号 x 右圆括号 等于 0 standard textbooks usually introduce Newton's method in the following way: the Taylor expansion is truncated to the first order, the remainder term is dropped to construct an iterative scheme, and an independent error analysis is subsequently performed to prove quadratic convergence. This "approximate first, verify later" narrative divides construction and proof into two separate lines of reasoning, loosely joined merely by the statement "neglect higher-order terms." Consequently, students struggle with two foundational questions: what justifies discarding the remainder to yield a valid iteration, and why does this specific approximation achieve quadratic convergence unlike alternative approximations? This paper proposes a reversed instructional sequence. First, we present the full Taylor expansion equipped with the second-order Lagrange remainder and clarify the order hierarchy between the linear leading part and remainder. Second, provided that the derivative does not vanish, the next iterate is rigorously defined as the unique root of the resulting linear equation. Third, we derive that the updated error is of second order with respect to the previous error. We conclude that quadratic convergence of Newton’s method is not a fortuitous result confirmed retrospectively in the proof phase; instead, it is predetermined at the construction phase by the truncation order. By integrating the justification "why the approximation is admissible" during construction with the accuracy check in the proof stage, learners can grasp the core mechanism instead of retaining only superficial understanding.

Downloads

Download data is not yet available.

References

[1] Deuflhard, P. (2011). Newton methods for nonlinear problems: Affine invariance and adaptive algorithms. Springer-Verlag. DOI: https://doi.org/10.1007/978-3-642-23899-4

[2] Higham, N. J. (2002). Accuracy and stability of numerical algorithms (2nd ed.). Society for Industrial and Applied Mathematics (SIAM). DOI: https://doi.org/10.1137/1.9780898718027

[3] Ortega, J. M., & Rheinboldt, W. C. (1970). Iterative solution of nonlinear equations in several variables. Academic Press.

[4] Taylor, A. E., & Mann, W. R. (1983). Advanced calculus (3rd ed.). John Wiley & Sons.

Downloads

Published

13-11-2026

Issue

Section

Articles

How to Cite

Chen, H. (2026). Newton Iteration: Reconstructing Its Construction and Convergence Mechanism. International Journal of Education and Humanities, 25(2), 84-86. https://doi.org/10.54097/c46z7j09